You are viewing a single comment's thread. Return to all comments →
please explain !
I used string array instead of character array for alphabets.So there is a contains method in string.If this methos contains this character I increment count1.If count1 equals String arr.length that time it has all characters that time I increment count2.Finally it returns count2 that means how many words have characters.
what's the time complexity of your soln ?