Why Two Pointer Technique on Arrays in DSA Python?

The Big Idea

What if you could find pairs in a list without checking every single combination?

The Scenario

Imagine you have a long list of numbers and you want to find two numbers that add up to a specific target. You try checking every possible pair one by one.

The Problem

Checking every pair means a lot of repeated work and takes a very long time as the list grows. It's easy to make mistakes and miss pairs or check the same pairs multiple times.

The Solution

The two pointer technique uses two markers moving through the list from different ends. It smartly skips unnecessary checks and finds the answer faster without missing anything.

Before vs After

✗ Before

for i in range(len(arr)):
    for j in range(i+1, len(arr)):
        if arr[i] + arr[j] == target:
            return (i, j)

✓ After

left, right = 0, len(arr) - 1
while left < right:
    current_sum = arr[left] + arr[right]
    if current_sum == target:
        return (left, right)
    elif current_sum < target:
        left += 1
    else:
        right -= 1

What It Enables

This technique makes searching pairs or conditions in sorted arrays quick and efficient, even for very large lists.

Real Life Example

Finding two expenses in your bank statement that add up exactly to a certain amount you want to track.

Key Takeaways

Manual pair checking is slow and repetitive.

Two pointers move inward to find pairs efficiently.

Works best on sorted arrays for quick results.

Practice

1. What is the main idea behind the Two Pointer Technique when used on arrays?

easy

A. Use two arrays to store temporary results

B. Sort the array twice before processing

C. Use two indices to scan the array from different ends or positions simultaneously

D. Use recursion to divide the array into two parts

Solution

1. Step 1: Understand the two pointer concept

   The technique uses two pointers (indices) to traverse the array, often starting from opposite ends or different positions.

2. Step 2: Recognize the purpose

   This helps solve problems efficiently by reducing the number of iterations compared to nested loops.

3. Final Answer:

   Use two indices to scan the array from different ends or positions simultaneously -> Option C

4. Quick Check:

   Two pointers scan array ends or positions [OK]

Hint: Think of two fingers moving inward or outward on the array [OK]

Common Mistakes:

• Confusing two pointers with using two separate arrays
• Assuming sorting is always required
• Thinking recursion is part of two pointer technique

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

easy

A. left = 0; right = len(arr) - 1

B. left = 1; right = len(arr)

C. left = -1; right = len(arr)

D. left = 0; right = len(arr)

Solution

1. Step 1: Identify valid pointer positions

   In Python, array indices start at 0, so the left pointer should start at 0.

2. Step 2: Set right pointer correctly

   The right pointer should be at the last valid index, which is length of array minus 1.

3. Final Answer:

   left = 0; right = len(arr) - 1 -> Option A

4. Quick Check:

   Start left at 0 and right at last index [OK]

Hint: Remember Python arrays start at 0, last index is length-1 [OK]

Common Mistakes:

• Setting right pointer to len(arr) causes index error
• Starting left pointer at 1 misses first element
• Using negative indices incorrectly

3. What will be the output of the following Python code?

arr = [1, 3, 5, 7, 9]
left, right = 0, 4
result = []
while left < right:
    result.append(arr[left] + arr[right])
    left += 1
    right -= 1
print(result)

medium

A. [10, 14]

B. [10, 12]

C. [10, 12, 14]

D. [10, 10]

Solution

1. Step 1: Trace the loop iterations

   Initial pointers: left=0, right=4 - Iteration 1: arr[0]+arr[4] = 1+9=10, result=[10] - left=1, right=3 - Iteration 2: arr[1]+arr[3] = 3+7=10, result=[10,10] - left=2, right=2 (loop ends because left is not less than right)

2. Step 2: Check loop condition and final result

   Loop stops when left == right (2), so only two sums added: [10, 10]

3. Final Answer:

   [10, 10] -> Option D

4. Quick Check:

   Sum pairs from ends until pointers meet [OK]

Hint: Add pairs from ends until pointers cross [OK]

Common Mistakes:

• Including middle element sum when pointers meet
• Not updating pointers correctly
• Confusing indices causing wrong sums

4. Find the error in the following code that uses two pointers to check if an array is a palindrome:

def is_palindrome(arr):
    left, right = 0, len(arr)
    while left < right:
        if arr[left] != arr[right]:
            return False
        left += 1
        right -= 1
    return True

print(is_palindrome([1, 2, 3, 2, 1]))

medium

A. left should start at 1

B. right should be initialized as len(arr) - 1

C. Use 'while left <= right' instead of 'while left < right'

D. Return True should be inside the loop

Solution

1. Step 1: Check pointer initialization

   In Python, last index is len(arr) - 1, but code sets right = len(arr), which is out of range.

2. Step 2: Correct pointer initialization

   Change right to len(arr) - 1 to avoid index error and correctly compare elements.

3. Final Answer:

   right should be initialized as len(arr) - 1 -> Option B

4. Quick Check:

   Last index = length - 1 [OK]

Hint: Last index is length minus one, not length [OK]

Common Mistakes:

• Setting right pointer to length causes index error
• Changing loop condition incorrectly
• Returning True too early inside loop

5. Given a sorted array arr and a target sum target, how can you use the two pointer technique to find if there exists two numbers that add up to target? Choose the correct approach.

hard

A. Initialize left at 0 and right at len(arr)-1; move pointers inward based on sum comparison

B. Initialize both pointers at 0 and move right pointer only

C. Sort the array again and use binary search for each element

D. Use two nested loops to check all pairs

Solution

1. Step 1: Set pointers at array ends

   Start left pointer at 0 (start) and right pointer at last index (len(arr)-1).

2. Step 2: Move pointers based on sum

   Calculate sum of arr[left] + arr[right]. If sum equals target, return True. If sum is less, move left pointer right to increase sum. If sum is more, move right pointer left to decrease sum.

3. Final Answer:

   Initialize left at 0 and right at len(arr)-1; move pointers inward based on sum comparison -> Option A

4. Quick Check:

   Two pointers from ends adjust to find target sum [OK]

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

Common Mistakes:

• Moving only one pointer without condition
• Using nested loops instead of two pointers
• Not starting pointers at array ends