Package g1301_1400.s1400_construct_k_palindrome_strings

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    1400 - Construct K Palindrome Strings\.

    Medium

    Given a string s and an integer k, return true if you can use all the characters in s to construct k palindrome strings or 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.

    Constraints:

    • <code>1 <= s.length <= 10<sup>5</sup></code>

    • s consists of lowercase English letters.

    • <code>1 <= k <= 10<sup>5</sup></code>

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Boolean canConstruct(String s, Integer k)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait