Min Set of Strings

#1

Can you please explain me the question and provide with it’s implementation as well ?

#2

@aman2382000 you will be given a set of strings where each string will be made of a b or c like aab,aba,abc,a,bc anything. each string has a cost which will be counted if u choose this.we have to find a subset which
1 )costs us minimum
like in sample test case
5
abc ab a b c
we could incl a,b,c from the 1st string which cost us 1

2)has in total all three a,b,c
for example if the input was
3
a b c
1 1 1
we d have to take all three strings and ans wd be 3

try to implement thiss