Problem 1930 · Medium

Unique Length-3 Palindromic Subsequences

Count distinct palindromes of length three that appear as subsequences of a string. The visual checks each outer letter pair against the first and last occurrence windows and marks the middle letters found between them.

Open the interactive visualisation