Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
- 132 Pattern
Coding · Array · Binary Search · Monotonic Stack
- Beautiful Towers II
Coding · Array · Monotonic Stack · Stack
- Buildings With an Ocean View
Coding · Array · Monotonic Stack · Stack
- Daily Temperatures
Coding · Array · Monotonic Stack · Stack
Sources · 2 references
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1966. Binary Searchable Numbers in an Unsorted Array
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source
LeetCode company tags · 1 record
Uber
Binary Searchable Numbers in an Unsorted Array
Reported date not specified · Source window: 6mo
Source snapshot: Oct 20, 2026
Source frequency score: 57.2. This is not an interview probability.
View source