practice mode on phones
tap the code to type with your on-screen keyboard. phone runs are practice only — they aren't scored or added to the leaderboard.
int search(const std::vector<int>& nums, int target) {
C++ · leetcode · type the snippet below to practice
def fib(n):
a, b = 0, 1
for _ in range(n):
a, b = b, a + b
return a
about this snippet
This is the binarysearch snippet in C++ — a classic LeetCode interview problem. Type it through to build the muscle memory you need to write it under interview pressure. DeveloperType scores you on net WPM and accuracy and only counts runs above 95% accuracy on the leaderboard, so practice rewards precision, not speed alone.
view source (13 lines)
#include <vector>
int search(const std::vector<int>& nums, int target) {
int lo = 0, hi = (int)nums.size() - 1;
while (lo <= hi) {
int mid = lo + (hi - lo) / 2;
if (nums[mid] == target) return mid;
if (nums[mid] < target) lo = mid + 1;
else hi = mid - 1;
}
return -1;
}
more C++ snippets:
browse all C++ snippets →