Find Minimum in Rotated Sorted Array| Leetcode 153 | Live coding session 🔥🔥🔥

Here is the solution to "Find Minimum in Rotated Sorted Array" leetcode question. Hope you have a great time going through it.

1) 0:00 Explaining the problem out loud
2) 1:10 Algorithm walkthrough
3) 4:30 Solution approach
4) 7:00 Coding

For discussion/feedback

PS : Please increase the speed to 1.25X

[zhuochen]

I really appreciate your work! I just cannot understand others' explanation but yours!!! Please keep uploading great work!

[sreejith]

Finally for the first time i completed all the daily challenges
really helpful videos.

[sreejith]

If sorted given mostly likely binary searching

[Coolharshit]

I was doing high = mid - 1 in my own solution and although it got accepted by adding some more if conditions but it got messy and I was diverted from understanding it. But your solution is so much simpler. Awesome video again <3.

[farzadmf]

Great explanation and I like the fact that this solution covers the edge cases (non-rotated array etc.) by default 👍

I just have one question: how do we know that we need to consider the `[mid...high]` section of the array to decide where to go?

Can a similar check be done on `[low...mid]` to tell us where to go next?

[koulicksadhu]

We can also write num[high] > nums[mid] right in line 7, since all values are unique?

[tejasnakhate]

Why are we always updating high to mid but low to mid+1. Why cant we update high also to mid-1 ?