Step-by-step solution for String Scramble
View the challenge

This challenge requires you to determine if string 1 can be rearranged to match string 2. This is a simple problem that we can solve by looping through the second string and checking if each character exists in the first string.



You need to be a member to see the rest of this solution and code.