| # | Title | Solutions | Video | Difficulty | Tag

|-----|----------------|---------------|--------|-------------|-------------

|2080|[Range Frequency Queries](https://leetcode.com/problems/range-frequency-queries/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2080.java)||Medium|Array, Binary Seaarch|

|2085|[Count Common Words With One Occurrence](https://leetcode.com/problems/count-common-words-with-one-occurrence/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2085.java)||Easy||

|2080|[Range Frequency Queries](https://leetcode.com/problems/range-frequency-queries/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2080.java)||Medium|Array, Binary Search|

|2079|[Watering Plants](https://leetcode.com/problems/watering-plants/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2079.java)||Medium||

|2078|[Two Furthest Houses With Different Colors](https://leetcode.com/problems/two-furthest-houses-with-different-colors/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2078.java)||Easy||

|2076|[Process Restricted Friend Requests](https://leetcode.com/problems/process-restricted-friend-requests/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2076.java)||Hard||

packagecom.fishercoder.solutions;

importjava.util.HashMap;

importjava.util.Map;

publicclass_2085 {

publicstaticclassSolution1 {

publicintcountWords(String[]words1,String[]words2) {

Map<String,Integer>map1 =newHashMap<>();

Map<String,Integer>map2 =newHashMap<>();

for (Stringword :words1) {

map1.put(word,map1.getOrDefault(word,0) +1);

}

for (Stringword :words2) {

map2.put(word,map2.getOrDefault(word,0) +1);

}

intans =0;

for (Stringkey :map1.keySet()) {

if (map1.get(key) ==1 &&map2.containsKey(key) &&map2.get(key) ==1) {

ans++;

}

}

returnans;

}

}

}