Print All Permutations of a String

Given an input string STR, generate and print all possible permutations of the string.

Input:

str

Output:

All permutations of the input string, each on a new line.

Example:

Input:
"abc"
Output:
abc
acb
bac
bca
cab
cba

Constraints:

  • The input string STR consists only of lowercase alphabets.
  • 1 ≤ length of STR ≤ 8
  • Time Limit: 1 second
Note:

The input string may contain duplicate characters, resulting in duplicate permutations. The order of the permutations does not matter.

AnswerBot
4d

Generate and print all possible permutations of a given input string.

  • Use recursion to generate all permutations by swapping characters in the string.

  • Maintain a visited array to keep track of character...read more

Help your peers!
Add answer anonymously...
Grey Orange Software Engineer Interview Questions
Stay ahead in your career. Get AmbitionBox app
qr-code
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

Made with ❤️ in India. Trademarks belong to their respective owners. All rights reserved © 2024 Info Edge (India) Ltd.

Follow us
  • Youtube
  • Instagram
  • LinkedIn
  • Facebook
  • Twitter