Unique Length 3 Palindromic Subsequences - Leetcode 1930 - Python
NeetCodeIO · 11:57
NeetCode solves LeetCode's "Unique Length-3 Palindromic Subsequences" in linear time by treating each character as the middle of a palindrome. He keeps a set of the characters to its left and a count map of the charac...