Why Next Permutation of Array in DSA Python?

The Big Idea

What if you could jump straight to the next bigger code without trying every possibility?

The Scenario

Imagine you have a list of numbers representing a password or a code, and you want to find the very next code that is just a little bigger than the current one. Doing this by trying every possible combination manually would take forever!

The Problem

Manually checking every possible order of numbers to find the next bigger arrangement is slow and confusing. It's easy to make mistakes, miss the correct next code, or waste a lot of time trying all possibilities.

The Solution

The next permutation method quickly finds the next bigger arrangement by smartly swapping and reversing parts of the list. It avoids checking all combinations and gives the answer in just a few steps.

Before vs After

✗ Before

numbers = [1, 2, 3]
# Try all permutations to find next bigger one
# This is slow and complex

✓ After

numbers = [1, 2, 3]
next_permutation(numbers)
# Quickly finds next bigger arrangement

What It Enables

This lets you efficiently generate the next bigger arrangement of numbers, useful in puzzles, games, and algorithms that need ordered sequences.

Real Life Example

When solving a puzzle game where you must try the next possible move or code, next permutation helps you jump directly to the next option without guessing all possibilities.

Key Takeaways

Manual checking of all orders is slow and error-prone.

Next permutation finds the next bigger arrangement quickly.

This method saves time and avoids mistakes in ordering problems.

Practice

1. What does the next permutation of an array represent?

easy

A. The next lexicographically greater arrangement of the array elements

B. The array sorted in ascending order

C. The array reversed

D. The smallest element moved to the front

Solution

1. Step 1: Understand the concept of permutation order

   Permutations can be ordered lexicographically like words in a dictionary.

2. Step 2: Define next permutation meaning

   The next permutation is the next arrangement that is just greater than the current one in this order.

3. Final Answer:

   The next lexicographically greater arrangement of the array elements -> Option A

4. Quick Check:

   Next permutation = next bigger arrangement [OK]

Hint: Next permutation means next bigger order arrangement [OK]

Common Mistakes:

• Thinking next permutation is just sorting ascending
• Confusing next permutation with reversing the array
• Assuming next permutation always moves smallest element front

2. Which of the following Python code snippets correctly swaps two elements arr[i] and arr[j] in an array?

easy

A. arr[i], arr[j] = arr[j], arr[i]

B. arr[i] = arr[j]; arr[j] = arr[i]

C. swap(arr[i], arr[j])

D. arr[i] = arr[j]

Solution

1. Step 1: Recall Python tuple unpacking for swapping

   Python allows swapping two variables in one line using tuple unpacking.

2. Step 2: Check each option

   arr[i], arr[j] = arr[j], arr[i] correctly swaps using arr[i], arr[j] = arr[j], arr[i]. arr[i] = arr[j]; arr[j] = arr[i] overwrites arr[i] before assigning arr[j]. swap(arr[i], arr[j]) is invalid syntax without a defined function. arr[i] = arr[j] only assigns one element.

3. Final Answer:

   arr[i], arr[j] = arr[j], arr[i] -> Option A

4. Quick Check:

   Python swap uses tuple unpacking [OK]

Hint: Use tuple unpacking to swap in Python [OK]

Common Mistakes:

• Overwriting one element before swapping
• Using undefined swap function
• Assigning only one element instead of both

3. What is the output of the following code snippet?

arr = [1, 3, 2]
# Apply next permutation logic
# Step 1: Find first decreasing element from right (index 0)
# Step 2: Find element just larger than arr[0] from right (index 2)
# Step 3: Swap arr[0] and arr[2]
# Step 4: Reverse elements after index 0

arr[0], arr[2] = arr[2], arr[0]
arr[1:] = arr[1:][::-1]
print(arr)

medium

A. [3, 1, 2]

B. [2, 1, 3]

C. [1, 2, 3]

D. [2, 3, 1]

Solution

1. Step 1: Identify the first decreasing element from right

   From right, arr[1]=3 > arr[2]=2 (not decreasing), arr[0]=1 < arr[1]=3 (decreasing at index 0)

2. Step 2: Find element just larger than arr[0] from right

   From right, arr[2]=2 > arr[0]=1, so index 2 chosen

3. Step 3: Swap arr[0] and arr[2]

   Swap 1 and 2 -> arr becomes [2, 3, 1]

4. Step 4: Reverse elements after index 0

   Reverse arr[1:] -> arr[1:] = [3,1] reversed to [1,3]

5. Final Answer:

   [2, 1, 3] -> Option B

6. Quick Check:

   Next permutation of [1,3,2] = [2,1,3] [OK]

Hint: Swap pivot with next bigger, then reverse suffix [OK]

Common Mistakes:

• Not reversing suffix after swap
• Swapping wrong elements
• Confusing increasing and decreasing order

4. The following code attempts to find the next permutation of arr = [3, 2, 1]. What is the error?

def next_permutation(arr):
    i = len(arr) - 2
    while i >= 0 and arr[i] >= arr[i + 1]:
        i -= 1
    if i >= 0:
        j = len(arr) - 1
        while arr[j] <= arr[i]:
            j -= 1
        arr[i], arr[j] = arr[j], arr[i]
    arr[i + 1:] = reversed(arr[i + 1:])

arr = [3, 2, 1]
next_permutation(arr)
print(arr)

medium

A. The while loop condition is incorrect

B. Swapping elements is done in wrong order

C. Using reversed() returns an iterator, not a list, causing wrong assignment

D. The function does not handle empty arrays

Solution

1. Step 1: Analyze the reversal line

   The line arr[i + 1:] = reversed(arr[i + 1:]) assigns an iterator to a list slice, which expects a list.

2. Step 2: Identify correct usage

   To assign reversed elements properly, convert iterator to list: arr[i + 1:] = list(reversed(arr[i + 1:])).

3. Final Answer:

   Using reversed() returns an iterator, not a list, causing wrong assignment -> Option C

4. Quick Check:

   reversed() needs list() for slice assignment [OK]

Hint: Use list(reversed(...)) when assigning slices [OK]

Common Mistakes:

• Assigning reversed() iterator directly to list slice
• Ignoring empty array edge case
• Swapping elements incorrectly

5. Given the array arr = [1, 5, 1], what is the next permutation after applying the standard algorithm? Consider duplicates carefully.

hard

A. [5, 1, 5]

B. [1, 1, 5]

C. [1, 5, 1]

D. [5, 1, 1]

Solution

1. Step 1: Find first decreasing element from right

   From right: arr[1]=5 > arr[2]=1 (not decreasing), arr[0]=1 < arr[1]=5 (decreasing at index 0)

2. Step 2: Find element just larger than arr[0] from right

   From right, arr[2]=1 not > 1, arr[1]=5 > 1, so index 1 chosen

3. Step 3: Swap arr[0] and arr[1]

   Swap 1 and 5 -> arr becomes [5, 1, 1]

4. Step 4: Reverse elements after index 0

   Reverse arr[1:] -> arr[1:] = [1,1] reversed is same [1,1]

5. Final Answer:

   [5, 1, 1] -> Option D

6. Quick Check:

   Duplicates handled, next permutation = [5,1,1] [OK]

Hint: Swap pivot with next bigger, reverse suffix even with duplicates [OK]

Common Mistakes:

• Ignoring duplicates when finding next bigger element
• Not reversing suffix after swap
• Assuming next permutation is sorted ascending always