Leetcode 1966. Binary Searchable Numbers in an Unsorted Array

Given an unsorted array, count the elements that are "binary searchable" — values that would be found by standard binary search without sorting, meaning every element to their left is smaller and every element to their right is larger. The core challenge is detecting those positions efficiently using prefix maxima and suffix minima scans.