Search an element in a Sorted & Rotated Array | Binary Search, Part 3 | DSA-One Course #24

Hey guys, In this video we're going to solve an important problem on Binary search. It's called Search an element in a sorted and rotated array. This is a common question in many interviews. We'll learn how binary search can be modified to solve different kind of real-world problems
🥳 Join our Telegram Community:
Telegram channel: telegram.me/realanujbhaiya
Telegram group: telegram.me/dsa_one
🚀 Follow me on:
Instagram: / anuj.kumar.sharma
Linkedin: / sharma-kumar-anuj
Twitter: / realanujbhaiya
💸 Use coupon code ANUJBHAIYA on GeeksforGeeks to avail discounts on courses!
📚 Complete DSA Playlist: • DSA-One Course - The C...
Complete Android Development Playlist: • Android Development Tu...
Hashtags:
#anujbhaiya #dsaone
Ignore these tags:
search an element in a sorted and rotated array
binary search
search an element in sorted and rotated array
binary search in c
search an element in a nearly sorted array
search an element in a almost sorted array
search an element in a sorted and pivoted array
binary search program in c
binary search tree in data structure
search element in a circularly sorted array
search an element in matrix
single element in a sorted array
searching an element in array

[@subirkumar6786]

Consider this test case a[ ] = [ 3 , 1 ] and key =1 . The left part sorted condition must be if(a[low]

[@LokendraSingh-wk7ix]

for correct output condition will be : ar[low]

[@sangeethapinto]

I was stuck at this point. Thank you for pointing it out.

[@sristy9823]

What about the input [1,0,1,1,1] key= 0

[@LokendraSingh-wk7ix]

@@sangeethapinto welcome 🤗

[@LokendraSingh-wk7ix]

@@sristy9823 array not defined in ascending or descending order...so it will be assumed ascending order.

[@sristy9823]

@@LokendraSingh-wk7ix yes I think this code will work for this

[@varadsalgare7848]

I think I'll meet you in Amazon if i complete this course 📍❤️

[@amanrai8010]

I don't think so you can meet him now

[@saurabhsaxena1992]

I am going to amazon 😂🤣😹

[@YusufKhan-ol4cd]

👍

[@deepakmahapatra047]

Did u met him on Amazon? 😁

[@jayeshborse7901]

@@deepakmahapatra047 😂

[@Anonymous-coder31]

Amazing explanation of this question 🔥🔥

[@rupeshkarale3492]

I love your teaching technique thank you so much

[@akhilesh59]

Today only my friend was discussing about this question with me, and he explained me the approach, which I was not able to understand completely. And what a coincidence, you uploaded the same question video with an easy explanation! Thanks for the video.. Now I don't think that i will forget this question :)

[@hashmatmohammed5807]

how much did u complete java dsa

[@Pratik_yadaw]

where you work at bro?

[@coldfish6187]

nice, you have friends who discuss dsa with you

[@abdushaik7621]

superb bro ...plz do more and more on DSA asap ....white board keeps focus on the topic great

[@debdhritiroy6868]

yeah, was badly stuck with this one for quite a while

[@afsarali-hz5lt]

I am also

[@AshishKumar-pq6pr]

Bhaiya aafat lecture tha.....katai jahar parhate ho aap 😅😅

[@prabalbhadoria5398]

Man what a teacher 💪🏻

[@sagardas4218]

Thanks Anuj Bhaiya

[@ashvinimeshram5242]

Thanks ,really great explaination👍👍

[@JaiSagar7]

Awesome iterative sir 🔥🔥🔥🔥

[@pranaypanda5146]

Great explanation. The sorted part was the main trick why we can't create a discrete if-else checks to check all case. Thanks

[@kapilkumarsangwan7546]

thanks a lot bhaiya for such a great explanation and please upload the videos fastly

[@merajansari0773]

avi tak ka sabse easy solution for this question wow anuj bhaiya

[@pj2464]

this is the best explanation for this question with enough examples thank you bhaiya

[@user-tq2tf8ei5t]

Sir, awesome explanation

[@sawanpatel3491]

thanks bhaiyya. Great explanation

[@madhavdua8588]

great efforts bhaiya

[@AYUSHKUMAR-xj4wc]

Great Explanation!!!

[@OmRatnaparkhe]

Thank you bhaiya

[@Pr3kashSingh]

Thanks Sir ji.

[@CarelessMni]

thank you very much sir. Love from Bangladesh

[@beinghappy9223]

Thank u so much bhaiya 💝

[@siddhantyadav4531]

Good Job Sir 👍👍👍👍

[@abhishekverma7874]

Facing issue but clear by this video thanx

[@mohammedirfan5744]

anuj bhaiya is the best

[@chandnibhavsar437]

Probably the best thing i found on you tube today :) Great explanation... Gonna start seeing your content

[@agyaani8060]

Thaaanks a lot bhaiyaa❤

[@lokendrasingh9780]

thank you bhaiya for this amazing video

