Leetcode 1400. Construct K Palindrome Strings
Determine whether the characters of s can be partitioned into k non-empty palindromic strings using all letters. This reduces to a frequency/parity check: it's possible iff the number of characters with odd counts is ≤ k and k ≤ |s|.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Hello Interview Premium
Your account is free and you can post anonymously if you choose.