Q: Given a string find all the number of sub-strings which contain all the five vowels at least once.
It is solved in two ways:
It is solved in two ways:
- A slightly more complicated linear scan method
- By generating all the sub-strings and then checking whether or not it satisfies the our requirements. (brute force)
0 comments:
Post a Comment