Class Solution

  • All Implemented Interfaces:

    
    public final class Solution
    
                        

    1542 - Find Longest Awesome Substring\.

    Hard

    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.

    Example 1:

    Input: s = "3242415"

    Output: 5

    Explanation: "24241" is the longest awesome substring, we can form the palindrome "24142" with some swaps.

    Example 2:

    Input: s = "12345678"

    Output: 1

    Example 3:

    Input: s = "213123"

    Output: 6

    Explanation: "213123" is the longest awesome substring, we can form the palindrome "231132" with some swaps.

    Constraints:

    • <code>1 <= s.length <= 10<sup>5</sup></code>

    • s consists only of digits.

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description
    • Field Summary

      Fields 
      Modifier and Type Field Description
    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()
    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description
    • Method Summary

      Modifier and Type Method Description
      final Integer longestAwesome(String s)
      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait