All challenges
Algorithm challenge · DSA
Binary Search
Difficulty
easy
Time
~20m
Format
Single
Grading
Auto-graded
#dsa#python#javascript#typescript#go#java#cpp#rust
Mission file // read carefullyeasy
Given a sorted ascending array nums of distinct integers and a target, return its index, or -1 if not present.
Build with
search(nums: int[], target: int) → intPythonJavaScriptTypeScriptGoJavaC++Rust
4 tests · 1 hidden
Auto-graded on submit
Start challenge
Sign in to save your progress.