Time: 44 ms (54.09%) | Memory: 45.6 MB (50.89%) - LeetSync

Author: yashksaini-coder

1371-find-the-longest-substring-containing-vowels-in-even-counts/find-the-longest-substring-containing-vowels-in-even-counts.java

@@ -0,0 +1,27 @@
+import java.util.HashMap;
+
+class Solution {
+    public int findTheLongestSubstring(String s) {
+        int n = s.length();
+        int mask = 0;
+        int maxLength = 0;
+        HashMap<Integer, Integer> m = new HashMap<>();
+        m.put(0, -1);
+        
+        for (int i = 0; i < n; i++) {
+            char c = s.charAt(i);
+            if (c == 'a') mask ^= (1 << 0);
+            else if (c == 'e') mask ^= (1 << 1);
+            else if (c == 'i') mask ^= (1 << 2);
+            else if (c == 'o') mask ^= (1 << 3);
+            else if (c == 'u') mask ^= (1 << 4);
+            
+            if (m.containsKey(mask)) {
+                maxLength = Math.max(maxLength, i - m.get(mask));
+            } else {
+                m.put(mask, i);
+            }
+        }
+        return maxLength;
+    }
+}