#1400

Construct K Palindrome Strings

pupil · 585 · lc medium +29 · verified · 68.6% accepted · 1,793 likes · top 76%

Description

Given a string s and integer k, determine whether all characters of s can be distributed to form exactly k non-empty palindromes (using every character exactly once). Return true if possible, 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.

Example 3:

Input: s = "true", k = 4

Output: true

Explanation: The only possible solution is to put each character in a separate string.

Code

1

2

3

class Solution:
    def canConstruct(self, s: str, k: int) -> bool:

class Solution:
    def canConstruct(self, s: str, k: int) -> bool: