Sheldon Password Problem Tags: Permutation. Author: Shami. This problem is a fancy way of asking to compute Kth permutation given a starting string. Since the maximum length of string is only 9, we can map the letters to digits and work with numbers (if that is more comfortable). How to find the next permutation? This Wiki article describes the following steps:
However, if you are programming in C++, you’ll be happy to know there is a function that just does that! asked 12 Jan, 14:18 ![]()
|