Input will be a string. We need to o/p a string with the order of characters same as the input but with same characters grouped together. I/P: abcdacde O/P: aabccdde
I/P: kapilrajadurga O/P: kaaaapilrrjdug I/P: 1232 O/P: 1223 ……………….. O(n) time……….. O(1) space……………. how can you approach these type of string related problems, is there any specific technique involved? -- 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.