4. STL Functions for Binary Search | Detailed explanation with examples & solution-Lower,Upper Bound

preview_player
Показать описание
Smart people use STL to apply binary search! Become smart with me! We have covered some theory, taken examples and running code and also solved a question using STL. This is a very very imp video! ❤️

You can practise the question here-

You can get 𝐃𝐈𝐒𝐂𝐎𝐔𝐍𝐓𝐒 using code "KEERTI" -

#softwaredeveloper #dsa #interviewpreparation
Рекомендации по теме
Комментарии
Автор

This is called High quality teaching covering everything that we do need including small small doubts too. Mam do more videos with the same level of confidence we were there to hold you.

sandeepkohli
Автор

thanks di, I understood it very easily!

comparisondata
Автор

WOW!!! A+ Quality teaching Mam . you know our Mannn Ka doubt ... thats why you make us understand everything so easily . stay Succesfull Mam.

Raj_singhh
Автор

I started preparing for DSA 3 months back, still learning new stuff
Thankyou!

Good thing is that you knew when we didn't understand the definition and you said it at 03:05

ScienceSeekho
Автор

yesterday It got a run time error !
but today's solution is so better.
thank you

anilreddy
Автор

Never used STL library to implement binary search before. But from now I am pretty confident how to use Binary Search using STL library:
1.binary_search() - > returns true or false depending on the value is present or not.
2. lower_bound() -> returns the iterator pointing to an element >= target.
3. upper_bound() -> returns the iterator pointing to an element strictly greater than target.

Great explaination ma'am. Waiting for next video!!

arghya_
Автор

You are among the few female tutors who are very much confident and knowledgeable. I appreciate your efforts and learning from you is a great experience....

yuv
Автор

video 4 done learnt about lower and upper bound

kkumar
Автор

This helps a lot!!
What i feel is people who are comfortable with Java can search for an alternate way on Java
that way can know many things too!!😇

vigneshiyer
Автор

ma'am you are doing great work. like covering this topic on such detail level . loved your contents. please continue

akanchhaece
Автор

Wow! I didn't know this trick before. Thank you!

nidhikumari
Автор

Hi keerti..you r doing good work, i request you pls do all dsa coding in java language because most of the student love to code in java

mdwasim
Автор

kal bhi dekha aaj samj aya repeat karke aaj samj aya

dipeshjoshi
Автор

Thanks. Waiting for more medium and hard level questions to be explained.

venkatkrishna
Автор

Hi Keerthi,
Could you please write the program in java because I am not aware with C++ language.
It would be great if you take this initiation.
Thanks

mdrashidiqbal
Автор

Ma'am please either upload long videos or increase the frequency. These are the most precious videos on yt rn, much better than other channels like the all time famous, Code Help. But we have our placements right beside us. Plz ma'am.

prateek
Автор

In many codes there are values l and r to traverse any array. But how computer knows that the l is leftmost element and r is rightmost? In this video you used arr and arr+n

rtarts