Unique Length-3 Palindromic Subsequences

Given a string s, return the number of unique non-empty palindromic subsequences of length 3 that can be formed from s. A subsequence is a sequence that can be derived from another sequence by deleting some or no elements without changing the order of the remaining elements.