Back to course home
0% completed
Vote For New Content
Problem Challenge 1: Search Bitonic Array (medium)
Problem Statement
Given a Bitonic array, find if a given ‘key’ is present in it. An array is considered bitonic if it is first monotonically increasing and then monotonically decreasing.
In other words, a bitonic array starts with a sequence of increasing elements, reaches a peak element, and then follows with a sequence of decreasing elements. The peak element is the maximum value in the array.
Write a function to return the index of the ‘key’. If the 'key' appears more than once, return the smaller index. If the ‘key’ is not present, return -1.
Example 1:
.....
.....
.....
Like the course? Get enrolled and start learning!
On this page