Available question text
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|.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1400. Construct K Palindrome Strings
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source