Can Construct K Palindrome Strings From Given String
Construct K Palindrome Strings: Use hash table to count char frequencies & odd counts. If k > len(s) or odd counts > k, return false. Otherwise, true.
1400. Construct K Palindrome Strings Difficulty: Medium Topics: Hash Table, String, Greedy, Counting Given a string s and an integer k, return true if you can use all the characters in s to construct k palindrome strings or false otherwise. Example 1: Input: s = "annabelle", k = 2 Output: true Explanation: You can construct two palindromes using all characters in s. Some possible constructions "anna" + "elble", "anbna" + "elle", "anellena" + "b" Example 2: Input: s = "leetcode", k = 3 Output: false Explanation: It is impossible to construct 3 palindromes using all the characters of s. E...