Why Two Pointer Technique Beats Brute Force in DSA C - Why This Pattern

Mental Model

Two pointers move through the data to find answers faster by avoiding repeated work. Instead of checking every pair, they smartly skip unnecessary checks.

Analogy: Imagine two friends walking from opposite ends of a hallway looking for matching shoes. Instead of one friend checking every shoe alone, both walk towards each other, quickly finding pairs without going back and forth.

Array: [1] -> [2] -> [3] -> [4] -> [5] -> null
Pointers: ↑left                 ↑right

Dry Run Walkthrough

Input: array: [1, 2, 3, 4, 5], find two numbers that sum to 6

Goal: Find two numbers in the array that add up to 6 using two pointers and compare with brute force

Step 1: Set left pointer at index 0 (value 1), right pointer at index 4 (value 5)

1[left] -> 2 -> 3 -> 4 -> 5[right] -> null

Why: Start checking pairs from both ends to cover all possibilities efficiently

Step 2: Sum values at left and right: 1 + 5 = 6, found target sum

1[left] -> 2 -> 3 -> 4 -> 5[right] -> null

Why: Sum matches target, so we can stop early without checking all pairs

Step 3: Brute force would check pairs: (1,2), (1,3), (1,4), (1,5), (2,3), (2,4), (2,5), (3,4), (3,5), (4,5)

All pairs checked one by one, many repeated checks

Why: Brute force wastes time checking all pairs even after finding the answer

Result:

1[left] -> 2 -> 3 -> 4 -> 5[right] -> null
Answer: Pair found (1, 5)

Annotated Code

DSA C

#include <stdio.h>
#include <stdbool.h>

// Function to find if two numbers sum to target using two pointers
bool two_pointer_sum(int arr[], int size, int target, int *num1, int *num2) {
    int left = 0;
    int right = size - 1;
    while (left < right) {
        int sum = arr[left] + arr[right];
        if (sum == target) {
            *num1 = arr[left];
            *num2 = arr[right];
            return true;
        } else if (sum < target) {
            left++; // move left pointer right to increase sum
        } else {
            right--; // move right pointer left to decrease sum
        }
    }
    return false;
}

// Brute force approach to find two numbers that sum to target
bool brute_force_sum(int arr[], int size, int target, int *num1, int *num2) {
    for (int i = 0; i < size - 1; i++) {
        for (int j = i + 1; j < size; j++) {
            if (arr[i] + arr[j] == target) {
                *num1 = arr[i];
                *num2 = arr[j];
                return true;
            }
        }
    }
    return false;
}

int main() {
    int arr[] = {1, 2, 3, 4, 5};
    int size = sizeof(arr) / sizeof(arr[0]);
    int target = 6;
    int a, b;

    if (two_pointer_sum(arr, size, target, &a, &b)) {
        printf("Two Pointer: Pair found (%d, %d)\n", a, b);
    } else {
        printf("Two Pointer: No pair found\n");
    }

    if (brute_force_sum(arr, size, target, &a, &b)) {
        printf("Brute Force: Pair found (%d, %d)\n", a, b);
    } else {
        printf("Brute Force: No pair found\n");
    }

    return 0;
}

