LeetCode 33. Search in Rotated Sorted Array

The Best Place To Learn Anything Coding Related - bit.ly/3MFZLIZ
Join my free exclusive community built to empower programmers! - www.skool.com/software-develo...
Preparing For Your Coding Interviews? Use These Resources
--------------------
(My Course) Data Structures & Algorithms for Coding Interviews - thedailybyte.dev/courses/nick
AlgoCademy - algocademy.com/?referral=nick...
Daily Coding Interview Questions - bit.ly/3xw1Sqz
10% Off Of The Best Web Hosting! - hostinger.com/nickwhite
Follow My Twitter - / nicholaswwhite
Follow My Instagram - / nickwwhite
Other Social Media
----------------------------------------------
Discord - / discord
Twitch - / nickwhitettv
TikTok - / nickwhitetiktok
LinkedIn - / nicholas-w-white
Show Support
------------------------------------------------------------------------------
Patreon - / nick_white
PayPal - paypal.me/nickwwhite?locale.x...
Become A Member - / @nickwhite
#coding #programming #softwareengineering

[@alexcuenca]

Guys don't freak out, questions like this you have to look up the solution, would someone be able to guess this approach without ever seen a problem similar to this one? Probably not, it doesn't mean you're not smart or that you suck at this. Most people saw the solution if the problem was somewhat hard at least.

[@piscopowerdarkside]

Oracle asked me this question in an interview and i failed badly lol. With this explanation i look back and can't believe how stupid i was..

[@Avagabond]

he is just not good at explaining... may be because he sneaked the answerss from somewhere.. over confidence is not good when you're teaching man

[@mrbeastfannatic]

Hey nick I keep trying to find your leetcode solutions on GITHUB but I don't really know where the are . Could you let me know which repo do they belong to ?

[@MichaelSalo]

How did you decide the first loop condition is (left < right), and the second loop condition is (left <= right) ?

[@azn0180]

You are such a legend at young age. Your explanation is much more clearer than leetcode. I hope to see your name on some big thing in the future.

[@100bands]

This condition "target >= nums[start]" is not needed since nums[start] is already the smallest value in your array

[@shaurya4242]

Lol got this in a CoderPad interview. Like bruh...how am I supposed to figure this out without looking it up?

[@rohanpandey3704]

How can we get the written code ?

[@amansayer4943]

this guy even make jokes he was like creating history 😂😂

[@soledapper]

Right on for explaining it, I knew I had to use the technique from LC 153, but I kept messing up on determining the search space before performing regular binary search.

[@benjamimo1]

Thanks bro, It became better to understand as you divided the problem in two parts.

[@bobmarley3342]

That was "freakin" amazing explanation...Thank you very much!

[@wheresthebeach0138]

You've got some of the best content out there bro; thank you for all the work you put into these!!

[@hacker-7214]

this question was so fucking hard almost made me quit coding.

[@codegranate7409]

Simple and clear explanation! Thank you!

[@Xyvier]

8:54

[@anamikakumari3777]

finding pivot technique .. awesome

[@HktDarren]

HI! Thanks for sharing your knowledge every time, it's really help me, can you also teach us how to look at the time complexity when we finished the program ?

[@michaelchan6144]

You are a legend! Never stop making vids!!