Find Subarray With The Given Sum | GeeksforGeeks | Brute force + efficient method

In this video I am explaining the brute force and efficient algorithms for the from - find Subarray with the given sum.
You are given an array of unsorted integers and you have to find such subarray which is having the given sum. I solved this problem by using the concept of HashMap in O(n) time complexity. This question is very important from the interview point of view. You should try to solve this problem at least once. this question is available on GeeksforGeeks.