Q: https://leetcode.com/problems/count-unique-characters-of-all-substrings-of-a-given-string/

class Solution:

def uniqueLetterString(self, s: str) -> int:

n=len(s)

substr=[]

for i in range(n):

for j in range(i+1, n+1):

substr.append(s[i:j])

#substring lenth count

sum=0

unq=[]

for i in substr:

if i not in unq:

unq.append(i)

sum=sum+len(set(i))

print(unq)

return sum