Algorithm

We can use a sliding window to find the subarray summing to k.The idea is to expand the window by moving the right pointer and keep adding elements to the sum. If the sum exceeds k, we shrink the window from the left by moving the left pointer and subtracting elements. When the sum equals k, we return that window’s subarray.

Initialize two pointers, left and right, both at 0.
Initialize a running sum to 0.
Move right pointer, adding elements to the running sum.
If running sum exceeds k, move left pointer forward, subtracting elements from the sum.
When running sum equals k, return the subarray between left and right.
If no such subarray found, return empty result.