Print Permutations - String Problem Statement
Given an input string 'S', you are tasked with finding and returning all possible permutations of the input string.
Input:
The first and only line of input contains a string 'S' of alphabets in lower case characters.
Output:
Print all the permutations of the given string 'S' on separate lines.
Example:
Input: "abc"
Output:
abc
acb
bac
bca
cab
cba
Constraints:
- 0 <= |S| <= 8
Note:
- The input string may contain the same characters, so there can be duplicate permutations.
- The order of permutations does not matter.
- You do not need to print anything; it has already been taken care of. Implement the function to return the answer.
AnswerBot
2d
Return all possible permutations of a given input string.
Use recursion to generate all possible permutations of the input string.
Swap characters at different positions to generate permutations.
Handle ...read more
Help your peers!
Add answer anonymously...
Top Ola Cabs SDE-2 interview questions & answers
Popular interview questions of SDE-2
Stay ahead in your career. Get AmbitionBox app
Helping over 1 Crore job seekers every month in choosing their right fit company
65 L+
Reviews
4 L+
Interviews
4 Cr+
Salaries
1 Cr+
Users/Month
Contribute to help millions
Get AmbitionBox app