Given a bitonic array of integers (an array that first strictly increases and then strictly decreases), find the index of a given target element k. If the element is not present, return -1.
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.