For this Question: Two strings are completely different if the characters of one string cannot be rearranged to form the other string. Given a string find the number of completely different substrings of the string.The first line of the input contains a string S.

<b>Constraints:</b>
1 <= |S| <= 100
The string contains only lowercase English letters.The output should contain number of completely different substrings.Sample Input
abc

Sample Output
6

Sample Input
aaa

Sample Output
3, I have written this Solution Code: s = input()
Set = set()
l = []
for i in range(len(s)):
	l.append(s[i])
for i in range(len(s)+1):
	for j in range(i+1,len(s)+1):
		a = ''.join(sorted(l[i:j]))
		#print(a)
		Set.add(a)
print(len(Set)), In this Programming Language: Python, Now tell me if this Code is compilable or not?