BS-4. Search Element in Rotated Sorted Array - I

preview_player
Показать описание


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.

You can follow me across social media, all my handles are below:

0:00 Introduction of Course
Рекомендации по теме
Комментарии
Автор

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

takeUforward
Автор

We never move backward bcoz we have Take You Forward😇

abhisheksinghmehra
Автор

God tier explanation. I truly can't put in words how easily and clearly you were able to explain a seemingly confusing question!

yash-seth
Автор

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!!

chaudharyalisha
Автор

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

junaidahmed
Автор

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

hilal
Автор

09:56 seriously i watched this many times to see your expression 😄

lofireverbz-wygo
Автор

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...

monstercoder
Автор

Understood! Super fantastic explanation as always, thank you so so much for your effort!!

cinime
Автор

Understood as always! The intuition/approach is just awesome🤩. Spellbound!

nagame
Автор

One of the best explanations for this problem on the internet!

ML-oknf
Автор

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

mehulthuletiya
Автор

mann unbelievable intuition and explanation!! loved it !!! understood completely <3

ishangujarathi
Автор

crazy concept striver ! I'm just loving your binary search playlist!!!

junaiid
Автор

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

kaushiksen
Автор

Understood bhaiya, thw way of teching is another level, I don't have words to express my feelings. Thanks a lot, bhaiya!!!

pratikkumarsingh
Автор

best possible understanding through the BS playlist!

mriit
Автор

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.

reyanshmishra
Автор

Best explanation so far in binary search

revanthkumar
Автор

Totally understood.your teaching is superb.thank you

k.satish