Given n and k, return the k-th permutation sequence of permutations of numbers {1,2,..,n}. Note: Given n will be between 1 and 9 inclusive. By listing and labeling all of the permutations in order, we get the following sequence (ie, for n = 3): “123” “132” “213” “231” “312” “321” Then, k=5th permutation sequence will […]
