Find the smallest subarray covering all values

[programmer99]

In the java solution we have:

 Map<String, Integer> keywordsToCover = new HashMap<>();
    for (String keyword : keywords) {
        keywordsToCover.put(keyword,
                keywordsToCover.containsKey(keyword)
                        ? keywordsToCover.get(keyword) + 1
                        : 1);
    }

why not just have this as the for loop?

  Map<String, Integer> keywordsToCover = new HashMap<>();
    for (String keyword : keywords) {
        keywordsToCover.put(keyword, 1);
    }

[tsunghsienlee]

It is different operations on the Map, what yours cannot handle the situation when there are multiple keywords are the same.

[fondant]

But the argument you pass in is a Set, not a List of keywords:
Set keywords
You can’t have multiple keywords that are the same.

[tsunghsienlee]

I forgot that is a set so definitely it is fine to do the for loop directly. We rewrite that in Java 8 stream recently.