Merge pull request neetcode-gh#1995 from gnohgnij/1930-unique-3-length-palindromic-subsequences

tahsintunan · web-flow · commit 0bcecc74cc23 · 2023-01-11T23:18:17.000+06:00
Create: 1930-unique-3-length-palindromic-subsequences.java
diff --git a/java/1930-unique-3-length-palindromic-subsequences.java b/java/1930-unique-3-length-palindromic-subsequences.java
@@ -0,0 +1,32 @@
+class Solution {
+    public int countPalindromicSubsequence(String s) {
+        char[] letters = new char[]{'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k',
+                                    'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 
+                                    'w', 'x', 'y', 'z'};
+        Set<Character> left = new HashSet<>();
+        Map<Character, Integer> right = new HashMap<>();
+        for(char c : s.toCharArray()) {
+            right.put(c, right.getOrDefault(c, 0) + 1);
+        }
+        Set<String> res = new HashSet<>();
+
+        for(int mid = 0; mid < s.length(); mid++) {
+            char c = s.charAt(mid);
+            
+            right.put(c, right.get(c)-1);
+            if(right.get(c) == 0) {
+                right.remove(c);
+            }
+
+            for(int i=0; i<26; i++) {
+                if(left.contains(letters[i]) && right.containsKey(letters[i])) {
+                    res.add("" + letters[i] + c + letters[i]);
+                }
+            }
+
+            left.add(c);
+        }
+
+        return res.size();
+    }
+}
