1 hour of DSA discussion.
I was given below problem to solve with slight variation, instead of returning the length, I had to return the start and the end indices of the subarray.

https://leetcode.com/problems/shortest-subarray-with-sum-at-least-k/description/

I solved using sliding window pattern, but didn't work out as I received rejection email a day later.

Hope this helps to anyone!