Lecture 13: Binary Search Interview Questions [Google, Amazon, Microsoft] || ProblemSet - 1

In this Video, we are going to solve LeetCode questions using the concept of Binary Search.

There is a lot to learn, Keep in mind “ Mnn boot karega k chor yrr apne se nahi yoga ya maza nahi para, Just ask 1 question “ Why I started ? “

Homework: Added in Video already
Homework Questions:

Question Links:

Do provide you feedback in the comments, we are going to make it best collectively.

Telegram Group Link: Love Babbar CODE HELP

Connect with me here:

Intro Sequence: We have bought all the required Licenses of the Audio, Video & Animation used.

Timestamps:

00:00 - Introduction
01:13 - Question 1
04:11 - Promotion
05:14 - Approach for Question 1
10:43 - Implementation
16:34 - Dry Run
21:19 - Submission on Portal
23:28 - Question-2 [Find total no. of Occurrence]
25:24 - Question-3 [Find Peak in Mountain array]
27:44 - Approach
34:55 - Implementation
35:50 - Dry Run
38:24 - Submission on LeetCode
40:50 - HomeWork

#DSABusted #LoveBabbar

[omeshnath]

Bhaiya app toh pichla lecture khtm karne se pehle hi dusra lecture daal dete ho thumbs up

[musharrafm]

This is by far the best DSA course ever on the
Thank you so much bhaiyya!
I'm able to understand DSA like a robot now, after struggling for 1 year searching random videos on YouTube.

[karanchilana]

You are absolutely leaving a legacy behind every lecture.. student's respect towards you is increasing constantly by the magnitude of your hard work.. thanks a lot man

[techprogrammer]

Literally Cried babbar bhai because I am not able to find the best course for DSA. But you are making the videos which I wanted and 1 hour videos are not at all making me bored because I love your way of teaching and style. Please dont stop the series any way. Because it makes my heart to be broken 💔. Love from Hyderabad.

[harshmedhavi]

Now that's what we call as Quality content! Bhaiya please continue like this, we all are blessed to have you as our mentor! Thanks.

[sahilanand]

The best and the unique thing about this coursr is, it's not helpful for beginners only. Instead it's helpful for all skill levels of programmers.
Best content 🔥

[abdullahshaikh]

For question 2:
int arr) {
int start = 0;
int end = arr.size()-1;
int mid = start + (end - start)/2;

while(start <= end) {
if(arr[mid -1] < arr[mid] && arr[mid] > arr[mid+1]) {
return mid;
}
else if(arr[mid] < arr[mid+1]) {
start = mid + 1;
}
else {
end = mid;
}
mid = start + (end - start)/2;
}
return -1;
}
faster than 93.30%
ye approach intutive aur efficent hai

[ayushgupta-gtch]

the most admirable aspect is that you are not in a hurry, you try to explain each topic through many times and in many ways, , , thats really a commendable job. rest everything is completely fantastic

[govindsuryavanshi]

First I have completed all DSA series and now conclude this is Greatest ever DSA series to exist on youtube or paid courses. Your contribution will be remembered. You're God of DSA for us🙇‍♂

[nipunbansal]

I am in first year and this course make me skillful than my seniors(mostly) in coding .
Thank you for this

[nitinsharma]

This is best dsa course I've ever encountered in youtube Thanks for such great content free of charge

[Nishad_Ranade]

Bhaiiya one suggestion ....I want two things from you. 1) First one is If possible you give topic time table that which topic you will teach us in which day or date so we can atleast prepare the topic understand the topic by ourselves and solve some problem related to topic which helps us to understand all points that you taught in video 2) And second one is you give all difficulty level question links ( generally medium and hard) and maximum problems of that topic to us that we can master the topic and solve any problem of that topic in all formats in interview or in CP, or in leetcode and all other platforms....

[vikasjat]

Thank you so much bhaiya for giving us this series. Almost all the students in our college use this series to prepare DSA.🙂

[dheerajmehra]

what did i learn in this lecture
1. how to manipulate the standard binary search code when required if the array is sorted
2 . how to find first and last occurance of the element
3. how to find the total no of occurance of the element in the sorted array
4. how to find the peak index of the mountain array

[sjcreations]

Bhaiya may the Almighty bless you for providing such a quality content for free to all the students, 👍☺

[yashzawar]

please try to cover more questions so that we will get enough confidence to solve by ourselves. Great content and great efforts, this DSA series is truly amazing and you are a gem! <3

[daayush]

Eagerly waiting for part 2 and 3 of binary search questions :)

[funlearning]

video completed.... consistency is power...lets see the magic

[mazharsaifi]

i can feel and see my improvement in the dsa after learning from your lectures ...thankyou so much Babbar bhai...❣❣

[rahulrastogi]

Bhaiya instead of doing e=mid in mountain array question we could have also added a new condition for the peak itself where (arr[mid]>arr[mid-1] && arr[mid]>arr(mid+1]) ... it's just for more clarity if by chance somebody is not getting it ... Thanks Bhaiya ❤️