How would you like to learn today?
Visualize algorithms in real time, explore them step by step, or challenge yourself with a test.Choose a path to focus—or scroll down to preview all options.
Visualize the algorithm step-by-step with interactive animations in real time.
Read the full explanation, examples, and starter code at your own pace.
Drag and arrange the algorithm steps in the correct execution order.
🧠 Select Active to activate
Follow every state change, comparison, and transformation as the execution unfolds in real time.
📖 Select Passive to activate
Find Next PermutationMediumA permutation of an array of integers is an arrangement of its elements into a sequence or linear order.
For example, for arr = [1,2,3], the following are all the permutations:
[1,2,3], [1,3,2], [2,1,3], [2,3,1], [3,1,2], [3,2,1]
The next permutation of an array is the next lexicographically greater permutation of its integers. More formally, if all permutations are sorted in ascending lexicographical order, the next permutation is the one that follows it in that order.
If no such arrangement is possible (i.e., the array is in descending order), rearrange the array as the smallest possible order (sorted in ascending order).
arr = [1,2,3] is [1,3,2].arr = [2,3,1] is [3,1,2].arr = [3,2,1] is [1,2,3] (since no larger permutation exists).Given an array of integers nums, find the next permutation of nums.
nums directly).Input:
nums = [1,2,3]
Output:
[1,3,2]
Input:
nums = [3,2,1]
Output:
[1,2,3]
Input:
nums = [1,1,5]
Output:
[1,5,1]
Input:
nums = [5]
Output:
[5] # No change
Input:
nums = [9,8,7,6,5,4,3,2,1]
Output:
[1,2,3,4,5,6,7,8,9] # Reset to lowest order
1 <= nums.length <= 1000 <= nums[i] <= 100🎯 Select Challenge to activate
Drag and arrange the algorithm steps in the correct execution order instead of spending time typing code letter by letter.
The algorithm is divided into three logical parts. Carefully rearrange each section in the correct order to form a complete and valid solution.
Understand Below AlgorithmGreen text means the instruction is placed in the correct position.
Red text means the instruction is in the wrong position.
Instructions with the same background color indicate particular blocks start and end.
A tick mark means the instruction is correct and locked.
🔒 Locked steps cannot be moved. Only unlocked steps are draggable.
🔊 Enable sound for swap feedback and completion effects.