Interview Cake
Interview Cake
Just No more free questions left!
Upgrade NowWrite a recursive function for generating all permutations of an input string. Return them as a set.
Don't worry about time or space complexity—if we wanted efficiency we'd write an iterative version.
To start, assume every character in the input string is unique.
Your function can have loops—it just needs to also be recursive.
Make sure you have a base case! Otherwise your function may never terminate!
We'll never post on your wall or message your friends.
Once you're logged in, you'll get free full access to this and 4 other questions.
We'll never post on your wall or message your friends.
Once you're logged in, you'll get free full access to this and 4 other questions.
How does the problem change if the string can have duplicate characters?
What if we wanted to bring down the time and/or space costs?
We'll never post on your wall or message your friends.
Once you're logged in, you'll get free full access to this and 4 other questions.