Why Two Pointer Technique Beats Brute Force in DSA C - Why It Works

Concept Flow - Why Two Pointer Technique Beats Brute Force

Start with two pointers

↓

Check condition between pointers

↓

Move pointers inward

↓

Repeat until pointers cross

↓

Done

Two pointers start at opposite ends and move inward based on conditions, reducing unnecessary checks compared to brute force.

Execution Sample

DSA C

int left = 0, right = n - 1;
while (left < right) {
  if (condition) right--;
  else left++;
}

This code moves two pointers inward based on a condition, avoiding checking all pairs.

Execution Table

Step	Operation	Left Pointer	Right Pointer	Condition Check	Action	Visual State
1	Initialize pointers	0	5	N/A	Start	[L:0, ..., R:5]
2	Check condition	0	5	condition false	Move left pointer right	[L:1, ..., R:5]
3	Check condition	1	5	condition true	Move right pointer left	[L:1, ..., R:4]
4	Check condition	1	4	condition false	Move left pointer right	[L:2, ..., R:4]
5	Check condition	2	4	condition true	Move right pointer left	[L:2, ..., R:3]
6	Check condition	2	3	condition false	Move left pointer right	[L:3, ..., R:3]
7	Check pointers cross	3	3	left >= right	Stop	[L:3, ..., R:3]

💡 Pointers crossed or met, so loop ends avoiding checking all pairs.

Variable Tracker

Variable	Start	After Step 2	After Step 3	After Step 4	After Step 5	After Step 6	Final
left	0	1	1	2	2	3	3
right	5	5	4	4	3	3	3

Key Moments - 3 Insights

Why do we move only one pointer at a time instead of both?

Because the condition check decides which pointer to move to find the solution efficiently, as shown in steps 2-6 in the execution_table.

Why does the loop stop when pointers meet or cross?

Because all pairs have been checked without overlap, as shown in step 7 where left >= right stops the loop.

How does this technique reduce the number of checks compared to brute force?

It avoids checking all pairs by moving pointers inward based on conditions, reducing from O(n^2) to O(n), as seen by fewer steps in the execution_table.

Visual Quiz - 3 Questions

Look at the execution_table, what is the value of 'left' after step 4?

A 2

B 1

C 3

D 0

💡 Hint

Check the 'left' column in execution_table row for step 4.

At which step do the pointers meet or cross, causing the loop to stop?

A Step 5

B Step 6

C Step 7

D Step 3

💡 Hint

Look at the exit_note and step 7 in execution_table.

If the condition was always false, how would the pointers move?

A Right pointer moves left each time

B Left pointer moves right each time

C Both pointers move inward simultaneously

D Pointers do not move

💡 Hint

Refer to the action column in execution_table steps where condition is false.

Concept Snapshot

Two Pointer Technique:
- Use two pointers starting at ends
- Move pointers inward based on condition
- Stops when pointers meet or cross
- Reduces checks from O(n^2) to O(n)
- Beats brute force by skipping unnecessary pairs

Full Transcript

The two pointer technique uses two pointers starting at opposite ends of a data structure. At each step, a condition is checked between the pointers. Depending on the result, one pointer moves inward. This continues until the pointers meet or cross, ensuring all relevant pairs are checked efficiently. This method reduces the number of checks compared to brute force, which checks all pairs. The execution table shows how pointers move step-by-step, and the variable tracker records their positions. Key moments clarify why only one pointer moves at a time and why the loop stops when pointers meet. The visual quiz tests understanding of pointer positions and loop termination.

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