Two Pointer Technique on Arrays in DSA C - 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 positions, reducing time complexity.

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 both move forward at different speeds or conditions.

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

Give a simple example problem where Two Pointer Technique is useful.

Finding if there exists two numbers in a sorted array that add up to a target sum.

intermediate

What is a common condition to move the left or right pointer in the Two Pointer Technique for sum problems?

If the sum of elements at pointers is less than target, move left pointer right; if more, move right pointer left.

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

A Move the left pointer to the right

B Move the right pointer to the left

C Stop the process

D Move both pointers inward

If the sum is less than the target, moving the left pointer right increases the sum because the array is sorted.

What is the typical time complexity of the Two Pointer Technique on a sorted array?

A O(n²)

B O(n log n)

C O(n)

D O(log n)

Two pointers scan the array once, so the time complexity is linear O(n).

Which of these problems is best solved using the Two Pointer Technique?

A Finding duplicates in an unsorted array

B Finding two numbers that add up to a target in a sorted array

C Sorting an array

D Finding the maximum element

Two Pointer Technique works well for sum problems on sorted arrays.

If the array is not sorted, can you directly apply the Two Pointer Technique for sum problems?

A Yes, always

B Only if the array has unique elements

C Only if the array size is small

D No, sorting is needed first

The technique relies on sorted order to decide pointer movement.

In the Two Pointer Technique, what happens when the two pointers meet or cross?

A The search ends

B You reset pointers

C You swap elements

D You double the pointers

When pointers meet or cross, all pairs have been checked.

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

Think about how two indexes move through the array to reduce repeated work.

Describe the steps to find two numbers in a sorted array that add up to a target using the Two Pointer Technique.

Start with one pointer at the start and one at the end.