Array Reversal Techniques in DSA Python - Cheat Sheet & Quick Revision

Recall & Review

beginner

What is the main idea behind reversing an array?

Reversing an array means changing the order of elements so the first element becomes the last, the second becomes the second last, and so on, effectively flipping the array.

beginner

How does the two-pointer technique work for array reversal?

Two pointers start at the beginning and end of the array. They swap elements and move towards the center until they meet or cross, reversing the array in place.

beginner

What is a simple Python one-liner to reverse a list?

Using slicing: reversed_list = original_list[::-1] which creates a new reversed list without modifying the original.

intermediate

Why is in-place reversal more memory efficient than creating a new reversed array?

In-place reversal swaps elements within the original array without extra space, saving memory compared to making a new reversed copy.

beginner

What is the time complexity of reversing an array using the two-pointer method?

The time complexity is O(n), where n is the number of elements, because each element is visited once during swapping.

Which method reverses an array without using extra space?

A Using slicing with [::-1]

B Creating a new reversed array

C Two-pointer swapping

D Using a for loop to append elements to a new list

Two-pointer swapping reverses the array in place without extra memory, unlike the other methods that create new arrays.

What does the Python slice notation [::-1] do?

A Duplicates the list

B Sorts the list in ascending order

C Removes the last element

D Reverses the list creating a new one

The slice [::-1] creates a new list with elements in reverse order.

In the two-pointer technique, where do the pointers start?

A One at start, one at end

B Both at the end

C Both at the start

D One in the middle, one at start

One pointer starts at the beginning and the other at the end to swap elements moving towards the center.

What is the time complexity of reversing an array of size n?

A O(1)

B O(n)

C O(n^2)

D O(log n)

Reversing requires visiting each element once, so time complexity is O(n).

Which of these is NOT a benefit of in-place array reversal?

A Creates a backup copy

B Faster than creating new array

C Saves memory

D Modifies original array

In-place reversal does not create a backup copy; it modifies the original array directly.

Explain how the two-pointer technique reverses an array step-by-step.

Think of swapping pairs from outside moving to the center.

Describe the difference between reversing an array in-place and creating a new reversed array.

Consider memory use and whether the original array changes.

Practice

1. What does reversing an array mean in simple terms?

easy

A. Sorting the array in ascending order

B. Changing the order of elements so the last becomes first and first becomes last

C. Removing duplicate elements from the array

D. Adding new elements to the end of the array

Solution

1. Step 1: Understand the meaning of reversal

   Reversing means flipping the order of elements so the last element comes first and the first element comes last.

2. Step 2: Compare with other options

   Sorting arranges elements by value, removing duplicates deletes repeats, and adding elements is insertion, not reversal.

3. Final Answer:

   Changing the order of elements so the last becomes first and first becomes last -> Option B

4. Quick Check:

   Reversal = Flip order [OK]

Hint: Reversal flips order, not sorts or removes [OK]

Common Mistakes:

• Confusing reversal with sorting
• Thinking reversal removes duplicates
• Mixing reversal with adding elements

2. Which of the following is the correct Python syntax to reverse a list named arr in-place?

easy

A. arr = arr.reverse()

B. reverse(arr)

C. arr.reverse()

D. arr[::-1]

Solution

1. Step 1: Identify the in-place reversal method

   In Python, arr.reverse() reverses the list in-place and returns None.

2. Step 2: Check other options

   reverse(arr) is not a valid function, arr = arr.reverse() assigns None to arr, and arr[::-1] creates a reversed copy but does not change arr in-place.

3. Final Answer:

   arr.reverse() -> Option C

4. Quick Check:

   In-place reverse uses arr.reverse() [OK]

Hint: Use arr.reverse() for in-place reversal [OK]

Common Mistakes:

• Assigning arr = arr.reverse() which sets arr to None
• Using slicing without assignment for in-place change
• Calling a non-existent reverse() function

3. What is the output of the following code?

arr = [1, 2, 3, 4, 5]
reversed_arr = arr[::-1]
print(reversed_arr)
print(arr)

medium

A. [5, 4, 3, 2, 1] and [1, 2, 3, 4, 5]

B. [5, 4, 3, 2, 1] and [5, 4, 3, 2, 1]

C. [1, 2, 3, 4, 5] and [1, 2, 3, 4, 5]

D. Error because slicing cannot reverse

Solution

1. Step 1: Understand slicing with negative step

   The slice arr[::-1] creates a new list with elements in reverse order.

2. Step 2: Check original list after slicing

   The original list arr remains unchanged because slicing returns a new list.

3. Final Answer:

   [5, 4, 3, 2, 1] and [1, 2, 3, 4, 5] -> Option A

4. Quick Check:

   Slicing reverses copy, original unchanged [OK]

Hint: Slicing with [::-1] reverses copy, not original [OK]

Common Mistakes:

• Thinking slicing changes original list
• Expecting error from slicing
• Confusing reversed copy with in-place change

4. Find the error in this code that tries to reverse a list arr in-place:

def reverse_list(arr):
    for i in range(len(arr)):
        arr[i], arr[len(arr)-i] = arr[len(arr)-i], arr[i]

arr = [1, 2, 3, 4]
reverse_list(arr)
print(arr)

medium

A. Syntax error in the for loop

B. No error, code works correctly

C. arr is not modified because function returns nothing

D. Index out of range error due to incorrect index calculation

Solution

1. Step 1: Analyze index usage in swapping

   The code uses arr[len(arr)-i] which causes index out of range because list indices go from 0 to len(arr)-1.

2. Step 2: Identify correct index for swapping

   The correct index should be len(arr)-1 - i to avoid going beyond the last index.

3. Final Answer:

   Index out of range error due to incorrect index calculation -> Option D

4. Quick Check:

   Index error from len(arr)-i used as index [OK]

Hint: Use len(arr)-1 - i for last index, not len(arr)-i [OK]

Common Mistakes:

• Using len(arr)-i instead of len(arr)-1 - i
• Not realizing list indices start at 0
• Assuming function returns reversed list

5. You have a list of numbers arr = [10, 20, 30, 40, 50]. Write a function that reverses the list without using built-in reverse methods or slicing. Which approach below correctly reverses the list in-place?

hard

A. Swap elements from start and end moving towards center using a while loop

B. Create a new list and append elements from the original list in reverse order

C. Sort the list in descending order

D. Use a for loop to assign arr[i] = arr[len(arr)-1-i] without swapping

Solution

1. Step 1: Understand in-place reversal without built-ins

   Swapping elements from start and end moving towards the center changes the list in-place without extra space.

2. Step 2: Evaluate other options

   Creating a new list is not in-place, sorting changes order by value, and assigning without swapping overwrites data incorrectly.

3. Final Answer:

   Swap elements from start and end moving towards center using a while loop -> Option A

4. Quick Check:

   In-place reversal = swap ends towards center [OK]

Hint: Swap pairs from ends moving inward for in-place reverse [OK]

Common Mistakes:

• Using sorting instead of reversal
• Overwriting elements without swapping
• Creating new list instead of in-place change