Search⌘ K
AI Features
Home
Courses
Grokking the Coding Interview Patterns

Palindrome Permutation

Explore how to check if a string's permutation can form a palindrome by tracking character frequencies efficiently. Understand the problem constraints and apply frequency-based logic to solve related coding challenges with hands-on practice.

We'll cover the following...

Statement

For a given string, st, find whether or not a permutation of this string is a palindromePalindrome is a string of characters that reads the same forwards and backwards. For example, “ababa” and “xyxxyx” are palindromes.. You should return TRUE if such a permutation is possible and FALSE if it isn’t possible.

Constraints:

  • 1≤1 \leq st.length ≤1000\leq 1000
  • The string will contain lowercase English letters.

Examples

Understand the problem

Let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps us to check if you’re solving the correct problem:

Palindrome Permutation

1.

The string “abb” has a permutation that’s a palindrome.

A.

TRUE

B.

FALSE

1 / 2

Figure it out!

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Sequence - Vertical
Drag and drop the cards to rearrange them in the correct sequence.
1
2
3
4

Try it yourself

Implement your solution in the following coding playground.

Java
usercode > Main.java
import java.util.*;





public class Main {

    public static boolean permutePalindrome(String st) {



        // Replace this placeholder return statement with your code

        return false;

    }

}
Palindrome Permutation