BS-2. Implement Lower Bound and Upper Bound | Search Insert Position | Floor and Ceil

Lower Bound: bit.ly/43967G5
Upper Bound: bit.ly/3IoKGce
Search Insert Position: bit.ly/3ocI0HW
Floor and Ceil: www.codingninjas.com/codestud...
Notes/C++/Java/Python codes:
Implement Lower Bound: takeuforward.org/arrays/imple...
Implement Upper Bound: takeuforward.org/arrays/imple...
Search Insert Position: takeuforward.org/arrays/searc...
Floor/Ceil in Sorted Array: takeuforward.org/arrays/floor...
We have solved the problem, and we have gone from brute force and ended with the most optimal solution. Every approach's code has been written in the video itself. Also, we have covered the algorithm with intuition.
Full Course: bit.ly/tufA2ZYt
You can follow me across social media, all my handles are below:
Linkedin/Instagram/Telegram: linktr.ee/takeUforward
0:00 Lower Bound Explanation using examples
10:53 Lower Bound Implementation
13:35 Lower Bound Code (in C++)
13:55 lower_bound() C++ STL method
15:33 Time Complexity Analysis of Lower Bound
15:46 Upper Bound Explanation using examples
17:23 Upper Bound Implementation
18:56 Upper Bound Code (in C++)
19:13 Time Complexity of Upper Bound
19:20 upper_bound() C++ STL method
19:47 Search Insert Position
22:53 Floor and Ceil in Sorted Array
28:44 How is Binary Search making sure that we get the smallest index?
31:40 Outro

[@takeUforward]

Please comment understood and give us a like if you got everything :)

[@RachitAgnihotriBEE]

Sir, how lower and upper bound different just by removing an equal to sign. Why lower bound is not the largest value just smaller or equal to the given value?

[@sudhanshushekhar4222]

understood

[@rjedits6717]

@@RachitAgnihotriBEE bro why your name is rachit not prachi even if just adding P and removing T from your name. hope so you got the answer there is a difference of equal to sign thats why there name is different as lower and upper bound.

[@RachitAgnihotriBEE]

@@rjedits6717 mujhe Gyan Dene se accha jakar lower bound or upper bound ka diff dekhle , kabhi set jesa kuchh padha hoga 10th or 12th me to smjh aa jaega ,

[@jeet-smokey]

Understood

[@saketjaiswal9381]

