Skip to content

Practice Remove Palindromic Subsequences

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Easy#1332
LeetCode Problem

Remove Palindromic Subsequences

Two PointersString

Problem Statement

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.

Source: Remove Palindromic Subsequences on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input
s = "ababa"
Output
1

# Example 2

Input
s = "abb"
Output
2

# Example 3

Input
s = "baabb"
Output
2

Constraints

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

Related LeetCode Problems

Practice more problems similar to Remove Palindromic Subsequences.

5 Longest Palindromic Substring Medium28 Find the Index of the First Occurrence in a String Easy3 Longest Substring Without Repeating Characters Medium6 Zigzag Conversion Medium8 String to Integer (atoi) Medium
← Previous Rank Transform of an ArrayNext → Filter Restaurants by Vegan-Friendly, Price and Distance

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.

Start Free