Question 1

#include<bits/stdc++.h>
using namespace std;

bool canBePalindrome(string s) {
	unordered_map freq;
    
	// Count the frequency of each character in the string
	for (char c : s) {
    	freq[c]++;
	}

	int oddCount = 0;

	// Count how many characters have an odd frequency
	for (auto it : freq) {
    	if (it.second % 2 != 0) {
        	oddCount++;
    	}
	}

	// For a string to be a palindrome, it can have at most one character with an odd frequency
	return oddCount <= 1;
}

int main() {
	int T;
	cin >> T;

	while (T--) {
    	string s;
    	cin >> s;

    	if (canBePalindrome(s)) {
        	cout << "Yes" << endl;
    	} else {
        	cout << "No" << endl;
    	}
	}

	return 0;
}

Run

def can_be_palindrome(s):
	freq = {}
    
	for char in s:
    	freq[char] = freq.get(char, 0) + 1

	odd_count = 0

	for count in freq.values():
    	if count % 2 != 0:
        	odd_count += 1

	return odd_count <= 1

T = int(input())
for _ in range(T):
	s = input()
	if can_be_palindrome(s):
    	print("Yes")
	else:
    	print("No")

import java.util.*;

class Main {
	public static boolean canBePalindrome(String s) {
    	Map freq = new HashMap<>();
   	 
    	// Count the frequency of each character in the string
    	for (char c : s.toCharArray()) {
        	freq.put(c, freq.getOrDefault(c, 0) + 1);
    	}

    	int oddCount = 0;

    	// Count how many characters have an odd frequency
    	for (int count : freq.values()) {
        	if (count % 2 != 0) {
            	oddCount++;
        	}
    	}

    	// For a string to be a palindrome, it can have at most one character with an odd frequency
    	return oddCount <= 1;
	}

	public static void main(String[] args) {
    	Scanner sc = new Scanner(System.in);
    	int T = sc.nextInt();
    	sc.nextLine(); // Consume the newline character

    	while (T-- > 0) {
        	String s = sc.nextLine();

        	if (canBePalindrome(s)) {
            	System.out.println("Yes");
        	} else {
            	System.out.println("No");
        	}
    	}
	}
}