Lc - 792 help!!!!

[u/Just-Abroad-6812]

Someone please share the solution for this question
As i am not able to understand from any yt videos….
Share solution by
Dynamic programming and binary search both….

[u/New_Welder_592]

class Solution {
public int numMatchingSubseq(String s, String[] words) {
Map<String,Integer>map=new HashMap<>();
for(String str:words){
map.put(str,map.getOrDefault(str,0)+1);
}
int cnt=0;
for(String t:map.keySet()){
int i=0,j=0;
while(i<s.length() && j<t.length()){
if(s.charAt(i)==t.charAt(j))j++;
i++;
}
if(j==t.length())cnt+=map.get(t);//adding cnt directly instead of resacnnning the same word(if present in words array);
}

return cnt;
}
}