Java || 3ms || 100 %beat use Frequency Array || 
IntuitionApproachget frequence Count the odd number and compare to k return AnsewerComplexity

Time complexity:
o(2*n)


Space complexity:
o(n)

Code
# Intuition

# Approach
get frequence Count the odd number and compare to k return Ansewer
# Complexity
- Time complexity:
o(2*n)

- Space complexity:
o(n)

# Code
```java []
class Solution {
    public boolean canConstruct(String s, int k) {
        if(s.length()<k) return false;
        int[] arr=new int[26];
        int cnt_odd=0;
        for(char i:s.toCharArray()){
            arr[i-'a']++;
            
        }
        for(int i:arr){
            if(i>0){
                if(i%2!=0)cnt_odd++;
            }
        }
        if(cnt_odd>k)return false;
        return true;
        
    }
}
```
['Hash Table', 'String', 'Counting Sort', 'Java']