Loading
Jump to a section
Find a pair summing to a target in a sorted array. Each comparison eliminates one endpoint permanently, which is why a single pass suffices.
Use ← → to step, Space to play or pause, and the Input button to run it on your own data.
Write Pointer
O(n) time
Sliding Window
Binary Search
O(log n) time
Linked List Reversal
Breadth First Search
O(V + E) time
Depth First Search