[@someshpundir788]

baut badiya

[@yogeshdeshpande9532]

Thanks bhaiya 🤩

[@prashantchakrawarti42]

thank you bhaiya 😊🙏

[@levi-lb6dp]

Kyaa baat hai 🔥🔥🔥

[@joydeepsarkar4774]

in the right part sorted in the if condition it will be key

[@ujjwalgorain7594]

Thanks

[@BECEG_Bodhit]

i watched 2 videos and finally i found solution

[@vishalsaxena2312]

In if condition, a[mid] should be checked as a[mid] >= a[low], else it will not pass few cases like in array arr a= [3,1] and target as 1. otherwise explanation was very clear and very helpful as well. Thanks

[@JustU-cc5td]

Thank you Anuj bhayi , let me explain I had started your java placement lecture on the "apni kaksha" channel 🙏 how can I explain within 3 days, I had completed till Loops I never thought you make that much easier concept of java, And I promise to you, I will complete a whole playlist, once again a big thank you, Your Subscribe Omkar.🙋‍♂️

[@hashmatmohammed5807]

how much did u complete ....?

[@siddhantyadav4531]

This is one of the best playlist on You tube tube for DS Algo

[@avinashdharme2234]

*Exactly, explanation bohot sahi tarike se bataya hai is playlist me* *Thoda slow rate of video, but explanation me koi compromise ni hai*

[@hashmatmohammed5807]

how much did u complete java dsa

[@aarindey]

