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

|1774|[Closest Dessert Cost](https://leetcode.com/problems/closest-dessert-cost/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1774.java)||Medium|Greedy|

|1773|[Count Items Matching a Rule](https://leetcode.com/problems/count-items-matching-a-rule/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1773.java)||Easy|Array, String|

|1772|[Sort Features by Popularity](https://leetcode.com/problems/sort-features-by-popularity/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1772.java)||Medium|HashTable, Sort|

|1769|[Minimum Number of Operations to Move All Balls to Each Box](https://leetcode.com/problems/minimum-number-of-operations-to-move-all-balls-to-each-box/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1769.java)||Medium|Array, Greedy|

|1768|[Merge Strings Alternately](https://leetcode.com/problems/merge-strings-alternately/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1768.java)||Easy|String|

|1765|[Map of Highest Peak](https://leetcode.com/problems/map-of-highest-peak/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1765.java)||Medium|BFS, Graph|

packagecom.fishercoder.solutions;

importjava.util.Arrays;

importjava.util.HashMap;

importjava.util.HashSet;

importjava.util.Map;

importjava.util.PriorityQueue;

importjava.util.Set;

publicclass_1772 {

publicstaticclassSolution1 {

publicString[]sortFeatures(String[]features,String[]responses) {

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

for (inti =0;i <features.length;i++) {

map.put(features[i],i);

}

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

for (Stringresponse :responses) {

Set<String>strs =newHashSet(Arrays.asList(response.split(" ")));

for (Stringstr :strs) {

if (map.containsKey(str)) {

countMap.put(str,countMap.getOrDefault(str,0) +1);

}

}

}

PriorityQueue<Node>maxHeap =newPriorityQueue<>((a,b) ->a.freq !=b.freq ?b.freq -a.freq :a.index -b.index);

for (Stringkey :map.keySet()) {

maxHeap.offer(newNode(key,countMap.getOrDefault(key,0),map.get(key)));

}

String[]result =newString[features.length];

inti =0;

while (!maxHeap.isEmpty()) {

result[i++] =maxHeap.poll().word;

}

returnresult;

}

classNode {

Stringword;

Integerfreq;

Integerindex;

publicNode(Stringword,Integerfreq,Integerindex) {

this.word =word;

this.freq =freq;

this.index =index;

}

}

}

}

packagecom.fishercoder;

importcom.fishercoder.solutions._1772;

importorg.junit.BeforeClass;

importorg.junit.Test;

importstaticorg.junit.Assert.assertArrayEquals;

publicclass_1772Test {

privatestatic_1772.Solution1solution1;

publicstaticvoidsetup() {

solution1 =new_1772.Solution1();

}

publicvoidtest1() {

assertArrayEquals(newString[]{"touch","cooler","lock"},

solution1.sortFeatures(newString[]{"cooler","lock","touch"},newString[]{"i like cooler cooler","lock touch cool","locker like touch"}));

}

publicvoidtest2() {

assertArrayEquals(newString[]{"a","aa","b","c"},

solution1.sortFeatures(newString[]{"a","aa","b","c"},newString[]{"a","a aa","a a a a a","b a"}));

}

}