Package g1301_1400.s1332_remove_palindromic_subsequences

Class Solution

java.lang.Object
g1301_1400.s1332_remove_palindromic_subsequences.Solution
public class Solution extends java.lang.Object
1332 - Remove Palindromic Subsequences.

Easy

You are given a string s consisting only of letters 'a' and 'b'. In a single step you can remove one palindromic subsequence from s.

Return the minimum number of steps to make the given string empty.

A string is a subsequence of a given string if it is generated by deleting some characters of a given string without changing its order. Note that a subsequence does not necessarily need to be contiguous.

A string is called palindrome if is one that reads the same backward as well as forward.

Example 1:

Input: s = “ababa”

Output: 1

Explanation: s is already a palindrome, so its entirety can be removed in a single step.

Example 2:

Input: s = “abb”

Output: 2

Explanation: “abb” -> “bb” -> "". Remove palindromic subsequence “a” then “bb”.

Example 3:

Input: s = “baabb”

Output: 2

Explanation: “baabb” -> “b” -> "". Remove palindromic subsequence “baab” then “b”.

Constraints:

  • 1 <= s.length <= 1000
  • s[i] is either 'a' or 'b'.

  • Constructor Summary

    Constructors
    Constructor
    Description
    Solution()
     

  • Method Summary

    Modifier and Type
    Method
    Description
    int
    removePalindromeSub(java.lang.String s)
     

    Methods inherited from class java.lang.Object

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

  • Constructor Details

    • Solution

      public Solution()

  • Method Details

    • removePalindromeSub

      public int removePalindromeSub(java.lang.String s)