$ ./guess_the_language
Problem Solving — fill the blank
Problem Solving — fill the blank · medium · #76
Fill in the complexity.
# Two pointers on a sorted array find a pair in O(____)
Answer:
n
(also accepted: n)
Each pointer moves at most n steps in total.
Play Problem Solving ▸
◂ #75
all Problem Solving — fill the blank questions
#77 ▸