Two Pointer Technique — ELI5

Imagine you have a row of numbered cards laid out in order from smallest to biggest. Someone asks: “Can you find two cards that add up to 15?”

The slow way: pick up the first card, then check every other card to see if they add to 15. Then pick up the second card and check every remaining card. And so on. With 100 cards, that is thousands of checks.

The clever way: put one finger on the first card (the smallest) and another finger on the last card (the biggest). Add them up.

• Too big? Move your right finger one card to the left (try a smaller number).
• Too small? Move your left finger one card to the right (try a bigger number).
• Just right? You found it!

This works because the cards are in order. If the sum is too big, the only way to make it smaller is to move away from the big end. If it is too small, move away from the small end. You never need to go back.

With 100 cards, this takes at most 100 checks instead of thousands. Two fingers, walking toward each other, and you are done.

The two pointer technique is exactly this: use two markers in your data that move based on a condition. They can start at opposite ends and move toward each other, or they can start at the same end and move at different speeds (like a slow walk and a fast run).

The fast-and-slow version is useful for different problems. Imagine walking and running on a circular track — the runner will eventually lap the walker. This is how computers detect loops in data.

One thing to remember: Two pointers let you avoid checking every pair by being smart about which direction to move, turning a slow exhaustive search into a fast, focused scan.