Jan 14

Author: siddydutta

2025-01-January-LeetCoding-Challenge/Find the Prefix Common Array of Two Arrays.py

@@ -0,0 +1,31 @@
+from typing import List
+
+
+class Solution:
+    def findThePrefixCommonArray(self, A: List[int], B: List[int]) -> List[int]:
+        C, count, seen = [], 0, set()
+        for a, b in zip(A, B):
+            if a in seen:
+                count += 1
+            else:
+                seen.add(a)
+            if b in seen:
+                count += 1
+            else:
+                seen.add(b)
+            C.append(count)
+        return C
+
+
+def main():
+    A = [1, 3, 2, 4]
+    B = [3, 1, 2, 4]
+    assert Solution().findThePrefixCommonArray(A, B) == [0, 2, 3, 4]
+
+    A = [2, 3, 1]
+    B = [3, 1, 2]
+    assert Solution().findThePrefixCommonArray(A, B) == [0, 1, 3]
+
+
+if __name__ == '__main__':
+    main()

2025-01-January-LeetCoding-Challenge/README.md

@@ -16,7 +16,7 @@
 | January 11 | [1400. Construct K Palindrome Strings](https://leetcode.com/problems/construct-k-palindrome-strings/) | Medium | Solved |
 | January 12 | [2116. Check if a Parentheses String Can Be Valid](https://leetcode.com/problems/check-if-a-parentheses-string-can-be-valid/) | Medium | Unsolved |
 | January 13 | [3223. Minimum Length of String After Operations](https://leetcode.com/problems/minimum-length-of-string-after-operations/) | Medium | Solved |
-| January 14 | []() |  |  |
+| January 14 | [2657. Find the Prefix Common Array of Two Arrays](https://leetcode.com/problems/find-the-prefix-common-array-of-two-arrays/) | Medium | Solved |
 | January 15 | []() |  |  |
 | January 16 | []() |  |  |
 | January 17 | []() |  |  |
@@ -40,5 +40,5 @@
 | Level  | Problems | Solved | Unsolved |
 | ---    | --- | --- | --- |
 | Easy   | 4 | 4 | 0 |
-| Medium | 9 | 8 | 1 |
+| Medium | 10 | 9 | 1 |
 | Hard   | 0 | 0 | 0 |