Problem Submissions Solution
Bitonic Point
Difficulty: Easy
Acceptance: %
Points: 20.00
Given an array of integers arr[] that first strictly increases and then potentially strictly decreases, find the bitonic point, which is the maximum element in the array. The bitonic point is the position where elements before it are strictly increasing, and elements after it are strictly decreasing.
Examples:
Expected Time Complexity: O(log n)
Expected Auxiliary Space: O(1)
Constraints:
- 3 <= arr.size() <= 10^5
- 1 <= arr[i] <= 10^6
Companies:
Amazon Microsoft Flipkart
Topics:
Searching Algorithm
