Status: IN
`is_majority_element` uses exactly one `bisect_left` call to achieve O(log n) majority checking — it avoids a second binary search by checking `nums[first + n//2] == target` directly.
Source: entries/2026/06/06/check-if-a-number-is-majority-element-in-a-sorted-array-solution.md