Services
Technology Web App Development Mobile App Development Windows App Development Database Development UI/UX Development Cloud Development SEO Digital Marketing Guest Posting Content Writing Artificial Intelligence Data Science ERP Development CRM Development CMS Development LMS Development Business Listing Blockchain Technology Startup Promotion AI Tools Integration
Products
Data Converter Cleaner TUC - Unit Converter Import Export Survey Manager Tweet Controller
Developer
Article Blog Forum Interview Beginner News Startup Quiz
Users
Career
Apply Job Internship
Pricing
Login Sign Up Get a Quote

forum

home / developersection / forums / write a program to check if a given string is a valid palindrome permutation.
Ask Question
Revati S Misra
Revati S Misra

Student

Skilled in SEO, content writing, and digital marketing. Completed several years of working in many organizations including multinational companies. I love to learn new things in life that keep me motivated.

Message

1 Answers

Aryan Kumar
Aryan Kumar 24 Apr 2023
Report Abuse 
public class PalindromePermutation {
   public static void main(String[] args) {
       String str = "Tact Coa"; // input string
       
       // convert the input string to lowercase and remove all spaces
       str = str.toLowerCase().replaceAll("\\s+", "");
       
       // create an array to count the frequency of each character
       int[] charCount = new int[128]; // assume ASCII character set
       
       // count the frequency of each character in the input string
       for (int i = 0; i < str.length(); i++) {
           charCount[str.charAt(i)]++;
       }
       
       // count the number of characters with odd frequency
       int oddCount = 0;
       for (int i = 0; i < charCount.length; i++) {
           if (charCount[i] % 2 != 0) {
               oddCount++;
           }
       }
       
       // if the input string is a palindrome permutation, it should have at most one character with odd frequency
       if (oddCount > 1) {
           System.out.println("Not a valid palindrome permutation");
       } else {
           System.out.println("Valid palindrome permutation");
       }
   }
}

This program first converts the input string to lowercase and removes all spaces. It then creates an array to count the frequency of each character in the input string. If the input string is a valid palindrome permutation, it should have at most one character with odd frequency. The program counts the number of characters with odd frequency and outputs whether or not the input string is a valid palindrome permutation. In the example input string above, "Tact Coa" is a valid palindrome permutation because it can be rearranged to form "taco cat".

advertising