feat: add Contains Duplicate

Author: wislertt

.templates/leetcode/json/contains_duplicate.json

@@ -0,0 +1,48 @@
+{
+    "problem_name": "contains_duplicate",
+    "solution_class_name": "Solution",
+    "problem_number": "217",
+    "problem_title": "Contains Duplicate",
+    "difficulty": "Easy",
+    "topics": "Array, Hash Table, Sorting",
+    "tags": ["grind-75"],
+    "readme_description": "Given an integer array `nums`, return `true` if any value appears **at least twice** in the array, and return `false` if every element is distinct.",
+    "readme_examples": [
+        {
+            "content": "```\nInput: nums = [1,2,3,1]\nOutput: true\n```\n**Explanation:** The element 1 occurs at the indices 0 and 3."
+        },
+        {
+            "content": "```\nInput: nums = [1,2,3,4]\nOutput: false\n```\n**Explanation:** All elements are distinct."
+        },
+        { "content": "```\nInput: nums = [1,1,1,3,3,4,3,2,4,2]\nOutput: true\n```" }
+    ],
+    "readme_constraints": "- 1 <= nums.length <= 10^5\n- -10^9 <= nums[i] <= 10^9",
+    "readme_additional": "",
+    "solution_imports": "",
+    "solution_methods": [
+        {
+            "name": "contains_duplicate",
+            "parameters": "nums: list[int]",
+            "return_type": "bool",
+            "dummy_return": "False"
+        }
+    ],
+    "test_imports": "import pytest\nfrom leetcode_py.test_utils import logged_test\nfrom .solution import Solution",
+    "test_class_name": "ContainsDuplicate",
+    "test_helper_methods": [
+        { "name": "setup_method", "parameters": "", "body": "self.solution = Solution()" }
+    ],
+    "test_methods": [
+        {
+            "name": "test_contains_duplicate",
+            "parametrize": "nums, expected",
+            "parametrize_typed": "nums: list[int], expected: bool",
+            "test_cases": "[([1, 2, 3, 1], True), ([1, 2, 3, 4], False), ([1, 1, 1, 3, 3, 4, 3, 2, 4, 2], True)]",
+            "body": "result = self.solution.contains_duplicate(nums)\nassert result == expected"
+        }
+    ],
+    "playground_imports": "from solution import Solution",
+    "playground_test_case": "# Example test case\nnums = [1, 2, 3, 1]\nexpected = True",
+    "playground_execution": "result = Solution().contains_duplicate(nums)\nresult",
+    "playground_assertion": "assert result == expected"
+}

Makefile

@@ -1,5 +1,5 @@
 PYTHON_VERSION = 3.13
-PROBLEM ?= middle_of_the_linked_list
+PROBLEM ?= contains_duplicate
 FORCE ?= 0
 COMMA := ,
 

leetcode/contains_duplicate/README.md

@@ -0,0 +1,43 @@
+# Contains Duplicate
+
+**Difficulty:** Easy
+**Topics:** Array, Hash Table, Sorting
+**Tags:** grind-75
+
+**LeetCode:** [Problem 217](https://leetcode.com/problems/contains-duplicate/description/)
+
+## Problem Description
+
+Given an integer array `nums`, return `true` if any value appears **at least twice** in the array, and return `false` if every element is distinct.
+
+## Examples
+
+### Example 1:
+
+```
+Input: nums = [1,2,3,1]
+Output: true
+```
+
+**Explanation:** The element 1 occurs at the indices 0 and 3.
+
+### Example 2:
+
+```
+Input: nums = [1,2,3,4]
+Output: false
+```
+
+**Explanation:** All elements are distinct.
+
+### Example 3:
+
+```
+Input: nums = [1,1,1,3,3,4,3,2,4,2]
+Output: true
+```
+
+## Constraints
+
+- 1 <= nums.length <= 10^5
+- -10^9 <= nums[i] <= 10^9

leetcode/contains_duplicate/__init__.py

@@ -0,0 +1,57 @@
+{
+ "cells": [
+  {
+   "cell_type": "code",
+   "execution_count": null,
+   "id": "imports",
+   "metadata": {},
+   "outputs": [],
+   "source": ["from solution import Solution"]
+  },
+  {
+   "cell_type": "code",
+   "execution_count": null,
+   "id": "setup",
+   "metadata": {},
+   "outputs": [],
+   "source": ["# Example test case\nnums = [1, 2, 3, 1]\nexpected = True"]
+  },
+  {
+   "cell_type": "code",
+   "execution_count": null,
+   "id": "execute",
+   "metadata": {},
+   "outputs": [],
+   "source": ["result = Solution().contains_duplicate(nums)\nresult"]
+  },
+  {
+   "cell_type": "code",
+   "execution_count": null,
+   "id": "test",
+   "metadata": {},
+   "outputs": [],
+   "source": ["assert result == expected"]
+  }
+ ],
+ "metadata": {
+  "kernelspec": {
+   "display_name": "leetcode-py-py3.13",
+   "language": "python",
+   "name": "python3"
+  },
+  "language_info": {
+   "codemirror_mode": {
+    "name": "ipython",
+    "version": 3
+   },
+   "file_extension": ".py",
+   "mimetype": "text/x-python",
+   "name": "python",
+   "nbconvert_exporter": "python3",
+   "pygments_lexer": "ipython3",
+   "version": "3.13.7"
+  }
+ },
+ "nbformat": 4,
+ "nbformat_minor": 5
+}

leetcode/contains_duplicate/playground.ipynb

@@ -0,0 +1,10 @@
+class Solution:
+    # Time: O(n)
+    # Space: O(n)
+    def contains_duplicate(self, nums: list[int]) -> bool:
+        seen = set()
+        for num in nums:
+            if num in seen:
+                return True
+            seen.add(num)
+        return False

leetcode/contains_duplicate/solution.py

@@ -0,0 +1,32 @@
+import pytest
+
+from leetcode_py.test_utils import logged_test
+
+from .solution import Solution
+
+
+class TestContainsDuplicate:
+    def setup_method(self):
+        self.solution = Solution()
+
+    @pytest.mark.parametrize(
+        "nums, expected",
+        [
+            ([1, 2, 3, 1], True),
+            ([1, 2, 3, 4], False),
+            ([1, 1, 1, 3, 3, 4, 3, 2, 4, 2], True),
+            ([], False),
+            ([1], False),
+            ([1, 1], True),
+            ([-1, -2, -3, -1], True),
+            ([-1, -2, -3, -4], False),
+            ([0, 0], True),
+            ([1000000, 999999, 1000000], True),
+            (list(range(1000)), False),
+            ([1] * 1000, True),
+        ],
+    )
+    @logged_test
+    def test_contains_duplicate(self, nums: list[int], expected: bool):
+        result = self.solution.contains_duplicate(nums)
+        assert result == expected