27:00 a litlle error please correct if(a[mid]

[@yashrajdeshmukh6759]

Thanks had that confusion

[@Hassainsyed]

Cool thanks Saket

[@thefourhourtalk]

thanks yar ❤❤ had a same doubt

[@sneha_109]

Can u explain

[@thefourhourtalk]

@@sneha_109 yes I can

[@sagarhiremath4899]

i feel the lower bound explanation and the provided GFG questions don't match with each other, question might be modified after some time

[@tanoysaha4575]

Yes, it’s different 🫡

[@recordings8956]

just add this condition in beginning:
if(x < v[0]) return -1;

[@mr.kaushik8518]

What is v here​@@recordings8956

[@aishwarybhat5673]

​@@recordings8956 class Solution:
def findFloor(self,A,N,X):
l=0
h =N-1
ans=N
if X < A[0]:
return -1
while l=X:
ans = mid
h = mid-1
else:
l =mid+1
return ans
I corrected my code but its still not working

[@pratiksingh4700]

​@@aishwarybhat5673
if(a[mid]

[@mianawais99]

Really great series. Made in such a way easy to understand in no time. Great work 👏

[@shaurya2608]

Floor and Ceil without using "ans" variable -
> For floor just do a normal binary search and return end
> For ceil just do a normal binary search and return start

[@nagame859]

Thanks pal!

[@nostalgiccringeallhailchel3881]

doesn't work

[@zerr0n7eet]

correct!
pair getFloorAndCeil(vector &a, int n, int x) {
int low = 0, high = n-1;
pair p;
while(low x){
high = mid - 1;
}else{
low = mid + 1;
}
}
p.first = high >= 0 ? a[high] : -1;
p.second = low

[@SWATHYBMIS]

yes , because for floor , the end/high pointer needs to go to lower search space (mid-1) and for ceil the low/start pointer needs to go to higher search space (mid + 1)

[@RaghavSingla-er9ub]

thanks daddyyy

[@shashikumar2382]

I was fearing from binary search but once Understood in depth ,I was able to do all question in this lecture my self .
Thank you so much for this wonderful explanation .Just keep doing it .

[@habeeblaimusa4466]

I am actually revising my concept and this Binary search series has been helpful.
Thanks Striver

[@cinime]

Understood! Super amazing explanation as always, thank you very very much for your effort!!

[@anuragsingh8910]

0:00 Lower Bound Explanation using examples
10:53 Lower Bound Implementation
13:35 Lower Bound Code (in C++)
13:55 lower_bound() C++ STL method
15:33 Time Complexity Analysis of Lower Bound
15:46 Upper Bound Explanation using examples
17:23 Upper Bound Implementation
18:56 Upper Bound Code (in C++)
19:13 Time Complexity of Upper Bound
19:20 upper_bound() C++ STL method
19:47 Search Insert Position
22:53 Floor and Ceil in Sorted Array
28:44 How is Binary Search making sure that we get the smallest index?
31:40 Outro

[@thenriquevicentini]

I don't usually comment on youtube, but I had to login just to say how incredible was this lesson! Thanks very much for this videos!

[@rahulsidhu5945]

Sir your lectures are very very helpful to us.. This type of content to provide free is very hard.. We are really thank full to you.. I was watching your lecture from 10 days.. Then today I just realize to do just thankfull to you..😊😊blessings++

[@vishious14]

UNDERSTOOOOOOOD!!!!, was able to solve both problems as soon as you taught the lowerbound approach.

[@jyothishreddynagaram6789]

understood everything. You are doing great work, keep it up!

[@codiescoderszone1518]

this man is a gem!

[@rahulkumarsingh5278]

your understanding about Dsa is excellent

[@abhishekverma7604]

i am on the verge of completing this a2z sheet ,hopefully i will do it by the end of june by myself on my own pace since the tougher side of the sheet is already been done by me... u r gem of a person Raj bhya..♥

[@shashanksaurabh6478]

which topics do you have covered till now?

[@OscarMartinez-nt6zn]

This content is gold.

[@sauravchandra10]

Completed graph and dp series in the previous 20 days, and I am super excited to complete this BS playlist as well.

[@kshitijtakarkhede7833]

how did u practice question , what strategy do you use, cause there are so many videos?

[@sauravchandra10]

@@kshitijtakarkhede7833 I targeted atleast 5 videos daily

[@kshitijtakarkhede7833]

@@sauravchandra10 Na bro I wanted to ask how you practice the question cause as days passed by things start to pile up 🥲 , nd then i started to forgot ....how ou beat this?

[@sauravchandra10]

@@kshitijtakarkhede7833 just do these problems 2 3 times because these problems are most likely to be asked

[@kshitijtakarkhede7833]

@@sauravchandra10 thanks bro

[@graviton001]

Was able to do every single question after lower bound by my self thanks ❤❤. Literally built my thinking ability.

[@AyushKumar-kx3oz]

kya padhate hooo bhai tum mera dil happy happy hoo gaya jaise aapne explain kiya hain maza aa gaya
Understood clearly

[@DTALKS01]

Understood everything.... Feels like you will taking me forward from my Village to google or Microsoft or Amazon fore sure ❤❤

[@hareshnayak7302]

Understood,Thank you striver for this amazing video.

[@wog4299]

yet another amazing explanation by striver

[@smitj5404]

Much love to your work Raj bhai (Striver)❤🙏

[@harshitjaiswal9439]

Understood sir! Golden video!

[@kiranmoura2974]

You explained it very well .... thank you so much sir for your efforts .❤

[@amitkoushik5504]

Wowww .... finally 🎉🎉❤❤thank you striver 🤗🤗

[@nitesh1543]

In java there is no direct method to find lower bound or upper bound but indirectly you can find with the help of Arrays.binarySearch(arr,target) method
public class Solution {
public static int lowerBound(int []arr, int n, int x) {
// Write your code here
int ans = Arrays.binarySearch(arr, x); // built in method for binary search it will return the smallest index where target is present i.e lower bound else it will return a negative value
if(ans

[@chethanprabhu4475]

No point of using it for interviews

[@rahulkarki6857]

love for the knowledge you have respect man!!🤓

[@shrirambalaji2915]

Understood, Great explanation Brother, Thank you

[@sahibahmad3880]

Understood very well!!!

[@utsavseth6573]

Very beautifully explained Raj. And that ans technique was too good. Really helpful. Good work bhai.

[@falaknaaz789]

Understood...explanation was really awesome ❤😊

[@Manasidas99]

Really great series I really appreciate lot thanks bro.

[@kaushiksen2190]

Understood Sir. Loved it. Thank you

[@mohammadasif5798]

crystal clear understood thank you so much

[@user-ww7kv3un2h]

you have beautifully explained this topic

[@user-ti3bd8mp1w]

understood
Thank You @striver for making things so easy...❤❤

[@abhisatya23]

Understood very well.👌👌

[@rahulreddy3588]

Understood clearly!

[@VarunKaushal-zx9zq]

Understood, Thank you sir!

[@them.pranay7196]

TQSM understood Very Elegant way of code

[@sayan_31]

Amazing explanation . Thank you sir ❤❤

[@manavsingh5919]

Thank You... I understood it very well :)

[@shivarajbandaru2216]

Great class. i liked it a lot . Thank 😀u for simple explaination

[@ayushsharma-bi7zj]

understood amazing explaination

[@jasmeetsingh5174]

Thank you bro ❤ loved the lecture

[@infernogamer52]

Understood Bhaiya!
Very well explained...

[@raunakkumarmishra1449]

amazing session

[@nehathakur40]

clear explanation!

[@khushiii8672]

understood !! thank you so much

[@HarshKumar-ip5nr]

Completely understood your solution and intuition. One thing I especially like about your channel is the intuition building and clean intuitive code. For eg. in the last part when you told about either low/high to be our answer, it is very intuitive to make ans variable instead of returning either one. Really appreciate the efforts and free content.

[@himanshukaushik9223]

Bro can you share code of ceil the floor question

[@YASWANTHSIDDANATHAM-mi8qk]

Understood thanks striver for amazing video

[@AkshitGupta-mp6he]

awesome lecture... what an explanation 🔥🔥🔥🔥

[@user-qi9wt1em7d]

Really helpful lec

[@riyabankawat4998]

understood everything bhaiya .. thankyou

[@AnmolGupta-oj4lm]

Understood Very Well

[@ramanjaneyuluv479]

understood very well

[@rohitprasad2147]

Awesome 👍

[@senseiAree]

Thank you Striver, My Intuition is actually improving. Its not about solving the problems, its about understanding the diverse approach.
Understood ❤

[@simarjeetkaur6781]

Understood Sir 🌟

[@NazeerBashaShaik]

Understood, thank you.

[@nikhilnallagoni7379]

great explanation understood

[@khanzarin9960]

great teaching

[@aakashsharma780]

Understood Sir 🙌

[@per.seus._]

UNDERSTOOD❤

[@ashutoshkr99]

Understood well...!!

[@DR-mq1le]

understood, thanks!

[@peanutcoder9361]

Nicely explained

[@areebahmed3561]

Small Small 9:17 wow, what an enthusiasm for teaching and what a style to deliver I wish I had these skills too love you striver bhaii :)

[@surbhirathore._]

Understood!❤

[@harshverm776]

Yes, Initially on pen & paper. I tried to solve the problem by myself only. There I was getting help from low & high pointers only but there were some of the end cases which I was not able to pass.

[@makingthamilan1592]

Understood bhaiya thanks a lot man🙂

[@MAHESHAITBECS]

striver u r a genius ❣

[@ganeshjaggineni4097]

NICE SUPER EXCELLENT MOTIVATED

[@harsh6810]

UNDERSTOOD!

[@sukhjattana5887]

ultimate! 👏

[@KCOYASH]

Understood : ) thanks

[@SureshKrish-uf6ht]

understood binary search thank you sir

[@RaviKumar-sn6tu]

understood sir ...thanks a lot

[@kushagramishra5638]

understood!

[@k.satish3663]

Nice explanation

[@k.s5964]

Understood 😊

[@kiranmoura2974]

Understood 👍👍

[@praveenkanwar953]

Understood! 🎉

[@mohdrihanali2164]

Understooood!

[@alkasingh2124]

Thank you Sir ❤

[@Mythri333]

Thank you 😊😊

[@abdullahanis5761]

Here it is finally

[@CodeNinjaByte]

maja aa gya striver bhaiya

[@mohitsingh13]

Understood ❤

[@AbdurRahman-sp6sm]

extran ordinary explanation

[@mdsajidanwar6416]

Thank You

[@khalasianiket816]

understood ❤

[@YourCodeVerse]

Understood✅🔥🔥

[@adityarajsrivastava3291]

understood!!!

[@hallupandet228]

understood🤟

[@GarimaShukla-jq8sf]

Understood 😊😊

[@ArpanChakraborty-do6yz]

awesome🤩🤩🤩😍😍😍😍

[@user-ke7fs7ds6h]

understood, no chance of any doubt