"* Every time we put a new letter in position i, we then had to find all the possible combinations at position i+1 – this was the recursive call that we made. How do we know when to save a string?
# For a given two strings, 'str1' and 'str2', check whether they are a permutation of each other or not. # Permutations of each other # Two strings are said to be a permutation of each other when ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback