Two Pointer Technique on Arrays in DSA Python - Execution Trace

Concept Flow - Two Pointer Technique on Arrays

Initialize two pointers: left=0, right=end

↓

Check condition: left < right?

No→Stop

Yes↓

Compare or process elements at left and right

↓

Move pointers: left++ or right-- or both

↩Back to condition check

Start with two pointers at array ends, compare or process elements, move pointers inward until they meet or cross.

Execution Sample

DSA Python

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

Print pairs of elements from the start and end moving towards the center.

Execution Table

Step	Operation	left	right	Elements Compared	Pointer Movement	Array State
1	Initialize pointers	0	4	N/A	N/A	[1, 3, 5, 7, 9]
2	Check condition left < right	0	4	N/A	Condition True	[1, 3, 5, 7, 9]
3	Compare elements	0	4	1 and 9	N/A	[1, 3, 5, 7, 9]
4	Move pointers	1	3	N/A	left++ and right--	[1, 3, 5, 7, 9]
5	Check condition left < right	1	3	N/A	Condition True	[1, 3, 5, 7, 9]
6	Compare elements	1	3	3 and 7	N/A	[1, 3, 5, 7, 9]
7	Move pointers	2	2	N/A	left++ and right--	[1, 3, 5, 7, 9]
8	Check condition left < right	2	2	N/A	Condition False	[1, 3, 5, 7, 9]

💡 Pointers met at index 2, condition left < right is False, loop ends.

Variable Tracker

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

Key Moments - 3 Insights

Why does the loop stop when left equals right?

Because the condition left < right becomes False at step 8, meaning pointers have met or crossed, so no more pairs to compare.

What happens if we move only one pointer instead of both?

The pointers won't move towards each other properly, causing incorrect or incomplete processing, as shown by pointer movements at steps 4 and 7.

Why do we compare elements at left and right pointers?

Because the two pointer technique processes pairs from opposite ends, as seen in steps 3 and 6 where elements at left and right are compared.

Visual Quiz - 3 Questions

Look at the execution table, what are the elements compared at step 6?

A 3 and 7

B 5 and 5

C 1 and 9

D 7 and 3

💡 Hint

Check the 'Elements Compared' column at step 6 in the execution table.

At which step does the condition left < right become False?

A Step 4

B Step 7

C Step 8

D Step 3

💡 Hint

Look at the 'Pointer Movement' and 'Operation' columns for condition checks in the execution table.

If we only increment left pointer and never decrement right, what happens to the loop?

A It stops earlier

B It runs infinitely or misses pairs

C It compares all pairs correctly

D It reverses the array

💡 Hint

Refer to key moment about pointer movement and how both pointers must move inward.

Concept Snapshot

Two Pointer Technique on Arrays:
- Use two pointers starting at array ends (left=0, right=end).
- While left < right, process elements at pointers.
- Move pointers inward (left++, right--) each step.
- Stops when pointers meet or cross.
- Efficient for pairwise processing without extra space.

Full Transcript

The two pointer technique uses two indexes starting at opposite ends of an array. We check if the left pointer is less than the right pointer to continue. At each step, we compare or process the elements at these pointers. Then, we move the left pointer forward and the right pointer backward. This continues until the pointers meet or cross, meaning all pairs have been processed. This method is efficient for problems needing pairwise checks or processing from both ends without extra memory.