Practice Unique Length-3 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.
Unique Length-3 Palindromic Subsequences
Problem Statement
Given a string s, return the number of unique palindromes of length three that are a subsequence of s. Note that even if there are multiple ways to obtain the same subsequence, it is still only counted once. A palindrome is a string that reads the same forwards and backwards. A subsequence of a string is a new string generated from the original string with some characters (can be none) deleted without changing the relative order of the remaining characters.
Source: Unique Length-3 Palindromic Subsequences on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
s = "aabca"
3
# Example 2
s = "adc"
0
# Example 3
s = "bbcbaba"
4
Constraints
Related LeetCode Problems
Practice more problems similar to Unique Length-3 Palindromic Subsequences.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.