@gene i think for 3 4 2 you need to start from left most element, and then make substitutions one by one. so it will be 3 4 2 2 4 3 2 3 4
@all i googled a bit, and found that O(n) solution is possible for it, any idea ? On Sun, Mar 25, 2012 at 1:59 PM, Kartik Sachan <kartik.sac...@gmail.com>wrote: > +1 @saurabh...:P > > -- > 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. > -- 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.
