the problem can be solved in O(n) time without using extra space .using the algorithm of "finding the subarray of maximum sum in a given array."(time complexity is O(n) and no extra space). here you just have to stop when you find sum equal to k.
-- 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.
