ShortEncodingofWords.java

class Solution {
    //O(n2)
    // SC:  O(n) , n of elements in words
    public int minimumLengthEncoding(String[] words) {

        // a b

        Set<String> wordSet = new HashSet<>(Arrays.asList(words));

        List<String> wordList = new ArrayList<>(wordSet);

        Set<String> dupList = new HashSet<>();


        for(int i=0;i<wordList.size();i++){
            for(int j=0;j<wordList.size();j++){
                if(i!=j){
                    if(wordList.get(i).endsWith(wordList.get(j))){
                        dupList.add(wordList.get(j));
                    }
                }
            }
        }


        int count = 0;
        for(String word: wordList){
            if(!dupList.contains(word)){
                count += word.length() +1;
            }
        }

        return count;


    }
}