Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 1400 with 22 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 1400 # by problem number
lcpy gen -s construct_k_palindrome_strings # by problem name
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.
Input: s = "annabelle", k = 2
Output: true
s. Some possible constructions "anna" + "elble", "anbna" + "elle", "anellena" + "b".
Input: s = "leetcode", k = 3
Output: false
s.
Input: s = "true", k = 4
Output: true
1 <= s.length <= 10^5s consists of lowercase English letters.1 <= k <= 10^5from collections import Counter
class Solution:
# Time: O(n)
# Space: O(1)
def can_construct(self, s: str, k: int) -> bool:
odd = sum(count % 2 for count in Counter(s).values())
return odd <= k <= len(s)
| Time | Space |
|---|---|
| O(n) | O(1) |