All challenges
Algorithm challenge · DSA
Binary Search
Difficulty
easy
Time
~15m
Format
Single
Grading
Auto-graded
#python#javascript#typescript#go#java#cpp#rust#dsa#binary-search#arrays
Mission file // read carefullyeasy
Given a sorted integer array nums and a target, return the index of target in nums, or -1 if it is not present.
nums = [-1,0,3,5,9,12], target = 9 => 4
Build with
search(nums: int[], target: int) → intPythonJavaScriptTypeScriptGoJavaC++Rust
2 tests
Auto-graded on submit
Start challenge
Sign in to save your progress.