NeetCode #300LC-1095HardBinary SearchNC 250
← Back to All Problems#300 · #1095 · Find in Mountain Array(山脉数组中查找目标值)
📌 Problem Statement & Constraints
This is an interactive problem. A
MountainArray is strictly increasing then strictly decreasing. Given a target, return the minimum index where it appears, or -1. You may call get(k) at most 100 times, and length() once. Constraints: 3 <= length <= 10^4, 0 <= target <= 10^9.🔒
Sign In to Unlock Full Solutions for All 973 Problems
Sign in to access step-by-step logic, benchmark Python3 code, complexity breakdown, and offline export!