In Python
s= "ABCC"
n = len(s)
sorted(set([s[a:b] for a in range(n) for b in range(a+1,n+2)])
gives me, alphabetically sorted sub strings with out repetitions
['A', 'AB', 'ABC', 'ABCC', 'B', 'BC', 'BCC', 'C', 'CC']
How can I further sort it by length of sub string.
['A', 'B', 'C', 'AB', 'BC', 'CC', 'ABC', 'BCC', 'ABCC']
simple,
sorted(set(s[a:b] for a in range(n) for b in range(a+1,n+1)),
key=lambda x:(len(x),x))
This creates a key by which the comparison is done. First it compares the string lengths to determine the order. If the strings have the same length, the tie-breaker is the string contents.
This is your solution:
s= "ABCC"
n = len(s)
sorted(sorted(set([s[a:b] for a in range(n) for b in range(a+1,n+2)])),key=len)
sorted. Upvoted.
sorted calls(ignore my last comment(deleted)), +1.