Dec 1

Author: siddydutta

2024-12-December-LeetCoding-Challenge/Check If N and Its Double Exist.py

@@ -0,0 +1,23 @@
+from typing import List
+
+
+class Solution:
+    def checkIfExist(self, arr: List[int]) -> bool:
+        elements = set()
+        for n in arr:
+            if n*2 in elements or (n % 2 == 0 and n//2 in elements):
+                return True
+            elements.add(n)
+        return False
+
+
+def main():
+    arr = [10, 2, 5, 3]
+    assert Solution().checkIfExist(arr) is True
+
+    arr = [3, 1, 7, 11]
+    assert Solution().checkIfExist(arr) is False
+
+
+if __name__ == '__main__':
+    main()

2024-12-December-LeetCoding-Challenge/README.md

@@ -0,0 +1,43 @@
+# December-LeetCoding-Challenge-2024
+
+## Questions
+| Day | Problem | Level | Status |
+| --- | --- | --- | --- |
+| December 1  | [1346. Check If N and Its Double Exist](https://leetcode.com/problems/check-if-n-and-its-double-exist/) | Easy | Solved |
+| December 2  | []() |  |  |
+| December 3  | []() |  |  |
+| December 4  | []() |  |  |
+| December 5  | []() |  |  |
+| December 6  | []() |  |  |
+| December 7  | []() |  |  |
+| December 8  | []() |  |  |
+| December 9  | []() |  |  |
+| December 10 | []() |  |  |
+| December 11 | []() |  |  |
+| December 12 | []() |  |  |
+| December 13 | []() |  |  |
+| December 14 | []() |  |  |
+| December 15 | []() |  |  |
+| December 16 | []() |  |  |
+| December 17 | []() |  |  |
+| December 18 | []() |  |  |
+| December 19 | []() |  |  |
+| December 20 | []() |  |  |
+| December 21 | []() |  |  |
+| December 22 | []() |  |  |
+| December 23 | []() |  |  |
+| December 24 | []() |  |  |
+| December 25 | []() |  |  |
+| December 26 | []() |  |  |
+| December 27 | []() |  |  |
+| December 28 | []() |  |  |
+| December 29 | []() |  |  |
+| December 30 | []() |  |  |
+| December 31 | []() |  |  |
+
+## Summary
+| Level  | Problems | Solved | Unsolved |
+| ---    | --- | --- | --- |
+| Easy   | 1 | 1 | 0 |
+| Medium | 0 | 0 | 0 |
+| Hard   | 0 | 0 | 0 |