https://ide.codingblocks.com/s/351376 - This is the code to the problem Longest Subarray having sum of elements atmost ‘k’. Done using sliding window.
Since the size of the window is changing I cant figure out the time complexity of this program. Please help.
Doubt sliding window
it is simple na ,ur pointers(s and e) are traversing the array only once so time complexity is o(n)