87. Scramble String

We can scramble a string s to get a string t using the following algorithm: - If the length of the string is 1, stop. - If the length of the string is > 1, do the following: - Split the string into two non-empty substrings at a random index, i.e., if the string is s, divide it to x and y where s = x + y. - Randomly decide to swap the two substrings or to keep them in the same order. i.e., afte