DSA Unknown Unknown Unknown Find Longest Awesome Substring

Find Longest Awesome Substring

easy

Unknown

Question Solve Solutions

You are given a string s. An awesome substring is a non-empty substring of s such that we can make any number of swaps in order to make it a palindrome.

Return the length of the maximum length awesome substring of s.

Input Format

String str

Output Format

Integer n

Constraints

1 &lt;= s.length &lt;= 10^5
s consists only of digits.

Notice

NA

Example

Input

Output

Find The Longest Substring Containing Vowels In Even Counts

First Non Repeated Character

Related Questions

easy Is Prime easy Prime Till N easy Reverse Integer easy GCD easy Fibonacci easy Fib Till N easy Exit Point of a matrix easy Placing N Queen in a matrix easy Arranging Vowels And Consonants easy Addition Of Two Linked List easy Circular Linked List easy Sort The Absolute List easy Decimal Number From Binary Linked List easy Find the largest rectangle in a matrix easy Count Pairs Having Sum X easy Delete alternate nodes of linked list