Leetcode 153 Explained 🔥 | Binary Search in Rotated Array | DSA Challenge Day 7

🚀 Day 7 of 15 Days DSA Challenge with Harshita Ma'am 🚀

Today’s challenge was “Find Minimum in Rotated Sorted Array” – a problem that beautifully blends binary search with array manipulation. 🔍

Imagine a sorted array that’s been rotated some number of times. The task is to find the minimum element in O(log n) time, which rules out linear scans. This is where binary search comes to the rescue!

🔑 Key Concepts I Learned:

Understanding how the rotation affects the sorted order

Using binary search not to find a value, but a property (the point of rotation)

Carefully handling edge cases where the array is already sorted or minimally rotated

✨ Approach Summary:

Use binary search to compare the middle element with the rightmost element.

If the middle element is greater than the rightmost, the minimum lies in the right half.

Otherwise, it lies in the left half (including the mid).

Loop until the pointers converge.

This problem was a great exercise in mastering binary search beyond its typical use case. Feeling more confident with rotated arrays now! 💡

On to Day 8! 💪

#Day7 #15DaysChallenge #DSA #BinarySearch #RotatedArray #Leetcode153 #HarshitaVerma #CodingJourney #100DaysOfCode #CPP #TechLearning