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

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

| 3238|[Find the Number of Winning Players](https://leetcode.com/problems/find-the-number-of-winning-players/)|[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3238.java)|| Easy|

| 3237|[Alt and Tab Simulation](https://leetcode.com/problems/alt-and-tab-simulation/)|[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3237.java)|| Medium|

| 3234 |[Count the Number of Substrings With Dominant Ones](https://leetcode.com/problems/count-the-number-of-substrings-with-dominant-ones/) |[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3234.java) | | Medium | Sliding Window

| 3233 |[Find the Count of Numbers Which Are Not Special](https://leetcode.com/problems/find-the-count-of-numbers-which-are-not-special/) |[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3233.java) | | Medium | Math

packagecom.fishercoder.solutions.fourththousand;

importjava.util.HashMap;

importjava.util.Map;

publicclass_3238 {

publicstaticclassSolution1 {

publicintwinningPlayerCount(intn,int[][]pick) {

intwinners =0;

Map<Integer,int[]>map =newHashMap<>();

for (int[]p :pick) {

intplayer =p[0];

intcolor =p[1];

int[]colors =map.getOrDefault(player,newint[11]);

colors[color]++;

map.put(player,colors);

}

for (Map.Entry<Integer,int[]>entry :map.entrySet()) {

intplayer =entry.getKey();

int[]colors =entry.getValue();

for (intc :colors) {

if (c >=player +1) {

winners++;

break;

}

}

}

returnwinners;

}

}

}