Find the longest continuous subsequence of numbers in an unsorted array such that difference between any two nos. in that sequence should not be more than K. For example: 2,1,8,12, 10,15, 13, 25 and k=7
8,12,10,15,13 is the sequence (15-8=7) -- 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.
