LeetCode Solution: 162. Find Peak Element

Unlocking the Peak: A Binary Search Adventure (LeetCode 162) Hey fellow coders! 👋 Vansh2710 here, ready to dive into another exciting LeetCode challenge. Today, we're tackling Problem 162: Find Peak Element . Don't let the "medium" tag intimidate you; with the right approach, this problem is a fantastic introduction to the power of binary search beyond just sorted arrays. Plus, it has a cool O(log n) time complexity requirement that makes us think smart! ⛰️ What's a Peak Element Anyway? Imagine you're walking across a mountain range represented by an array of numbers. A "peak element" is simply a point higher than both its immediate neighbors. More formally: Given a 0-indexed integer array nums , we need to find an index i such that nums[i] is strictly greater than nums[i-1] AND nums[i] is strictly greater than nums[i+1] . The Super Important Twist: The problem tells us to imagine that nums[-1] = nums[n] = -∞ . This is crucial! It means elements at the very ends of the array are always