Jan11 2025 DC.java

/*1400. Construct K Palindrome Strings*/

import java.util.Arrays;

class Solution {
    public boolean canConstruct(String s, int k) {
        if (s.length() < k) return false;
        char[] chars = s.toCharArray();
        Arrays.sort(chars);
        int oddCount = 0;
        for (int i = 0; i < chars.length; ) {
            char current = chars[i];
            int count = 0;
            while (i < chars.length && chars[i] == current) {
                count++;
                i++;
            }
            if (count % 2 != 0) oddCount++;
        }
        return oddCount <= k;
    }
}