- 0of 0 votes
Given a list of characters, write a function to output a list of length of minimum non overlapping subsequences that can partition the input list.
Input : [a,b,c]
Explanation: There are no repeated characters.
Input : [a,b,c,a]
Explanation: The 'a' is repeated so one subsequence is between a to last a.
Input : [a,b,c,b,a,e,b,a,d,f,g,d,f,i,f,k,l,m,n,m,l]
Explanation: max length from 1st 'a' to last 'a' is 8.
1st 'f' to last is 6 adding d to it = 7