26. Word Subsets

class Solution {
    public List<String> wordSubsets(String[] A, String[] B) {
        List<String> result = new ArrayList<>();
        
        int[] target = new int[26];
        
        for(String b:B){
            int[] temp=new int[26];
            
            for(char c:b.toCharArray()){
                temp[c-'a']++;
                target[c-'a'] = Math.max(target[c-'a'],temp[c-'a']);
            }
        }
        
        for(String a:A){
            int[] arr=new int[26];
            
            for(char c:a.toCharArray()) arr[c-'a']++;
            
            if(subset(arr,target)){
                result.add(a);
            }
        }
        
        return result;
    }
    
    private boolean subset(int[] source,int[] dest){
        for(int i=0;i<26;i++){
            if(dest[i]>source[i]) return false;
        }
        return true;
    }
}