BS-5. Search Element in Rotated Sorted Array II

Problem Link: bit.ly/3MCdLTY
Notes/C++/Java/Python codes: takeuforward.o...
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/take...
0:00 Introduction of Course

[@takeUforward]

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

[@FactFactoryCentral]

In this code, isn't the worst case O(N). If all elements are same, and the element to be searched is not there in the array. Example: [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3], target: 4 Is O(N) the best that can be done if we have duplicate elements ?

[@sudhanshushekhar4222]

understood

[@venup2813]

Understood

[@abhisheksinghmehra9576]

Understood

[@365tage9]

Understood. You are a genius.

[@lshuarckyma]

TIP BY STRIVER AT THE END: if you get questions envolving duplicates then try to solve them as unique element based and modify the code where the condition fails , for ex here it breaks at identifying the sorting portion

[@SumitSingh-dc8pm]

You just are a legend. Hat's off to you man. Loved your content. You start from basics and made this concept a cakewalk. Huge Respect for you.

[@Mr.Manoj1]

Understood! You are a savior to people who struggle in DSA (im one of them) and I cant thank you enough.

[@hardikpatel352]

there are lots of paid courses are available and many are upcoming but none of them is such in-depth and free like striver's A to Z dsa , Thanks a lot raj sir 🙇🏿‍♂🙇🏿‍♂

[@LearnwithEase20]

Becoming your bigger fan day by day! Hats to your explanation

[@mehulthuletiya497]

Time-Stamps: 00:32 Problem Statement 00:50 Recap: Search Element in Rotated Sorted Array I 01:28 Why this problem different from previous 05:38 Explanation & Approach Start (Search Element in Rotated Sorted Array II) 10:09 Code 10:19 Complexity 11:41 Tip to solve problem

[@Anshydv3]

the best explaination , i have ever seen on binary Search , LOVE YOU BRO ❣

[@reshmah1497]

Really understood the concept. Thanks much for teaching very well.

[@depavathnareshnaik5584]

Thank you for the excellent instruction on BS. Your clear explanations and engaging teaching methods really helped me grasp the concepts thoroughly. I feel much more confident in my understanding now. I appreciate your dedication and support!

[@stith_pragya]

UNDERSTOOD.........Thank You So Much for this wonderful video.........🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻

[@ArdentMusicLover]

brilliantly explained, both part 1 and par 2. Thank you, Striver!

[@ManishKumar-kw7qe]

This question is really a good one.!!! if you are not able to solve,it 's fine because it's not a typical binary search

[@momentcoder]

Understood, solved the a2z sheet by 19%, thank you for the lovely content. 💌

[@HarshKumar-ip5nr]

Understood the intuition and approach. Thanks for the series.

[@venkatsaireddy1412]

You are always the best bro, Thank you for clear explanation.

[@cinime]

Understood! Wonderful explanation as always, thank you very very much for your continuous effort!!

[@anishaa3298]

the best explanation thus far

[@prthms_]

Understood.... Thank you so much for this wonderful Video❤❤

[@ravalik8611]

Heartful thanks to you bro......Your are doing a wonderful job by spreading the knowledge you have

[@darshilmodi6851]

I truly appreciate your detailed explanation! To contribute to the community's knowledge, I encountered a situation where the original logic using low++ and high-- to handle duplicates wouldn't work. Here's a specific test case that demonstrates the issue: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1]. Fortunately, a simple fix exists. Instead of decrementing both low and high, we can simply increment low like this: low++. This modification allows the code to function correctly.

[@srujangajjala2658]

ur modification isnt working for ur test case bro

[@srujangajjala2658]

there is some error in coding ninjas, i ran the same code in offline compiler with ur test case it returned true only, in coding ninjas its returning false

[@t3ch_r4id]

I have submitted the code in coding ninja successfully the problem is if you carefully observe the question it states that array will be right rotated not left rotated 💡

[@aishezsingh7004]

@@t3ch_r4id His Testcase is achivable by left rotating at 5th index

[@monishamadu]

It worked for me when I call the recursive method by just incrementing lower point, instead of continue.

[@VikashKumar-tg3ot]

Understood very well,Now i able to code my self before watching solution.Thanks striver bro.

[@rumiNITPatna]

thank you so much striver ! u made me love dsa.

[@prajaktamhetre3010]

best course and I just love ur videos

[@dayashankarlakhotia4943]

Most intuitive and well explained

[@vipinamar8323]

Awesome, your videos are a great resource. Thank you sir.

[@prathambhushan4859]

didn't studied anyhing since last week, but starting again and gonna complete this in this week

[@ErenYeager-dp4er]

Done on 11 Jan 2025 at 18:44 Place : Study Room 2, Hostel 5, IIT Bombay

[@photon7404]

what you ate before doing and which brand's pc . kidding. good job bro .

[@lakshmij6067]

Understood bro, Thank you so much...Learning so much from your videos

[@arunsagarsa3613]

this guy is a gem! Nothing more to say.

[@Sunil-ul1yg]

You are a legend bro!

[@KR_Technical-hj3bf]

i can say one thing about you that no one dislike you

[@infinitecodes]

Understood 😊

[@aakashsharma780]

Again Understood Striver bhaiya ❤🔥🔥 , doing revision for placements..!!

[@akbunofficial1281]

Better way to avoid the edge case of arr[mid]=arr[low]=arr[high] is to check the right sorted first , this will make the code more efficient

