Skip to content
Related Articles

Related Articles

Tesco Interview Experience | Set 3 (Online Test)

View Discussion
Improve Article
Save Article
  • Difficulty Level : Medium
  • Last Updated : 27 Oct, 2017

Q.1> Given a string, find the longest subseqence of chars from string that conntains all vowels may be repeated but in a e i o u order
Examples:

Input : aaejkioou
Output : 7

Q.2> Given a string, e. g., abababaa it can have many suffixes including whole string. Return sum of max common prefix length of given string with all its suffixes
Examples:

Input :  ababaaa
Output : 13

This article is contributed by din123. If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.

My Personal Notes arrow_drop_up
Recommended Articles
Page :

Start Your Coding Journey Now!