Back to Question
How can you find a subarray with a given sum efficiently?
Question Explain
This classic problem requires finding a contiguous subarray whose elements sum to a target value. It tests sliding window techniques and hash map usage for prefix sums.