Write a function to find all permutations of a given string. The order of permutations does not need to be lexicographic.
AnswerBot
2y
Find all permutations of a given string.
Use recursion to swap each character with every other character in the string.
Repeat the process for each substring.
Add the permutation to an array.
Help your peers!
Add answer anonymously...
Carwale SDE (Software Development Engineer) interview questions & answers
A SDE (Software Development Engineer) was asked Q. Implement a max() function that returns the maximum of all elements in the stack...read more
A SDE (Software Development Engineer) was asked Q. What are stacks and their properties?
A SDE (Software Development Engineer) was asked Q. Calculate the sum of only the even numbers in the Fibonacci series.
Popular interview questions of SDE (Software Development Engineer)
A SDE (Software Development Engineer) was asked Q1. Implement a max() function that returns the maximum of all elements in the stack...read more
A SDE (Software Development Engineer) was asked Q2. What are stacks and their properties?
A SDE (Software Development Engineer) was asked Q3. Calculate the sum of only the even numbers in the Fibonacci series.
>
Carwale SDE (Software Development Engineer) Interview Questions
Stay ahead in your career. Get AmbitionBox app
Trusted by over 1.5 Crore job seekers to find their right fit company
80 L+
Reviews
10L+
Interviews
4 Cr+
Salaries
1.5 Cr+
Users
Contribute to help millions
AmbitionBox Awards
Get AmbitionBox app
Made with ❤️ in India. Trademarks belong to their respective owners. All rights reserved © 2025 Info Edge (India) Ltd.
Follow Us
