LESSON 316 OF 348 · DYNAMIC PROGRAMMING

Permutations of Given Length in Rust

Practice O(n)

Given a non-negative integer N return the number permutations of length N

Example:

Input: N = 3
Output: 6
Explanation: [
    [1, 2, 3],
    [1, 3, 2],
    [2, 1, 3],
    [2, 3, 1],
    [3, 1, 2],
    [3, 2, 1]
]

Notes: N <= 12

STEP 1 OF 5

Guided

Ctrl + Enter to check

Keep going with RustAbout 340 step-by-step lessons, from your first line of code to coding interviews. Free to start.

Permutations Of Given Length in Rust