add 3545

Author: fishercoder1534

paginated_contents/algorithms/4th_thousand/README.md

@@ -78,6 +78,7 @@
 | 3581 | [Count Odd Letters from Number](https://leetcode.com/problems/count-odd-letters-from-number/)                                                              | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3581.java) |                                                                               | Easy       | 
 | 3569 | [Count Islands With Total Value Divisible by K](https://leetcode.com/problems/count-islands-with-total-value-divisible-by-k/)                                                              | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3569.java) |                                                                               | Medium     | Union Find
 | 3550 | [Smallest Index With Digit Sum Equal to Index](https://leetcode.com/problems/smallest-index-with-digit-sum-equal-to-index/)                                                              | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3550.java) |                                                                               | Easy       |
+| 3545 | [Minimum Deletions for At Most K Distinct Characters](https://leetcode.com/problems/minimum-deletions-for-at-most-k-distinct-characters/)                                                              | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3545.java) |                                                                               | Easy       |
 | 3516 | [Find Closest Person](https://leetcode.com/problems/find-closest-person/)                                                              | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3516.java) |                                                                               | Easy       |
 | 3507 | [Minimum Pair Removal to Sort Array I](https://leetcode.com/problems/minimum-pair-removal-to-sort-array-i/)                                                              | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3507.java) |                                                                               | Easy       |
 | 3502 | [Minimum Cost to Reach Every Position](https://leetcode.com/problems/minimum-cost-to-reach-every-position/)                                                              | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3502.java) |                                                                               | Easy       |

src/main/java/com/fishercoder/solutions/fourththousand/_3545.java

@@ -0,0 +1,27 @@
+package com.fishercoder.solutions.fourththousand;
+
+import java.util.*;
+
+public class _3545 {
+    public static class Solution1 {
+        public int minDeletion(String s, int k) {
+            Map<Character, Integer> map = new HashMap<>();
+            for (char c : s.toCharArray()) {
+                map.put(c, map.getOrDefault(c, 0) + 1);
+            }
+            List<Integer> frequencies = new ArrayList<>();
+            for (char c : map.keySet()) {
+                frequencies.add(map.get(c));
+            }
+            if (frequencies.size() <= k) {
+                return 0;
+            }
+            Collections.sort(frequencies);
+            int deletions = 0;
+            for (int i = 0; i < frequencies.size() && (frequencies.size() - i) > k; i++) {
+                deletions += frequencies.get(i);
+            }
+            return deletions;
+        }
+    }
+}

src/test/java/com/fishercoder/fourththousand/_3545Test.java

@@ -0,0 +1,41 @@
+package com.fishercoder.fourththousand;
+
+import com.fishercoder.solutions.fourththousand._3545;
+import org.junit.jupiter.api.BeforeEach;
+import org.junit.jupiter.api.Test;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+
+public class _3545Test {
+    private _3545.Solution1 solution1;
+
+    @BeforeEach
+    public void setup() {
+        solution1 = new _3545.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(1, solution1.minDeletion("abc", 2));
+    }
+
+    @Test
+    public void test2() {
+        assertEquals(0, solution1.minDeletion("aabb", 2));
+    }
+
+    @Test
+    public void test3() {
+        assertEquals(2, solution1.minDeletion("yyyzz", 1));
+    }
+
+    @Test
+    public void test4() {
+        assertEquals(2, solution1.minDeletion("adx", 1));
+    }
+
+    @Test
+    public void test5() {
+        assertEquals(3, solution1.minDeletion("wund", 1));
+    }
+}