BS-4. Search Element in Rotated Sorted Array - I
Vložit
- čas přidán 31. 05. 2023
- Problem Link: bit.ly/3OmIp5d
Notes/C++/Java/Python codes: takeuforward.org/data-structu...
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 Introduction of Course
Please comment understood and give us a like if you got everything :)
Understood sir! This really cleared my doubt regarding the process the code performed in else part! Thank you sir!!
Very well Understood sir 😀
Understood
Now I clearly know how you got a job at Google.😁
Understood
We never move backward bcoz we have Take You Forward😇
That's a good one 😁
little cringe brother.
God tier explanation. I truly can't put in words how easily and clearly you were able to explain a seemingly confusing question!
No wonder how demotivated I was when I saw that question and was looking for a good explanation since last 7 days (no, not even exaggerating). But, this man is love!!! Keep going @Striver :) You're our hope!!
what an absolutely great explanation. i watched another video before this and it was so convoluted for no reason. yours is so simple and easy to grasp
I was struggling with Binary search on sorted array for a long time,
Your key point "Eliminate one half" has cleared my confusion.
Thank you so much Striver
09:56 seriously i watched this many times to see your expression 😄
Yeah and The little smile when he continued... so cute ❤
that,s nice on which lecture you are currently
@@yoongicorn7973
None can compete with this man....!!! Simply amazing 👏. Great Work Striver Bhaiyya
#DSA ka baap.
The best thing about you is that you are not paid and spreading knowledge to all the aspirants...
I think people should pay for this next level quality content.
@@iamnoob7593 haa...if u wish to.. then plss donate that money to some nearby ngos.
Understood! Super fantastic explanation as always, thank you so so much for your effort!!
Understood as always! The intuition/approach is just awesome🤩. Spellbound!
One of the best explanations for this problem on the internet!
00:24 Problem statement
01:06 Example
01:43 Solution-01 (Linear Search)
02:21 Solution-02 (Binary Search)
05:00 Dry-run
11:42 Pseudocode
15:17 Code
15:28 Complexity
09:56 reaction lol
Correct
nalla bc
@@epsaepsit4645hahahahaha
mann unbelievable intuition and explanation!! loved it !!! understood completely
crazy concept striver ! I'm just loving your binary search playlist!!!
Amazing video, very good explanations, took sometime to understand but went through it again and again to understand it completely. Thanks for making such quality content Striver Bhai
Understood bhaiya , thw way of teching is another level, I don't have words to express my feelings. Thanks a lot, bhaiya!!!
best possible understanding through the BS playlist!
The best explanation I have found for this problem.
Alog is very simple now
1. Identity the sorted half.
2. Check if the target lies in the sorted half.
Thats it you need to do this two things only.
Best explanation so far in binary search
Totally understood.your teaching is superb.thank you
This great quality content for free !!! Amazing work , please keep making these great videos 👏👏👏👏
Understood. The best explanation on youtube for this problem..
Understood! What a simple and affective explaination
Great Raj bhai... you deserve to be in elite class.
keep rocking
bro the way you explain is just amazing thanks a lot
What an explanation bro..
You are our lives savior 🙏🙏
one small correction in the code it will fail if the array is [3,1] and target = 1
because of code in line no 9 i.e k
Thankyou for clear explanation. Loved it.
understood
Thank you striver for making things easy...
Thank You Raj Vikramaditya.
I am a scaler student , i fond of Your teaching skills more than scaler instructors.
Very nice explanation. Thank you
Understood,Thanks stiver for this amazing video.
Greatly explained 👏👏
Understood Please keep consistent and eventually complete the series of A to Z DSA Course....
Thank You
striver's explanations are the best
Understood, thanks for your efforts!
Thank u for such a great explaination
Understood very well !
Looked at neetcode video, then yours. His explanation was a bit confusing and had to do some examples to understand it. Yours almost made it a regular easy binary search
Understood it very well :)
Best Explanation!
Absolutely understand ❤
bhaiya bhot bhot bhot hi aacha genuinely , bhot pyara samjhaya, too good!
YOU Can understand very well and i see a many video but my concept is not clear but just i see that video which would be clearly the concept very easily
Great explanation.
Thankyou for providing this course for free bro.
Notes for me☺
As we get our mid at any index checks arr[num]==target if it satisfies return here.
After that
Case 1>
Array is left sorted(we check it by standing on mid),
==>Checks where our target lies in sorted(between low to mid ) or outside it by using
if(arr[low]=target)
if it lies inside this it indicates we need to collapse window by taking high to mid -1 otherwise low to mid+1
Case 2>
Array is right sorted similarly we check for it and updates our low and high accordingly
if we never get it we return -1 to it
thank you so much sir...respect for your amazing efforts...really no one teaches better than you... raj cum striver..i wish for your long life and happiness..
This is the best explanation
Nice Explanation!👍
Great help you are doing
Love the explanation. THanks
understood very well 🙌
Very well explained 👏🏻👏🏻
yes understood will try it out
Understood bro!! Ur a gem!
here after love babar lec - 14 for rotated sorted array he is using the concept of pivot element which is little messy
but striver what a lovely lovely explanation
in 1 go i understood and coded it myself
I learned recursion stack and queues from him , he's not a good teacher .
Understood bro,thank you so much.
dill se thank you!
Understood, Tq for this great help by teaching in youtube for free
Amazing explanation sir 😇!
Great explanation
honestly I was very confused and demotivated after watching Rohit negi sir's explanation in paid course , i spent 2 hour to understand this problem but could not get it , after watching strivers explanation i get it only after single iteration. thanks a lot . now i am going to follow strivers AtoZ DSA
Understood very well !!!
woww what a great explanation
Finally understood this problem. Every time I saw rotated sorted array or binary search in general I always skipped.
Hats off to you❤
Can anyone share the video link for peak element ?
Understood well thanks for this valuable video sir
best explanation ever
Best explanation💯
Very good explanation
quality GOD LEVEL 🔥 🔥
thanks striver understood everything
Excellent explanation
understand bro !! keep uploading :)
Thank You Striver....Understood it
When we say that val @low < val @high means array is sorted, how about the case when the array is reverse sorted and rotated somewhere?
Nice Explanation😄
Thank you so much!
Understood. Thanks a lot.
sir Best explanation Thanks!!
acche se samzaya, thanks
Love you bhaiya . You are my inspiration ❤
Understood bhaiya!
Very well Understood sir
Understood, thank you.
Understood
Thank you.
You have perform binary search in sorted array ( keeping ascending order ) in mind. Am I right? This will not work if array is sorted ( can be in ascending /descending ) order ( not known before hand ). Correct me if I am wrong.
Good explanation
Understood🙌
understood, thanks striver
nice explanation
Understood Bhaiya!
UNDERSTOOD SIR!
Thanks a lot Bhaiya
Great, master ji.
Good Explanation
Understood sir ❤
Great Describing