// Given a string S, find and return all the possible permutations of the input string. // Note 1 : The order of permutations is not important. // Note 2 : If original string contains duplicate ...