@above.. I m sorry, A would be 1 2 3 4 5 .. On Jan 3, 12:03 am, atul anand <[email protected]> wrote: > @praveen : i guess we can optimize the space to O(n); > > if diff b/w two number is <=K then A[i]=A[i-1]+1; > > if condition fails temp_maxLen=A[i-1]; > if(temp_maxlen > maxLen) > { > maxLen=temp_maxlen; > > > > > > > > }
-- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
