Ask your own question, for FREE!
Computer Science 16 Online
OpenStudy (anonymous):

Brute Force Text Matching:You are required to count, in a given text, the number of substrings that start with an A and end with a B. (For example, there are four such substrings in (CABAAXBYA.)

OpenStudy (anonymous):

can anyone pls tell me how there are 4 substring???

OpenStudy (anonymous):

Okay, substring is a string within a string. For instance, "Hello" substring 2, 2 would be "ll" as the starting character 2 would be He and then you stop two characters later at o. Hello Now, in that string, from A --> B:- CABAAXBYA There are four As:- CABAAXBYA And two Bs:- CABAAXBYA So, there are four patterns as so:- CABAAXBYA CABAAXBYA CABAAXBYA CABAAXBYA

OpenStudy (anonymous):

u mean 4 substrings r: AB,AAXB, AXB, AYB

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!