Find Minimum in Rotated Sorted Array II | Leetcode 154 | Live coding session 🔥🔥| Binary search Algo

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

1) 0:00 Explaining the problem out loud
2) 1:10 Algorithm walkthrough using Priority Queue
3) 6:10 Algorithm walkthrough using Bucket Algorithm
4) 8:00 Coding

For discussion/feedback

PS : Please increase the speed to 1.25X

[varunpalsingh]

Today I tried it many times but it failed everytime on ( nums [mid] == startEle && nums[mid] == endEle), now I got it thanks sir

[priyadarshanr]

in the second example, instead of decrementing the high pointer by one, can we alter the code and increment the low pointer by 1