Q. Find all the patterns once which are present in the character array given. A pattern is a sub-array containing 2 or more chars.
Example: i/p: aabcdadabc o/p: ab, abc, bc, da -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
