You are coding as a Guest. Sign in with your RoleNest account to permanently track your streak, earn XP, and climb the Campus Leaderboard!
Sign In with RoleNestProblem Set
🔥Binary Search: O(log n) Halving EngineEasy
DAILY PROBLEM OF THE DAY+50 XP • Daily Streak
Solve today's challenge or tackle one of the 3 Super Hard challenges for +150 XP.
EasyBinary Search•Acceptance: 57.8%
Binary Search: O(log n) Halving Engine
Targeted in FAANG & Tech OA:MicrosoftGoogleAmazonUber
Real-World Engineering Context
Foundational primitive behind B-Trees, database indexing in Postgres/MySQL, and Git Bisect bug isolation.
Given an array of integers `nums` which is sorted in ascending order, and an integer `target`, write a function to search `target` in `nums`. If `target` exists, then return its index. Otherwise, return `-1`.
You must write an algorithm with `O(log n)` runtime complexity.
Sample Test Cases
Input: [[-1,0,3,5,9,12],9]
Expected: 4
Input: [[-1,0,3,5,9,12],2]
Expected: -1
Input: [[5],5]
Expected: 0
Constraints
- 1 <= nums.length <= 10^4
- -10^4 < nums[i], target < 10^4
- All the integers in nums are unique.
- nums is sorted in ascending order.
Recruiter Fast-Track ReferralVerified Candidate
Direct pipeline to Google, Amazon, Microsoft, Swiggy, & Uber recruiters
Top DevScore profiles bypass resume screening filters. Every verified problem solve writes authentic proof-of-work to your profile and dispatches you directly into employer inboxes on RoleNest.
Explore 5,000+ Direct ATS Openings on RoleNest ↗✓ Direct Referral Active
Language:
Ready to test. Click Run Code or Submit Solution to run test cases in isolated browser sandbox.