Permutations

Try to solve the Permutations problem.

We'll cover the following

Statement#

Given an input string, word, return all possible permutations of the string.

Note: The order of permutations does not matter.

Constraints:

1 of 3

2 of 3

3 of 3

Let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

Permutations

What should be the output if the following string is given as input?

Input string = “xyz”

[“xyz”, “xzy”, “yxz”, “yzx”, “zyx”, “zxy”]

[“xyz”, “xzy”, “xxz”, “yzx”, “zyx”, “zxz”]

[“xyz”, “xzy”, “xxz”, “yzx”, “zyx”, “zxy”]

Question 1 of 30 attempted

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Drag and drop the cards to rearrange them in the correct sequence.

Starting from the first index as the current index, recursively compute the permutations of the input string.

Compute the permutation by swapping the current index with every index in the remaining string.

Recurse the computation step by incrementing the current index by 1.

If we reach the end of the string, store the current string as a permutation.

Return the list of all permutations.

Implement your solution in the following coding playground:

Python

usercode > main.py

def permute_word(word):
    result = []
    # Replace this placeholder return statement with your code
    return result

d

Enter to Rename, Shift+Enter to Preview

Input #1

Permutations

Subsets: Introduction

Solution: Permutations