**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:**

Objective: Given a string and a dictionary of words, find out if the input string can be broken into a … Read more

Objective: A knight’s tour is a sequence of moves of a knight on a chessboard such that the knight visits … Read more

Objective: Given a 2D matrix of characters. Check whether the word exists in the matrix or not. If it exists … Read more

Objective : In chess, a queen can move as far as she pleases, horizontally, vertically, or diagonally. A chess board … Read more

Objective: In chess, a queen can move as far as she pleases, horizontally, vertically, or diagonally. A chess board has … Read more

Given a maze, NxN matrix. A rat has to find a path from source to destination. maze[0][0] (left top corner)is … Read more

Given a sudoku problem or partially filled sudoku, write a program to solve the sudoku. What is Sudoku: Sudoku is … Read more

What is Backtracking Programming?? Recursion is the key to backtracking programming. As the name suggests we backtrack to find the … Read more

**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:**