Find subarray with given sum

In this video, we’ll talk about some basic operations on fixed size ’ll see an interesting problem here, subarray with given sum. In this problem, we have to find a subarray of any size whose elements sum is equal to given sum k. In this problem, we are using sliding window technique, which we used in the previous video. We solved this question on gfg, so that you can have a proper feel of real interview questions. In this video, you’ll also learn about asymptotic notations, they are basically mathematical notations which represent order of growth of any mathematical function. There are three famous notations which you’ll see in this video, they are big O , Theta , Omega. Welcome to the first video Tutorial on Data Structures And Algorithms. In this video I am going to provide a ... #ProgrammingKnowledge #Data_Structures_And_Algorithms #Data_Structures #algorithm #Algorithms #Algorithms_Tutorial #Data_Structures_Tutorial #Arrays #Strings #Stacks 20220404 sWQjgx9s5I8