Can it be done this way ..Take count of each alphabet for all the three strings and store separately.. Then for each alphabet in the third string, check if its count is equal to the sum of the counts of the corresponding alphabet in the first two strings .. If the counts match for all alphabets then the third string is an interleaving of the first two ..
-- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@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.
