javaInterview | java interview summary | Frontend Utils library

Given a list of strings ["abc", "abcdb", "gggh", "klsrtabcabc", "118*90", "ggggggggggggggggggggggggggggggggg"]

Return words which contain all letters from [a,b,b,c].(This means words with, at least, 'a' one time, 'b' two times, and 'c' one time)

Answer: "abcdb", "klsrtabcabc"

This is the hashmap algorithm for this

1. Build a character frequency map from the list of required characters. E.g. for [a,b,b,c] you end up with {a=1, b=2, c=1}

2. Iterate the list of strings:

1. Build a character frequency map from the string. E.g. for "klsrtabcabc" you end up with {a=2, b=2, c=2, k=1, l=1, r=1, s=1, t=1}
2. Check if string has at least the required number of characters. E.g. since a: 2 >= 1, b: 2 >= 2, and c: 2 >= 1, the string is selected.
3. If selected, add the string to the result. 3. Return the list of results.

I converted the first step into java code as shown as below, can anyone help me with step 2 and 3?