Two Pointer Technique on Arrays in DSA Python - Cheat Sheet & Quick Revision

Recall & Review

beginner

What is the Two Pointer Technique on Arrays?

It is a method where two pointers move through the array to solve problems efficiently, often from different ends or at different speeds.

beginner

How do the two pointers usually move in the Two Pointer Technique?

They often start at opposite ends of the array and move towards each other, or one pointer moves faster than the other to find pairs or subarrays.

intermediate

Why is the Two Pointer Technique efficient compared to nested loops?

Because it reduces the time complexity from O(n²) to O(n) by avoiding repeated scanning of the array with nested loops.

beginner

Example problem: Find if there exists two numbers in a sorted array that add up to a target sum using Two Pointer Technique. What is the approach?

Start one pointer at the beginning and one at the end. If their sum is less than target, move the start pointer forward. If more, move the end pointer backward. Repeat until pointers meet or sum found.

intermediate

Can the Two Pointer Technique be used on unsorted arrays directly?

Usually no. The array often needs to be sorted first to use this technique effectively for problems like pair sums.

In the Two Pointer Technique, if the sum of elements at pointers is greater than the target, what should you do?

A Move the pointer at the end backward

B Move the pointer at the start forward

C Stop the process

D Move both pointers forward

If the sum is too big, moving the end pointer backward reduces the sum.

What is the typical time complexity of the Two Pointer Technique on arrays?

A O(log n)

B O(n log n)

C O(n²)

D O(n)

Two pointers move through the array once, so time complexity is O(n).

Which condition is usually required to apply the Two Pointer Technique for pair sum problems?

A Array must be empty

B Array must be sorted

C Array must have only positive numbers

D Array must be unsorted

Sorting helps pointers decide which way to move based on sum comparisons.

If two pointers start at the beginning of the array and move at different speeds, what problem can this solve?

A Finding duplicates

B Sorting the array

C Detecting cycles in linked lists

D Reversing the array

Slow and fast pointers are used in linked lists to detect cycles by moving at different speeds.

What happens when the two pointers meet in the Two Pointer Technique?

A The search ends

B You must reset pointers

C You double the pointers

D You ignore the meeting

When pointers meet, it means all pairs or elements have been checked.

Explain the Two Pointer Technique and how it helps solve array problems efficiently.

Think about how two markers move through the array to find pairs or subarrays.

Describe a step-by-step approach to find two numbers in a sorted array that add up to a target using the Two Pointer Technique.

Imagine walking from both ends of a hallway to find two people whose heights add up to a number.