How to think about to write code of finding the longest subarray with sum greater than or equal to k in O(nlogn).
Can anyone help me in sorting this question.
How to think about to write code of finding the longest subarray with sum greater than or equal to k in O(nlogn).