22. Longest Word in Dictionary through Deleting

class Solution {
    public String findLongestWord(String s, List<String> d) {
        String result = "";
        d.sort((String a, String b) -> 
               a.length() == b.length() ? a.compareTo(b) : b.length() - a.length());
        for(String str : d) {
            if(isSubsequence(s, str)) return result = str;
        }
        return result;
    }
    
    public boolean isSubsequence(String S, String D) {
        int i = 0, j = 0;
        if(D.length() > S.length()) return false;
        while(i < S.length() && j < D.length()) {
            if(S.charAt(i) == D.charAt(j)) j++;
            i++;
        }
        return j == D.length();
    }
}

class Solution {
    public String findLongestWord(String s, List<String> d) {
        String result = "";
        
        for(String str : d) {
            if(isSubsequence(s, str) ) {
                //Length str > result || length is equal but str is lexicographically small. 
                if(str.length() > result.length() || (str.length() == result.length() && str.compareTo(result) < 1))
                result = str;
            }
        }
        return result;
    }
    
    public boolean isSubsequence(String S, String D) {
        int i = 0, j = 0;
        if(D.length() > S.length()) return false;
        while(i < S.length() && j < D.length()) {
            if(S.charAt(i) == D.charAt(j)) j++;
            i++;
        }
        return j == D.length();
    }
}