EASY JAVA  CODE
ApproachUsing the fact that odd frequency characters count control the palindromes countComplexity
Time complexity: O(n)

Space complexity: O(26) ~ O(1)
Code
# Approach
<!-- Describe your approach to solving the problem. -->
Using the fact that odd frequency characters count control the palindromes count

# Complexity
- Time complexity: O(n)
<!-- Add your time complexity here, e.g. $$O(n)$$ -->

- Space complexity: O(26) ~ O(1)
<!-- Add your space complexity here, e.g. $$O(n)$$ -->

# Code
```java []
class Solution {
    public boolean canConstruct(String s, int k) {
        int n = s.length(); 
        if(n < k)
         return false;
        if(n == k) 
         return true;
        //find freq
        int count[] = new int[26];
        for(int i=0;i<n;i++){
            count[s.charAt(i) - 'a']++;
        }
        int c=0;
        //find odd count
        for(int i=0;i<26;i++){
            if((count[i]&1)==1) c++;
        }
        return (c<=k);
    }
}
```
['Java']