Sync LeetCode submission Runtime - 490 ms (66.59%), Memory - 18.4 MB (18.68%)

Author: jimit105

2059-unique-length-3-palindromic-subsequences/README.md

@@ -0,0 +1,51 @@
+<p>Given a string <code>s</code>, return <em>the number of <strong>unique palindromes of length three</strong> that are a <strong>subsequence</strong> of </em><code>s</code>.</p>
+
+<p>Note that even if there are multiple ways to obtain the same subsequence, it is still only counted <strong>once</strong>.</p>
+
+<p>A <strong>palindrome</strong> is a string that reads the same forwards and backwards.</p>
+
+<p>A <strong>subsequence</strong> 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.</p>
+
+<ul>
+	<li>For example, <code>&quot;ace&quot;</code> is a subsequence of <code>&quot;<u>a</u>b<u>c</u>d<u>e</u>&quot;</code>.</li>
+</ul>
+
+<p>&nbsp;</p>
+<p><strong class="example">Example 1:</strong></p>
+
+<pre>
+<strong>Input:</strong> s = &quot;aabca&quot;
+<strong>Output:</strong> 3
+<strong>Explanation:</strong> The 3 palindromic subsequences of length 3 are:
+- &quot;aba&quot; (subsequence of &quot;<u>a</u>a<u>b</u>c<u>a</u>&quot;)
+- &quot;aaa&quot; (subsequence of &quot;<u>aa</u>bc<u>a</u>&quot;)
+- &quot;aca&quot; (subsequence of &quot;<u>a</u>ab<u>ca</u>&quot;)
+</pre>
+
+<p><strong class="example">Example 2:</strong></p>
+
+<pre>
+<strong>Input:</strong> s = &quot;adc&quot;
+<strong>Output:</strong> 0
+<strong>Explanation:</strong> There are no palindromic subsequences of length 3 in &quot;adc&quot;.
+</pre>
+
+<p><strong class="example">Example 3:</strong></p>
+
+<pre>
+<strong>Input:</strong> s = &quot;bbcbaba&quot;
+<strong>Output:</strong> 4
+<strong>Explanation:</strong> The 4 palindromic subsequences of length 3 are:
+- &quot;bbb&quot; (subsequence of &quot;<u>bb</u>c<u>b</u>aba&quot;)
+- &quot;bcb&quot; (subsequence of &quot;<u>b</u>b<u>cb</u>aba&quot;)
+- &quot;bab&quot; (subsequence of &quot;<u>b</u>bcb<u>ab</u>a&quot;)
+- &quot;aba&quot; (subsequence of &quot;bbcb<u>aba</u>&quot;)
+</pre>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>3 &lt;= s.length &lt;= 10<sup>5</sup></code></li>
+	<li><code>s</code> consists of only lowercase English letters.</li>
+</ul>

2059-unique-length-3-palindromic-subsequences/solution.py

@@ -0,0 +1,21 @@
+# Approach 1: Count Letters In-Between
+
+# Time: O(n)
+# Space: O(1), letters and between cannot grow beyond a size of 26, since s only contains letters of the English alphabet.
+
+class Solution:
+    def countPalindromicSubsequence(self, s: str) -> int:
+        letters = set(s)
+        ans = 0
+
+        for letter in letters:
+            i, j = s.index(letter), s.rindex(letter)
+            between = set()
+
+            for k in range(i + 1, j):
+                between.add(s[k])
+
+            ans += len(between)
+
+        return ans
+