Available question text
Given a bitonic array (an array that first increases then decreases), implement an efficient algorithm to search for a target element. Handle variations such as finding the peak element, searching in the ascending or descending portions, or searching with duplicates.
Related questions
Continue with questions that share topics or the same question type.
- Convert Sorted Array to Binary Search Tree
Coding
- Phone Screen: Two classic leetcode problems in the Top 30 list. One tests binary search in a sorted array, another one tests graph search using Breath First Search or Depth First Search algorithm
Coding
- Search in a Sorted Array of Unknown Size
Coding
- Search in Rotated Sorted Array
Coding · Array · Binary Search
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
Bloomberg
Search in Bitonic Array
Reported Sep 30, 2026 · 2 source reports
SENIOR
Source snapshot: Nov 12, 2026
View source