if(a[low]

[@starkendeavours7072]

Kaunsa case miss ho jayega? Thik hi toh hain sab! Line 5 mein toh wo case already satissfy ho rha hain. Equals to wala, greater than and less than... All are okay.

[@aarindey]

array =[5,3] Search 3 me... default return hoga

[@lakhannagar91]

@@aarindey you are right dude.

[@YU-lz8hd]

@@AnujBhaiya It is wrong. In 2nd iteration low=0 and high=1 so it returns -1. if(a[low]

[@AnujBhaiya]

Correct!

[@santrawebtech35]

you are awesome i started learning from your channel i find your channel is like amazon pay new ad event i had it but i dont know it

[@codedByAyush]

Just WoW

[@RonitSagar]

Bhaiya aapne ek edge case choor diya hai jb array kaa size 2 ho [3,1] ,target =1; tb aapka code "IF " waale part me naa jaa k else waale me chara jayega ...or fir -1 return karega. so, if(a[low]

[@prakharsaxena9189]

bhaiya videos thode fast upload kro..please

[@aniket_devil]

Bhaiya ek fee structure pae bhi vedio bna do for Bca and Mca courses for different College's🙏

[@Abhishek-ql3qu]

Bhaiya second condition should be arr(low)

[@hetshah4890]

Bhaiya we are greatful for you..🙏 Thank you for this amazing series!!..👍

[@CodesBros]

Correct Solution in Py3

[@ashishjaswal1437]

Wow What a explanation of this question by a software engineer, that what's experience matters .Even Coding Ninjas and Geeks For Geeks failed to Explain this Problem.

[@monkeeys23]

I was hoping to see a video for non cs student to how to start and get into FAANG DO IT IF YOU CAN

[@chahakarora4203]

Bhaiya, please make a video on how to get PPO during internship

[@abirberacse9827]

Can we use modulus operator to modify the bs?

[@sakets.saurav]

Bhaiya.....c++ me dsa pdhna chaiye ya koi aur language me ??

[@anuragsingla4090]

bhaiya total kitne videos honge is course ke

[@mohdkaifkhan3302]

Please teach fast bhaiya DSA course

[@khudkikhoz]

Another great video ❣💞

[@princedubey597]

And you are very hardworking person

[@mohdkaifkhan3302]

Bhaiya aap kha chale jte h vedio post nhi karte h

[@dwivedi6037]

Thankyou bhiya ♥️♥️

[@ashishkumarshawhitchem2017]

int start=0; int end=nums.length-1; while(start=nums[start]){ if(target>=nums[start] && target

[@aalirazaniazi8314]

Anuj bhayya mere paas computer nahi he or me coddin sikhna chahta hun try krrha hun me mujhe ap raspberry pi 4 ke bare me batai kya vo kaam karega mujhe lena chahiye ya nhi

[@comedyhub26]

Bro iss playlist ko continue krdo..... Imp questions 😀

[@aehsasmathur5950]

what if the pivot point is before the mid-term?

[@pratiksonawane9944]

There is one small mistake just replace left part side if condition a[low]

[@prajjawalkumarpatel9360]

definitely otherwise we loose some case like [1] or [3,1] where we find 1;

[@himanshughodmare2922]

Always helpful ❤️🔥

[@elucidate2348]

vaiya we need full web development course , please vaiya

[@shuaibansari5526]

What is time complexity for this algorithm?

[@AbhishekA-81]

Solved the same question yesterday 😂😂 Thanks btw it will clear concepts.

[@abhishekdubey9920]

Far better then glamorous sharadha

[@chandankeshari6600]

bhaiya please isme jab duplicates honge toh wo wala case per video bna dijiye

[@piyushgogoriya5673]

@anuj bhaiya JAVA +DS +ALGO walli playlist ko complete kero na ...

[@AbhishekAnand92]

Great explanation sir....however it's not working for array: [3,1], need to add more boundary condition for low/high

[@subirkumar6786]

just replace left part side if condition a[low]

[@nikhilsood6126]

Bhaiya Ds is must... But what about dbms and operating system?

[@aryanverma6921]

Ise toh kar le pehle

[@ShivaniSharma-jm1is]

this code is not working for some test case, for example, arr =[3,1] and is key is 1 , for left part sorted condition must be if(a[low]

[@merajansari0773]

bhaiya advance dsa v kuch soachye

[@Mike-lf9zj]

Great stuff!! I think while checking if the left side is sorted, instead of a[low] < a[mid], we need to check a[low]

[@AnshTyagi_1]

failed testcase of leetcode right??

[@subirkumar6786]

just replace left part side if condition a[low]

[@lakshyasinghchouhan2850]

it will not work for input = [3,1] target=1

[@vikashkumar-rr6hb]

thnks bhaiya

[@amanmiglani6043]

if we get an array something like this: 50,60,90,10,20,30,40 here mid ele: is 10 and now both side are sorted then can you please explain me in this how to move forward #newbie just got a doubt so asked in the comment @anuj

[@harikiran2381]

if (a[low]

[@rishavkumar1839]

I am getting an error when the array size is 2 and the last element is 1 For eg : array = [3,1] And if searching for key=1. am getting an error. Can someone please fix

[@subirkumar6786]

just replace left part side if condition a[low]

[@tech_wizard9315]

Please add questions list for each video of dsa series which would be enough for practice for tech giants

[@Pratik_yadaw]

which company you are in rn?

[@vaibhavsharma6413]

not running on this test case [3,1] target=1

[@HimanshuSharma-cm8hi]

What will be time complexity logn or something different?

[@adammechaeil9339]

log(n)

[@CodesBros]

class Solution: def search(self, nums: List[int], target: int) -> int: l = 0 r = len(nums)-1 while(l

[@yashgupta-fk3zc]

bhaiya luv u💜❤️

[@ridersniper4964]

in urdu (thank you == jazakallah khair){ cout

[@crazgys3609]

Thanks bhai jee! Ek python ke upar detailed tutorial for begineers banao na plzz! jaise apne java ka banaya tha 1-2 ghante ka.plzz bhaiya.reply karna plzz.

[@freecontent2438]

Lal phool neela phool Anuj bhaiya buti-phool

[@eshanchourasia287]

Bhaiya if suppose the given array is 3 4 1 5 6 7 8 then when mid element will be 5 and if I compare for whether the left side is sort ,it will give postive result but if we see the array it's not sorted as it's 3 4 1 5? so here I m getting confused as how are we getting sure that left will be sorted if the condition that you showed is correct,pls do reply Bhaiya.

[@rashidttahasildar5439]

Bro if u see carefully there is " and " condition present so if both the cases are true only then u can say left part is sorted and by the way u need to have a key also to compare and say that left part is sorted

[@anujkumarsharma1013]

Your input is invalid. The given array should be sorted and then maybe rotated. Your input array doesn't satisfy the criteria.

[@jahanviraycha7859]

code is not working for [15,17,1,5,7,9,11] because it should be a[low]

[@ayoushpaul8156]

if i m interested in tech fields like software development, AI, ML. Is it necessary for me to study Digital logic and computer design, computer architecture and organization, operating system in BTech. i really feel bore of these subjects. Plzzz help 🙏🙏

[@0070vishal]

If you want a good job learn DS and algo else you can learn AI and ML and work for small companies or either can be a PhD researcher

[@vijayeeratna]

it is failing in one test case [3,1] key = 1 low =0 high=1 mid =0 low = 0 high = -1 result -1

[@thapliyalsahab34]

when trees and graphs will come???????????????????????????

[@muskanmaheshwari9412]

this code got a bit stuck for the case of [3,1] hence need to change a bit in, if case make it a[low]

[@kasammomin9379]

thanks

[@InterceptOriginal]

Can anyone run the program with [3,1] and key=1 input?

[@aryanaswal2]

class Solution { public int search(int[] nums, int target) { int index = -1; for(int i=0;i< nums.length;i++){ if(nums[i] == target){ index = i; break; } } return index; } }

[@ritvik2634]

if(a[low]

[@pulkitchausali1354]

yes it should be if(a[low]

[@hashmatmohammed5807]

@@pulkitchausali1354 thanks dude.....i was struck

[@sanchityadav6753]

@@hashmatmohammed5807 or just simply write the condition if(nums[mid]>nums[end])

[@jimcheriyan1801]

Thanks bro I was stuck figuring out this