LeetCode: 1095. Find in Mountain Array
Problem Statement
(This problem is an interactive problem*.)*
You may recall that an array arr is a mountain array if and only if:
arr.length >= 3
There exists some i with 0 < i < arr.length - 1 such that:
arr[0] < arr[1] < ... < arr[i - 1] < arr[...
j-dev.hashnode.dev2 min read