How to think about to write code of finding the longest subarray with sum greater than or equal to k in O(nlogn).
How to think about to write code of finding the longest subarray with sum greater than or equal to k in O(nlogn).
I am not getting why its not passing the testcases. https://codeforces.com/contest/1786/submission/192419432