Arrays, Strings, and Pattern Techniques · Pattern Techniques

Two Pointers

Two-pointer methods use two moving indices to scan sorted arrays, strings, or windows without unnecessary nested loops.

Enroll Now Text Us Contact Code Scholars Full DSA Course

Student Focus

We teach students to state exactly why each pointer moves, which prevents guess-and-check coding.

Guided Lesson Notes

Understanding Two Pointers

Two Pointers focuses on contiguous sequences, index movement, and the state that can be reused while scanning. Two-pointer methods use two moving indices to scan sorted arrays, strings, or windows without unnecessary nested loops.

The mental model is this: picture the input as boxes with numbered positions; every algorithm decision should say which positions are being read, updated, skipped, or remembered. That picture matters because it tells the student what information is available immediately and what must be searched, stored, or recomputed.

The core invariant is that the variables beside the array must summarize exactly the part of the array that has already been processed. If a solution cannot state that rule, the code may still run on a sample input but fail on edge cases.

A strong implementation usually uses careful loops, boundary checks, and small helper variables for sums, counts, positions, or best answers. The goal is not just to memorize an API; the goal is to know why each operation is allowed and what it costs.

In competitive programming, Two Pointers tends to appear when the problem asks about a subarray, substring, range, pair, frequency, or a condition over consecutive values. Spotting that signal is often the difference between a nested-loop solution and an efficient one.

Visual Model

A small picture for Two Pointers

i=0

i=1

i=2

i=3

i=4

i=5

i=6

i=7

Array and string techniques usually become clear when each index has a job: scan, compare, count, enter a range, leave a range, or store a best answer.

Key Ideas

Left and right pointer movement
Sorted-data assumptions
Invariant-based reasoning

Practice Prompts

Solve pair-sum on a sorted list.
Remove duplicates from a sorted array in place.

Vocabulary

Terms students should be able to say clearly

Index

The numeric position used to access an item directly.

Window

A contiguous section of the array or string currently being considered.

Prefix

Information accumulated from the start of the sequence up to a position.

Boundary

The first or last valid position included in the current scan.

State

The running information kept while the loop moves.

Invariant

The rule that makes the running state trustworthy after each iteration.

Worked Example

Worked example: tracing Two Pointers

Use a tiny input and focus on left and right pointer movement. The goal is to see how the topic changes state before scaling it to a full problem.

1Write a small input where Two Pointers is clearly useful.
2Label the part of the input related to Left and right pointer movement.
3Perform one operation and explain which invariant is still true afterward.
4Run a second operation that touches an edge case, such as an empty side, duplicate value, boundary index, disconnected vertex, or tie.
5Finish by saying which operation dominates the runtime and why.

Complexity Check

Costs students should be able to explain

Operation	Typical Cost	Reason
Indexed access	O(1)	Direct index lookup is fast when the position is known.
Full scan	O(n)	Most search, count, and validation tasks inspect each item once.
Middle insert/delete	O(n)	Items often need to shift to keep order.

Common Mistakes

What to watch while practicing

Coding before drawing the structure or state changes.
Forgetting the invariant that makes the algorithm correct.
Testing only the sample input and skipping boundary cases.
Giving Big-O without explaining which operation dominates the work.

Interview-Style Coding Problem

Two Pointers interview problem: Container With Most Water

Interview medium

Problem

Given n vertical line heights, choose two lines that hold the largest possible water container.

Input

The first line contains n. The second line contains n integers representing heights.

Output

Print the maximum container area.

Sample Input

9
1 8 6 2 5 4 8 3 7

Sample Output

Why the sample works

The best pair is height 8 at index 1 and height 7 at index 8, giving width 7 and area 49.

Approach

1Start one pointer at each end.
2Compute the area from the shorter boundary.
3Move the pointer at the shorter boundary inward because the taller boundary cannot improve while width shrinks.
4Keep the best area seen.

O(n) time and O(1) extra space.

Java Solution

import java.util.*;

public class Main {
  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    int n = sc.nextInt();
    int[] h = new int[n];
    for (int i = 0; i < n; i++) h[i] = sc.nextInt();

    int left = 0;
    int right = n - 1;
    long best = 0;

    while (left < right) {
      long area = (long) Math.min(h[left], h[right]) * (right - left);
      best = Math.max(best, area);

      if (h[left] < h[right]) {
        left++;
      } else {
        right--;
      }
    }

    System.out.println(best);
  }
}

Python Solution

n = int(input())
h = list(map(int, input().split()))

left, right = 0, n - 1
best = 0

while left < right:
    best = max(best, min(h[left], h[right]) * (right - left))
    if h[left] < h[right]:
        left += 1
    else:
        right -= 1

print(best)

Practice Challenge

Make the idea your own

Create a two-minute explanation of Two Pointers: define it, trace one example, name one edge case, and give the runtime of the main operation.

Tutoring Connection

Turn the topic into usable problem-solving skill

Students can use this page before a lesson, after a difficult homework assignment, or while preparing for AP Computer Science A extensions, Advanced Topics in CS, USACO growth, or a college data structures course.

Schedule Free Consultation Text Us Open Online Compiler