Intermediate
Data Structures & Algorithms
Q58 / 100
What is the two-pointer technique?
Correct! Well done.
Incorrect.
The correct answer is B) Using two indices that move toward each other or together to solve array problems in O(n)
B
Correct Answer
Using two indices that move toward each other or together to solve array problems in O(n)
Explanation
Two pointers (left/right or slow/fast) solve problems like pair sum, removing duplicates, and finding the longest window in O(n) instead of O(n²) brute force.
Progress
58/100