Available question text
Given a string s containing only 'a' and 'b', find the minimum number of palindromic subsequence removals (subsequences need not be contiguous) required to delete all characters. Because subsequences can pick all identical letters, the answer is 0 if s is empty, 1 if s is itself a palindrome, and otherwise 2.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1332. Remove Palindromic Subsequences
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source