Print All The Permutations Of a String

Objective: Given a String, print all the permutations of it.

Input: A String

Output: Print all the permutations of a string

Example:

Input : abc

Output:

 abc acb bac bca cba cab

Approach:

1. Take one character at a time and fix it at the first position. (use swap to put every character at the first position)
2. make recursive call to rest of the characters.
3. use swap to revert the string back to its original form fo next iteration.

Run This Code

Code:

abc acb bac bca cba cab

Also Read:

- Get the Sum of all left leaves in a Binary tree Beginner
- In a Binary Tree, Create Linked Lists of all the nodes at each depth. Hard
- Find Whether Given String is palindrome or Not. Beginner
- Find three elements in an array that sum to a given value Beginner
- Find three smallest elements in a given array Beginner
- Get the Height of a Node in a Binary Tree Medium
- Given a binary tree, find out the maximum sum of value from root to each leaf. Medium