Find subarray with given sum

In this video, we’ll talk about some basic operations on fixed size arrays.We’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 an Introduction to Data Structures And Algorithms. This Course is created to Explain the Fundamentals of data structures and algorithms. This video Will explain What is data?, What is data structure?, The Need for Data Structures, What is algorithm?

#DataStructures #Algorithms #DSandAlgo #ProgrammingKnowledge

★★★Top Online Courses From ProgrammingKnowledge ★★★

★★★ Online Courses to learn ★★★

★★★ Follow ★★★

DISCLAIMER: This video and description contains affiliate links, which means that if you click on one of the product links, I’ll receive a small commission. This help support the channel and allows us to continue to make videos like this. Thank you for the support!

[codedaily]

Audio is not clear pls check and re-upload