Write a function called reverseString that takes in a string and returns the reversed version of the string. Be sure to use recursion in your solution. As a base case, you can check if the string is ...
Wait, you want to use factorials or you want to use recursion? A factorial-based approach would involve mapping 0.. (n! - 1) to different permutations. A recursive approach (which is what I would use) ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback