s1_count, s2_count = [0] * 26, [0] * 26 # create empty lists # idea is to store the 26 letters of the alphabet for i in range(len(s1)): # iterate through the first couple letters in s2 so that # we ...
The order of permutation of 0,1,2,3 is [0,1,2,3], [0,1,3,2], [0,2,1,3], [0,2,3,1], [0,3,1,2], [0,3,2,1], [1,0,2,3], [1,0,3,2], [1,2,0,3], ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results