[@manusklm1161]

Really? Can you explain with an example?

[@djinnGamingLive]

I don't think that will work. Even if we check the right sorted list first we need to know about the order of the first, middle and last element before that so we can rule out the possibility of them being equal.

[@JK-de2gh]

hatsoff to u mann...put some python code als...becoz some beginners will learn it in python....

[@ramitroshan123]

Thank you! for such an amazing explanation :)

[@AtulKumar-c4x7l]

understood Thank u Striver for a wonderful explanation

[@per.seus._]

UNDERSTOOD❤

[@AppaniMadhavi]

The code for the rotated sorted array I is also worked for rotated sorted array II in coding ninjas, but coding ninjas didn't provided all edge test cases.

[@harshvardhansankpal716]

yup in leetcode, that edge case of 2 elements is covere [ 3, 1 ] here high crosses low

[@vijaynag7723]

understood , thank you Striver.

[@mohithadiyal6083]

THE best explanation

[@RIyaGupta-iz9iw]

Best videos ever sir .. Understood

[@brianjpeter9856]

Good Explanation Striver !

[@ayushirastogi9725]

understood love the course!!!

[@yashraj5898]

understood , Great Exp. buddy !

[@champbehal8111]

Thnku striver❤

[@paragroy5359]

Great Content. Keep on making such videos.

[@prasannamalatesha3887]

Great video, wonderful job explaining bro!!

[@kingbadshah452]

understood everything thanks striver!!!!

[@nice_random_guy5347]

understood! Thanks!

[@RaghavN-rd5zw]

Understood!!! Thanks striver!!!

[@Dipanshutripathi2407]

Understood every part of the video.

[@aakashsharma780]

Understood Striver bhaiya ❤🙌

[@amityadav-np1rk]

Great explanation!!

[@ashokbabug40]

Amazing video bro really appreciated

[@RaviKumar-sn6tu]

Understood sir ...

[@rahulpathak859]

Understood everything💯

[@YourCodeVerse]

Understood✅🔥🔥

[@adarshagarwal9508]

amazing waiting for the strings sums

[@shrirambalaji2915]

Understood and you are awesome brother...

[@samuelfrank1369]

Understood. Thanks a lot.

[@NazeerBashaShaik]

Understood, thank you.

[@manishchahar9110]

Amazing work bro, keep rocking

[@myproject6768]

Absolutely understand ❤

[@priyanshunautiyal1662]

Understood bhaiya ❤

[@mehrabhossain8225]

best explanation bro

[@JothiprakashThangaraj]

understood!!!! thanks a lot!

[@anshikajain7990]

Understood😊😊🎉

[@tanmaychaudhary2801]

Thank you so much bhaiya ❤😇🙏

[@ramujanak963]

yes its understood striver 💙

[@selene8721]

Thank you so much!

[@arjitgautam365]

well explained. Appreciated

[@nagavedareddy5891]

Thank u striver... ❤

[@mangeshgupta7095]

Big thanks ❤

[@Liftedmonk]

buddy is a god

[@utsavseth6573]

Great lecture .

[@harshalparanjiya5850]

let's go --> 13 january 🔥🔥

[@Ryugaz1]

understood, thanks

[@chirag71269]

Understood Striver ❤

[@infernogamer52]

Understood Bhaiya!

[@ESkp15]

Wow! Understood!

[@RamkumarB-k5r]

Understood anna...!

[@deeptidip9864]

Understood 💯

[@knox9450]

Understood❤

[@RAJSINGH-mr7hq]

Superb. Understood!!

[@humanity7880]

understood!

[@Alwayspowerstar143]

Understood Striver👌

[@bhavesh_baraiya21]

understood!🙂

[@motivatewithme123]

STRIVER BHAII 💌

[@CodeBoost8375]

Understood 😃

[@culeforever5408]

understood

[@amitjindar6706]

UNDERSTOOD

[@-ShangsitNath]

Worst case time complexity will become O(n) ?? Eg. if array = [3,3,3,3,3,3,3,3], target = 1 ??

[@kushwanthkapa2041]

Yup😊

[@manusklm1161]

Nope...it's n/2

[@EerieEntertainment-mc4ce]

@@manusklm1161 O(n/2) is also order of n

[@manusklm1161]

@@EerieEntertainment-mc4ce yeah I too know that we won't consider constants .but first we should able to find as precisely as possible, right and then you can do that stuff like neglecting constants etc.

[@abhinav_mittal]

we can just use regular binary array and return true; in place of return m; if(arr[m] == target) and in the ending we can return false; rather then return -1;

[@abhinav_mittal]

and i might add using sort(arr.begin(), arr.end()); function in the starting of the code

[@umangagarwal8726]

​@@abhinav_mittal why in this question we cant return index and just returning true false?

[@abhinav_mittal]

@@umangagarwal8726 because in question it says to return true if found and false if not found

[@umangagarwal8726]

@@abhinav_mittal yeah I know that but striver says in this question you cant return index using binary search that's why I am asking why this? As just remove true false and return mid or -1 it will give index

[@abhinav_mittal]

@@umangagarwal8726 yes but I think in the interview they can ask to solve using another method so that's why

[@Bug-g5b]

ty striver!

[@hallupandet228]

Understood💥

[@mohamedriffath5781]

Greatwork

[@abhay9994]

Thank you.

[@Karthik-ep6en]

understood 👍