mobile typing isn't scored — practice only
func search(nums []int, target int) int {
Go · 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 Go — 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 (16 lines)
func search(nums []int, target int) int {
lo, hi := 0, len(nums)-1
for lo <= hi {
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 Go snippets:
browse all Go snippets →