Construct K Palindrome Strings
Given a string s and an integer k, return true if you can use all the characters in s to construct non-empty k palindrome strings, or false otherwise.
Example 1
Input
s = "annabelle", k = 2Output
trueYou can construct two palindromes using all characters in
s, such as "anna" + "elble".Example 2
Input
s = "leetcode", k = 3Output
falseIt is impossible to construct 3 palindromes using all the characters of
s.Constraints
- 1 <= s.length <= 10^5
- s consists of lowercase English letters.
- 1 <= k <= 10^5