Given an array, which may look like inf { 3, 3, 3, 4, 6, 1, 0, -1, 10, 1, 12 } inf
Can you find a number which is smaller than its 2 neighbors?
In the example, there are two valid numbers, 1 from the subarray{ 0, -1, 10 } and 1 from {10, 1, 12}. return index so that we know which number you find since there may be duplicate numbers.
doesn’t need to find all the results. finding one from this array is good enough
it is possible that there is no valid result from the given array