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

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

|1630|[Arithmetic Subarrays](https://leetcode.com/problems/arithmetic-subarrays/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1630.java)||Medium|Sort|

|1629|[Slowest Key](https://leetcode.com/problems/slowest-key/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1629.java)||Easy|Array|

|1626|[Best Team With No Conflicts](https://leetcode.com/problems/best-team-with-no-conflicts/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1626.java)||Medium|DP|

|1625|[Lexicographically Smallest String After Applying Operations](https://leetcode.com/problems/lexicographically-smallest-string-after-applying-operations/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1625.java)||Medium|BFS, DFS|

|1624|[Largest Substring Between Two Equal Characters](https://leetcode.com/problems/largest-substring-between-two-equal-characters/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1624.java)||Easy|String|

packagecom.fishercoder.solutions;

importjava.util.ArrayList;

importjava.util.Collections;

importjava.util.HashMap;

importjava.util.List;

importjava.util.Map;

publicclass_1629 {

publicstaticclassSolution1 {

publiccharslowestKey(int[]releaseTimes,StringkeysPressed) {

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

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

charc =keysPressed.charAt(i);

intduration;

if (i ==0) {

duration =releaseTimes[i];

}else {

duration =releaseTimes[i] -releaseTimes[i -1];

}

if (!map.containsKey(c)) {

map.put(c,duration);

}else {

intval =map.get(c);

if (duration >val) {

map.put(c,duration);

}

}

}

Map<Integer,List<Character>>map2 =newHashMap<>();

for (charc :map.keySet()) {

intduration =map.get(c);

if (!map2.containsKey(duration)) {

map2.put(duration,newArrayList<>());

}

map2.get(duration).add(c);

}

intmax = -1;

for (intduration :map2.keySet()) {

List<Character>chars =map2.get(duration);

Collections.sort(chars);

map2.put(duration,chars);

max =Math.max(max,duration);

}

returnmap2.get(max).get(map2.get(max).size() -1);

}

}

}