Next Permutation

Medium

Next Permutation

Next Permutation rearranges a sequence into the lexicographically next greater permutation in-place. It finds the first decreasing point (pivot) from the right, swaps it with its successor, then reverses the suffix in O(n).

📊 Complexity

Type	Value
Best	O(1)
Average	O(n)
Worst	O(n)
Space	O(1)

🏷️ Tags

ImplementationPermutationIn-placeO(n)

📖 Introduction

Next permutation finds the permutation that comes immediately after the given one when all permutations of the same elements are listed in lexicographic order. It transforms the array in-place in O(n) without extra arrays.

1/14

🚀Start Next Permutation

Let's find the lexicographically next permutation of [1, 3, 5, 4, 2] in-place. We start by finding the point where the descent breaks from the right.

Next Permutation

Medium

Next Permutation

📊 Complexity

Type	Value
Best	O(1)
Average	O(n)
Worst	O(n)
Space	O(1)

🏷️ Tags

ImplementationPermutationIn-placeO(n)

📖 Introduction

1/14

🚀Start Next Permutation

Let's find the lexicographically next permutation of [1, 3, 5, 4, 2] in-place. We start by finding the point where the descent breaks from the right.

🚀Start Next Permutation