Xuanken Tay

Software engineer who likes statistics, machine learning, DevOps and the cloud

less than 1 minute read

Given a string s, determine whether any anagram of s is a palindrome.

Constraints

  • n ≤ 100,000 where n is the length of s

https://binarysearch.com/problems/Palindromic-Anagram

Examples

Example 1

Input

  • s = carrace

Output

  • answer = True

Explanation

"carrace" should return true, since it can be rearranged to form "racecar", which is a palindrome.

Solution

Leave a comment

Read more

Anagram Substrings

less than 1 minute read

Given two strings s0 and s1, return the number of substrings where s1 contains any anagram of s0.

Characters in Each Bracket Depth

1 minute read

You are a given a string s containing "X", "(", and ")". The string has balanced brackets and in between there are some "X"s along with possibly nested brack...

Anagram Checks

less than 1 minute read

Given two strings s0 and s1, return whether they are anagrams of each other.

Word Formation

1 minute read

Given a list of strings words and a string letters, return the length of longest string in words that can be made from letters in letters. If no word can be ...