Leetcode 162. Find Peak Element

Find any index of a "peak" (an element strictly greater than its neighbors, with array ends treated as -∞) in an integer array where adjacent values differ, requiring an O(log n) solution. The core challenge is to exploit the array's rising/falling pattern with binary-search-like reasoning to locate a local maximum without linear scanning.