Chapter 01 - Topic 1.3

Two Pointer Technique

Q: When should I use two pointers?

Use it when two indices can move based on a condition and help avoid nested loops, especially in sorted arrays and string range problems.

Q: Does two pointers always need a sorted array?

No, but sorted arrays are the most common and easiest place to apply opposite-end pointers correctly.

Two pointers use two indices instead of nested loops. The pointers move according to a rule, so both together solve the problem in one pass or close to one pass.

two pointer techniquetwo sum sorted arrayfast slow pointer tutorialtwo pointers interview questionsopposite ends technique

Definition

The two pointer technique uses two moving indices or references to solve a problem more efficiently than checking every pair or position independently.

Core Idea

Opposite-end pointers work best on sorted arrays, palindromes, and range-based comparisons.

Fast and slow pointers work when one pointer scans ahead and the other tracks a smaller valid region or write position.

The power comes from eliminating repeated work that a brute-force solution would do again and again.

Detailed Explanation

Two pointers are really about using structure in the problem. If the array is sorted, moving one pointer changes the value in a predictable direction. That predictability is what lets you avoid checking every pair.

The opposite-end pattern is excellent for pair sum, palindrome, and container-style problems. The same-direction pattern is excellent for compaction, duplicate removal, and fast-slow movement.

Once you start recognizing when both pointers can move without backtracking, many O(n²) brute-force ideas collapse into O(n) or O(n log n) solutions.

Two Sum on a sorted array

JavaScript

function twoSum(arr, target) {
  let left = 0;
  let right = arr.length - 1;

  while (left < right) {
    const sum = arr[left] + arr[right];

    if (sum === target) return [left, right];
    if (sum < target) left++;
    else right--;
  }

  return [];
}

console.log(twoSum([1, 3, 4, 5, 7, 9, 11], 9));

Explanation

left starts at the smallest number and right starts at the largest. If the sum is too small, left moves right to increase it. If the sum is too large, right moves left to decrease it. Because the array is sorted, each move is logically safe.

Output

[2, 3]

Real-life Example

If a finance app needs two sorted expense values whose total matches a target reimbursement amount, two pointers find the pair without checking every combination.

When To Use It

Use opposite-end pointers for sorted arrays and palindrome-style comparisons.
Use fast-slow pointers when one pointer explores and the other maintains a meaningful position.
Use it when the problem asks for pairs, ranges, or compressed in-place updates.

Common Mistakes

Applying opposite-end pointers on unsorted data without sorting or justification.
Moving the wrong pointer after comparing values.
Forgetting that some pointer patterns depend on strict loop conditions like left < right.

Key Takeaways

Use two pointers when the problem naturally involves a pair, a range, or a relative movement rule.
Sorted input often makes opposite-end pointers especially powerful.
Fast-slow patterns also appear in linked lists, duplicate removal, and cycle detection.

Practice Ideas

Solve two sum on a sorted array.
Remove duplicates from a sorted array in-place.
Check whether a cleaned string is a palindrome.

Frequently Asked Questions

When should I use two pointers?

Use it when two indices can move based on a condition and help avoid nested loops, especially in sorted arrays and string range problems.

Does two pointers always need a sorted array?

No, but sorted arrays are the most common and easiest place to apply opposite-end pointers correctly.

Two Pointer Technique

Definition

Core Idea

Detailed Explanation

Two Sum on a sorted array

When To Use It

Common Mistakes

Key Takeaways

Practice Ideas

Frequently Asked Questions

When should I use two pointers?

Does two pointers always need a sorted array?

More DSA Topic Pages

Two Pointer Technique

Definition

Core Idea

Detailed Explanation

Two Sum on a sorted array

When To Use It

Common Mistakes

Key Takeaways

Practice Ideas

Frequently Asked Questions

When should I use two pointers?

Does two pointers always need a sorted array?

More DSA Topic Pages