Jan 11

Author: siddydutta

2025-01-January-LeetCoding-Challenge/Construct K Palindrome Strings.py

@@ -0,0 +1,27 @@
+from collections import Counter
+
+
+class Solution:
+    def canConstruct(self, s: str, k: int) -> bool:
+        if k > len(s):
+            return False
+        n_odds = sum(c & 1 for c in Counter(s).values())
+        return n_odds <= k
+
+
+def main():
+    s = 'annabelle'
+    k = 2
+    assert Solution().canConstruct(s, k) is True
+
+    s = 'leetcode'
+    k = 3
+    assert Solution().canConstruct(s, k) is False
+
+    s = 'true'
+    k = 4
+    assert Solution().canConstruct(s, k) is True
+
+
+if __name__ == '__main__':
+    main()

2025-01-January-LeetCoding-Challenge/README.md

@@ -13,7 +13,7 @@
 | January 8  | [3042. Count Prefix and Suffix Pairs I](https://leetcode.com/problems/count-prefix-and-suffix-pairs-i/) | Easy | Solved |
 | January 9  | [2185. Counting Words With a Given Prefix](https://leetcode.com/problems/counting-words-with-a-given-prefix/) | Easy | Solved |
 | January 10 | [916. Word Subsets](https://leetcode.com/problems/word-subsets/) | Medium | Solved |
-| January 11 | []() |  |  |
+| January 11 | [1400. Construct K Palindrome Strings](https://leetcode.com/problems/construct-k-palindrome-strings/) | Medium | Solved |
 | January 12 | []() |  |  |
 | January 13 | []() |  |  |
 | January 14 | []() |  |  |
@@ -40,5 +40,5 @@
 | Level  | Problems | Solved | Unsolved |
 | ---    | --- | --- | --- |
 | Easy   | 4 | 4 | 0 |
-| Medium | 6 | 6 | 0 |
+| Medium | 7 | 7 | 0 |
 | Hard   | 0 | 0 | 0 |