while (left < right) {

loop until pointers meet to check pairs

int sum = arr[left] + arr[right];

calculate sum of values at pointers

if (sum == target) {

check if sum matches target

left++; // move left pointer right to increase sum

increase sum by moving left pointer right when sum too small

right--; // move right pointer left to decrease sum

decrease sum by moving right pointer left when sum too large

for (int i = 0; i < size - 1; i++) {

outer loop for brute force checking all pairs

for (int j = i + 1; j < size; j++) {

inner loop for brute force checking all pairs

if (arr[i] + arr[j] == target) {

check if current pair sums to target

Output

Two Pointer: Pair found (1, 5)

Brute Force: Pair found (1, 5)

Complexity Analysis

Time: O(n) because two pointers move inward once each, checking pairs efficiently

Space: O(1) because only a few variables are used regardless of input size

vs Alternative: Brute force is O(n^2) because it checks every pair, which is slower for large arrays

Edge Cases

empty array

function returns false immediately, no pairs found

DSA C

while (left < right) {

array with one element

function returns false, no pairs possible

DSA C

while (left < right) {

no pair sums to target

function returns false after checking all pairs

DSA C

return false;

When to Use This Pattern

When you see a sorted array and need to find pairs with a condition, use two pointers to scan from both ends for a fast solution.

Common Mistakes

Mistake: Not moving pointers correctly when sum is less or greater than target
Fix: Move left pointer right when sum is less than target, move right pointer left when sum is greater

Mistake: Using two pointers on unsorted array without sorting first
Fix: Ensure array is sorted before applying two pointer technique

Summary

Finds pairs in sorted data efficiently by moving two pointers inward.

Use when searching pairs with conditions in sorted arrays to avoid checking all pairs.

Two pointers skip unnecessary checks by adjusting based on sum compared to target.

Practice

1. Why does the two pointer technique often perform better than brute force in problems involving arrays or strings?

easy

A. Because it uses extra memory to store intermediate results.

B. Because it uses recursion to explore all possibilities.

C. Because it sorts the array first to make searching faster.

D. Because it reduces the number of nested loops by using two indices moving towards each other or in one direction.

Solution

1. Step 1: Understand brute force approach

   Brute force often uses nested loops to check all pairs or combinations, leading to higher time complexity.

2. Step 2: Analyze two pointer technique advantage

   Two pointers use two indices that move intelligently, avoiding unnecessary checks and reducing complexity.

3. Final Answer:

   Because it reduces the number of nested loops by using two indices moving towards each other or in one direction. -> Option D

4. Quick Check:

   Two pointers reduce nested loops = A [OK]

Hint: Two pointers move smartly to avoid nested loops [OK]

Common Mistakes:

• Thinking two pointers always require sorting
• Confusing two pointers with recursion
• Assuming extra memory is always used

2. Which of the following is the correct syntax to initialize two pointers `left` and `right` for an array `arr` of size `n` in C?

easy

A. int left = 1, right = n;

B. int left = n, right = 0;

C. int left = 0, right = n - 1;

D. int left = n - 1, right = 0;

Solution

1. Step 1: Identify valid pointer initialization

   For two pointers at array ends, left starts at 0 and right at n-1 (last index).

2. Step 2: Check each option

   int left = 0, right = n - 1; correctly sets left=0 and right=n-1. Others have invalid indices out of range.

3. Final Answer:

   int left = 0, right = n - 1; -> Option C

4. Quick Check:

   Array indices start at 0, last index is n-1 = B [OK]

Hint: Start left at 0 and right at n-1 for array ends [OK]

Common Mistakes:

• Starting indices at 1 instead of 0
• Setting right pointer beyond array size
• Swapping left and right initialization

3. What is the output of the following C code snippet using two pointers to find if a sorted array contains two numbers that sum to 9?

int arr[] = {1, 2, 4, 4, 5, 6};
int left = 0, right = 5;
int found = 0;
while (left < right) {
    int sum = arr[left] + arr[right];
    if (sum == 9) {
        found = 1;
        break;
    } else if (sum < 9) {
        left++;
    } else {
        right--;
    }
}
printf("%d\n", found);

medium

A. 1

B. 0

C. 6

D. Compilation error

Solution

1. Step 1: Trace the two pointer movement

   Start left=0 (1), right=5 (6), sum=7 < 9, move left to 1 (2). Then sum=2+6=8 < 9, left=2 (4). Sum=4+6=10 > 9, right=4 (5). Sum=4+5=9 found!

2. Step 2: Confirm found flag and output

   Since sum==9 found, found=1 and loop breaks. printf prints 1.

3. Final Answer:

   1 -> Option A

4. Quick Check:

   Two pointers find sum 9 = 1 [OK]

Hint: Move pointers based on sum compared to target [OK]

Common Mistakes:

• Not updating pointers correctly
• Confusing sum comparison logic
• Assuming array is unsorted

4. The following code attempts to find if any two numbers in a sorted array sum to 10 using two pointers. What is the bug?

int arr[] = {1, 3, 5, 7, 9};
int left = 0, right = 4;
int found = 0;
while (left <= right) {
    int sum = arr[left] + arr[right];
    if (sum == 10) {
        found = 1;
        break;
    } else if (sum < 10) {
        left++;
    } else {
        right--;
    }
}
printf("%d\n", found);

medium

A. The loop condition should be left < right, not left <= right.

B. The sum comparison should be with 9, not 10.

C. The pointers should start at left=1 and right=3.

D. The array must be unsorted for two pointer to work.

Solution

1. Step 1: Analyze loop condition

   Using left <= right allows pointers to be equal, causing sum of same element twice, which is invalid for two distinct elements.

2. Step 2: Correct loop condition

   Changing to left < right ensures pointers do not cross or point to same element, avoiding incorrect sums.

3. Final Answer:

   The loop condition should be left < right, not left <= right. -> Option A

4. Quick Check:

   Loop must stop before pointers meet = C [OK]

Hint: Use left < right to avoid using same element twice [OK]

Common Mistakes:

• Allowing pointers to be equal in loop
• Changing target sum incorrectly
• Starting pointers inside array instead of ends

5. Given a sorted array of integers, how can the two pointer technique be adapted to find all unique pairs that sum to a target value without duplicates? Choose the best approach.

hard

A. Use a hash map to store counts and ignore two pointer technique.

B. Use two pointers and skip duplicate values by moving pointers past equal elements after finding a pair.

C. Sort the array again after each pair is found to remove duplicates.

D. Use nested loops to check all pairs and store pairs in a set to avoid duplicates.

Solution

1. Step 1: Understand duplicate pairs problem

   When array has repeated elements, two pointer may find same pair multiple times.

2. Step 2: Skip duplicates after finding a pair

   After finding a pair, move left pointer forward while next element equals current, and similarly move right pointer backward while next equals current, to avoid duplicates.

3. Final Answer:

   Use two pointers and skip duplicate values by moving pointers past equal elements after finding a pair. -> Option B

4. Quick Check:

   Skip duplicates by advancing pointers after pair found = D [OK]

Hint: Skip duplicates by moving pointers past equal elements [OK]

Common Mistakes:

• Re-sorting array repeatedly
• Using nested loops instead of two pointers
• Ignoring duplicates causing repeated pairs