feat: add more questions

Author: wislertt

.templates/leetcode/json/clone_graph.json

@@ -0,0 +1,50 @@
+{
+    "problem_name": "clone_graph",
+    "solution_class_name": "Solution",
+    "problem_number": "133",
+    "problem_title": "Clone Graph",
+    "difficulty": "Medium",
+    "topics": "Hash Table, Depth-First Search, Breadth-First Search, Graph",
+    "tags": ["grind-75"],
+    "readme_description": "Given a reference of a node in a **connected** undirected graph.\n\nReturn a **deep copy** (clone) of the graph.\n\nEach node in the graph contains a value (`int`) and a list (`List[Node]`) of its neighbors.\n\n```\nclass Node {\n    public int val;\n    public List<Node> neighbors;\n}\n```\n\n**Test case format:**\n\nFor simplicity, each node's value is the same as the node's index (1-indexed). For example, the first node with `val == 1`, the second node with `val == 2`, and so on. The graph is represented in the test case using an adjacency list.\n\n**An adjacency list** is a collection of unordered **lists** used to represent a finite graph. Each list describes the set of neighbors of a node in the graph.\n\nThe given node will always be the first node with `val = 1`. You must return the **copy of the given node** as a reference to the cloned graph.",
+    "readme_examples": [
+        {
+            "content": "<img alt=\"\" src=\"https://assets.leetcode.com/uploads/2019/11/04/133_clone_graph_question.png\" style=\"width: 454px; height: 500px;\" />\n\n```\nInput: adjList = [[2,4],[1,3],[2,4],[1,3]]\nOutput: [[2,4],[1,3],[2,4],[1,3]]\nExplanation: There are 4 nodes in the graph.\n1st node (val = 1)'s neighbors are 2nd node (val = 2) and 4th node (val = 4).\n2nd node (val = 2)'s neighbors are 1st node (val = 1) and 3rd node (val = 3).\n3rd node (val = 3)'s neighbors are 2nd node (val = 2) and 4th node (val = 4).\n4th node (val = 4)'s neighbors are 1st node (val = 1) and 3rd node (val = 3).\n```"
+        },
+        {
+            "content": "<img alt=\"\" src=\"https://assets.leetcode.com/uploads/2020/01/07/graph.png\" style=\"width: 163px; height: 148px;\" />\n\n```\nInput: adjList = [[]]\nOutput: [[]]\nExplanation: Note that the input contains one empty list. The graph consists of only one node with val = 1 and it does not have any neighbors.\n```"
+        },
+        {
+            "content": "```\nInput: adjList = []\nOutput: []\nExplanation: This an empty graph, it does not have any nodes.\n```"
+        }
+    ],
+    "readme_constraints": "- The number of nodes in the graph is in the range `[0, 100]`.\n- `1 <= Node.val <= 100`\n- `Node.val` is unique for each node.\n- There are no repeated edges and no self-loops in the graph.\n- The Graph is connected and all nodes can be visited starting from the given node.",
+    "readme_additional": "",
+    "solution_imports": "from leetcode_py import GraphNode",
+    "solution_methods": [
+        {
+            "name": "clone_graph",
+            "parameters": "node: GraphNode | None",
+            "return_type": "GraphNode | None",
+            "dummy_return": "None"
+        }
+    ],
+    "test_imports": "import pytest\n\nfrom leetcode_py import GraphNode\nfrom leetcode_py.test_utils import logged_test\n\nfrom .solution import Solution",
+    "test_class_name": "CloneGraph",
+    "test_helper_methods": [
+        { "name": "setup_method", "parameters": "", "body": "self.solution = Solution()" }
+    ],
+    "test_methods": [
+        {
+            "name": "test_clone_graph",
+            "parametrize": "adj_list, expected_adj_list",
+            "parametrize_typed": "adj_list: list[list[int]], expected_adj_list: list[list[int]]",
+            "test_cases": "[([[2,4],[1,3],[2,4],[1,3]], [[2,4],[1,3],[2,4],[1,3]]), ([[]], [[]]), ([], [])]",
+            "body": "node = GraphNode.from_adjacency_list(adj_list)\nexpected = GraphNode.from_adjacency_list(expected_adj_list)\nresult = self.solution.clone_graph(node)\nassert GraphNode.to_adjacency_list(result) == GraphNode.to_adjacency_list(expected)"
+        }
+    ],
+    "playground_imports": "from solution import Solution\n\nfrom leetcode_py import GraphNode",
+    "playground_test_case": "# Example test case\nadj_list = [[2,4],[1,3],[2,4],[1,3]]\nnode = GraphNode.from_adjacency_list(adj_list)\nexpected_adj_list = [[2,4],[1,3],[2,4],[1,3]]",
+    "playground_execution": "result = Solution().clone_graph(node)\nGraphNode.to_adjacency_list(result)",
+    "playground_assertion": "assert GraphNode.to_adjacency_list(result) == expected_adj_list"
+}

Makefile

@@ -1,5 +1,5 @@
 PYTHON_VERSION = 3.13
-PROBLEM ?= invert_binary_tree
+PROBLEM ?= clone_graph
 FORCE ?= 0
 
 sync_submodules:

leetcode/clone_graph/README.md

@@ -0,0 +1,72 @@
+# Clone Graph
+
+**Difficulty:** Medium
+**Topics:** Hash Table, Depth-First Search, Breadth-First Search, Graph
+**Tags:** grind-75
+
+**LeetCode:** [Problem 133](https://leetcode.com/problems/clone-graph/description/)
+
+## Problem Description
+
+Given a reference of a node in a **connected** undirected graph.
+
+Return a **deep copy** (clone) of the graph.
+
+Each node in the graph contains a value (`int`) and a list (`List[Node]`) of its neighbors.
+
+```
+class Node {
+    public int val;
+    public List<Node> neighbors;
+}
+```
+
+**Test case format:**
+
+For simplicity, each node's value is the same as the node's index (1-indexed). For example, the first node with `val == 1`, the second node with `val == 2`, and so on. The graph is represented in the test case using an adjacency list.
+
+**An adjacency list** is a collection of unordered **lists** used to represent a finite graph. Each list describes the set of neighbors of a node in the graph.
+
+The given node will always be the first node with `val = 1`. You must return the **copy of the given node** as a reference to the cloned graph.
+
+## Examples
+
+### Example 1:
+
+<img alt="" src="https://assets.leetcode.com/uploads/2019/11/04/133_clone_graph_question.png" style="width: 454px; height: 500px;" />
+
+```
+Input: adjList = [[2,4],[1,3],[2,4],[1,3]]
+Output: [[2,4],[1,3],[2,4],[1,3]]
+Explanation: There are 4 nodes in the graph.
+1st node (val = 1)'s neighbors are 2nd node (val = 2) and 4th node (val = 4).
+2nd node (val = 2)'s neighbors are 1st node (val = 1) and 3rd node (val = 3).
+3rd node (val = 3)'s neighbors are 2nd node (val = 2) and 4th node (val = 4).
+4th node (val = 4)'s neighbors are 1st node (val = 1) and 3rd node (val = 3).
+```
+
+### Example 2:
+
+<img alt="" src="https://assets.leetcode.com/uploads/2020/01/07/graph.png" style="width: 163px; height: 148px;" />
+
+```
+Input: adjList = [[]]
+Output: [[]]
+Explanation: Note that the input contains one empty list. The graph consists of only one node with val = 1 and it does not have any neighbors.
+```
+
+### Example 3:
+
+```
+Input: adjList = []
+Output: []
+Explanation: This an empty graph, it does not have any nodes.
+```
+
+## Constraints
+
+- The number of nodes in the graph is in the range `[0, 100]`.
+- `1 <= Node.val <= 100`
+- `Node.val` is unique for each node.
+- There are no repeated edges and no self-loops in the graph.
+- The Graph is connected and all nodes can be visited starting from the given node.

leetcode/clone_graph/__init__.py

@@ -0,0 +1,212 @@
+{
+ "cells": [
+  {
+   "cell_type": "code",
+   "execution_count": 1,
+   "id": "imports",
+   "metadata": {},
+   "outputs": [],
+   "source": [
+    "from solution import Solution\n",
+    "\n",
+    "from leetcode_py import GraphNode"
+   ]
+  },
+  {
+   "cell_type": "code",
+   "execution_count": 2,
+   "id": "setup",
+   "metadata": {},
+   "outputs": [
+    {
+     "data": {
+      "text/html": [
+       "<?xml version=\"1.0\" encoding=\"UTF-8\" standalone=\"no\"?>\n",
+       "<!DOCTYPE svg PUBLIC \"-//W3C//DTD SVG 1.1//EN\"\n",
+       " \"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd\">\n",
+       "<!-- Generated by graphviz version 13.1.2 (20250808.2320)\n",
+       " -->\n",
+       "<!-- Pages: 1 -->\n",
+       "<svg width=\"135pt\" height=\"138pt\"\n",
+       " viewBox=\"0.00 0.00 135.00 138.00\" xmlns=\"http://www.w3.org/2000/svg\" xmlns:xlink=\"http://www.w3.org/1999/xlink\">\n",
+       "<g id=\"graph0\" class=\"graph\" transform=\"scale(1 1) rotate(0) translate(4 134.25)\">\n",
+       "<polygon fill=\"white\" stroke=\"none\" points=\"-4,4 -4,-134.25 131.36,-134.25 131.36,4 -4,4\"/>\n",
+       "<!-- 1 -->\n",
+       "<g id=\"node1\" class=\"node\">\n",
+       "<title>1</title>\n",
+       "<ellipse fill=\"lightblue\" stroke=\"black\" cx=\"18\" cy=\"-53.59\" rx=\"18\" ry=\"18\"/>\n",
+       "<text xml:space=\"preserve\" text-anchor=\"middle\" x=\"18\" y=\"-48.54\" font-family=\"Times,serif\" font-size=\"14.00\">1</text>\n",
+       "</g>\n",
+       "<!-- 2 -->\n",
+       "<g id=\"node2\" class=\"node\">\n",
+       "<title>2</title>\n",
+       "<ellipse fill=\"lightblue\" stroke=\"black\" cx=\"109.36\" cy=\"-76.24\" rx=\"18\" ry=\"18\"/>\n",
+       "<text xml:space=\"preserve\" text-anchor=\"middle\" x=\"109.36\" y=\"-71.19\" font-family=\"Times,serif\" font-size=\"14.00\">2</text>\n",
+       "</g>\n",
+       "<!-- 1&#45;&#45;2 -->\n",
+       "<g id=\"edge1\" class=\"edge\">\n",
+       "<title>1&#45;&#45;2</title>\n",
+       "<path fill=\"none\" stroke=\"gray\" d=\"M35.61,-57.96C51.69,-61.94 75.33,-67.81 91.48,-71.81\"/>\n",
+       "</g>\n",
+       "<!-- 4 -->\n",
+       "<g id=\"node3\" class=\"node\">\n",
+       "<title>4</title>\n",
+       "<ellipse fill=\"lightblue\" stroke=\"black\" cx=\"64.17\" cy=\"-18\" rx=\"18\" ry=\"18\"/>\n",
+       "<text xml:space=\"preserve\" text-anchor=\"middle\" x=\"64.17\" y=\"-12.95\" font-family=\"Times,serif\" font-size=\"14.00\">4</text>\n",
+       "</g>\n",
+       "<!-- 1&#45;&#45;4 -->\n",
+       "<g id=\"edge2\" class=\"edge\">\n",
+       "<title>1&#45;&#45;4</title>\n",
+       "<path fill=\"none\" stroke=\"gray\" d=\"M32.61,-42.33C38.1,-38.09 44.34,-33.28 49.81,-29.07\"/>\n",
+       "</g>\n",
+       "<!-- 3 -->\n",
+       "<g id=\"node4\" class=\"node\">\n",
+       "<title>3</title>\n",
+       "<ellipse fill=\"lightblue\" stroke=\"black\" cx=\"63.48\" cy=\"-112.25\" rx=\"18\" ry=\"18\"/>\n",
+       "<text xml:space=\"preserve\" text-anchor=\"middle\" x=\"63.48\" y=\"-107.2\" font-family=\"Times,serif\" font-size=\"14.00\">3</text>\n",
+       "</g>\n",
+       "<!-- 2&#45;&#45;3 -->\n",
+       "<g id=\"edge3\" class=\"edge\">\n",
+       "<title>2&#45;&#45;3</title>\n",
+       "<path fill=\"none\" stroke=\"gray\" d=\"M94.84,-87.64C89.38,-91.92 83.18,-96.79 77.74,-101.05\"/>\n",
+       "</g>\n",
+       "<!-- 3&#45;&#45;4 -->\n",
+       "<g id=\"edge4\" class=\"edge\">\n",
+       "<title>3&#45;&#45;4</title>\n",
+       "<path fill=\"none\" stroke=\"gray\" d=\"M63.61,-94.08C63.73,-77.49 63.91,-53.1 64.03,-36.44\"/>\n",
+       "</g>\n",
+       "</g>\n",
+       "</svg>\n"
+      ],
+      "text/plain": [
+       "GraphNode({1: [2, 4], 2: [1, 3], 3: [2, 4], 4: [1, 3]})"
+      ]
+     },
+     "execution_count": 2,
+     "metadata": {},
+     "output_type": "execute_result"
+    }
+   ],
+   "source": [
+    "# Example test case\n",
+    "adj_list = [[2, 4], [1, 3], [2, 4], [1, 3]]\n",
+    "node = GraphNode.from_adjacency_list(adj_list)\n",
+    "node"
+   ]
+  },
+  {
+   "cell_type": "code",
+   "execution_count": 3,
+   "id": "execute",
+   "metadata": {},
+   "outputs": [
+    {
+     "data": {
+      "text/html": [
+       "<?xml version=\"1.0\" encoding=\"UTF-8\" standalone=\"no\"?>\n",
+       "<!DOCTYPE svg PUBLIC \"-//W3C//DTD SVG 1.1//EN\"\n",
+       " \"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd\">\n",
+       "<!-- Generated by graphviz version 13.1.2 (20250808.2320)\n",
+       " -->\n",
+       "<!-- Pages: 1 -->\n",
+       "<svg width=\"135pt\" height=\"138pt\"\n",
+       " viewBox=\"0.00 0.00 135.00 138.00\" xmlns=\"http://www.w3.org/2000/svg\" xmlns:xlink=\"http://www.w3.org/1999/xlink\">\n",
+       "<g id=\"graph0\" class=\"graph\" transform=\"scale(1 1) rotate(0) translate(4 134.25)\">\n",
+       "<polygon fill=\"white\" stroke=\"none\" points=\"-4,4 -4,-134.25 131.36,-134.25 131.36,4 -4,4\"/>\n",
+       "<!-- 1 -->\n",
+       "<g id=\"node1\" class=\"node\">\n",
+       "<title>1</title>\n",
+       "<ellipse fill=\"lightblue\" stroke=\"black\" cx=\"18\" cy=\"-53.59\" rx=\"18\" ry=\"18\"/>\n",
+       "<text xml:space=\"preserve\" text-anchor=\"middle\" x=\"18\" y=\"-48.54\" font-family=\"Times,serif\" font-size=\"14.00\">1</text>\n",
+       "</g>\n",
+       "<!-- 2 -->\n",
+       "<g id=\"node2\" class=\"node\">\n",
+       "<title>2</title>\n",
+       "<ellipse fill=\"lightblue\" stroke=\"black\" cx=\"109.36\" cy=\"-76.24\" rx=\"18\" ry=\"18\"/>\n",
+       "<text xml:space=\"preserve\" text-anchor=\"middle\" x=\"109.36\" y=\"-71.19\" font-family=\"Times,serif\" font-size=\"14.00\">2</text>\n",
+       "</g>\n",
+       "<!-- 1&#45;&#45;2 -->\n",
+       "<g id=\"edge1\" class=\"edge\">\n",
+       "<title>1&#45;&#45;2</title>\n",
+       "<path fill=\"none\" stroke=\"gray\" d=\"M35.61,-57.96C51.69,-61.94 75.33,-67.81 91.48,-71.81\"/>\n",
+       "</g>\n",
+       "<!-- 4 -->\n",
+       "<g id=\"node3\" class=\"node\">\n",
+       "<title>4</title>\n",
+       "<ellipse fill=\"lightblue\" stroke=\"black\" cx=\"64.17\" cy=\"-18\" rx=\"18\" ry=\"18\"/>\n",
+       "<text xml:space=\"preserve\" text-anchor=\"middle\" x=\"64.17\" y=\"-12.95\" font-family=\"Times,serif\" font-size=\"14.00\">4</text>\n",
+       "</g>\n",
+       "<!-- 1&#45;&#45;4 -->\n",
+       "<g id=\"edge2\" class=\"edge\">\n",
+       "<title>1&#45;&#45;4</title>\n",
+       "<path fill=\"none\" stroke=\"gray\" d=\"M32.61,-42.33C38.1,-38.09 44.34,-33.28 49.81,-29.07\"/>\n",
+       "</g>\n",
+       "<!-- 3 -->\n",
+       "<g id=\"node4\" class=\"node\">\n",
+       "<title>3</title>\n",
+       "<ellipse fill=\"lightblue\" stroke=\"black\" cx=\"63.48\" cy=\"-112.25\" rx=\"18\" ry=\"18\"/>\n",
+       "<text xml:space=\"preserve\" text-anchor=\"middle\" x=\"63.48\" y=\"-107.2\" font-family=\"Times,serif\" font-size=\"14.00\">3</text>\n",
+       "</g>\n",
+       "<!-- 2&#45;&#45;3 -->\n",
+       "<g id=\"edge3\" class=\"edge\">\n",
+       "<title>2&#45;&#45;3</title>\n",
+       "<path fill=\"none\" stroke=\"gray\" d=\"M94.84,-87.64C89.38,-91.92 83.18,-96.79 77.74,-101.05\"/>\n",
+       "</g>\n",
+       "<!-- 3&#45;&#45;4 -->\n",
+       "<g id=\"edge4\" class=\"edge\">\n",
+       "<title>3&#45;&#45;4</title>\n",
+       "<path fill=\"none\" stroke=\"gray\" d=\"M63.61,-94.08C63.73,-77.49 63.91,-53.1 64.03,-36.44\"/>\n",
+       "</g>\n",
+       "</g>\n",
+       "</svg>\n"
+      ],
+      "text/plain": [
+       "GraphNode({1: [2, 4], 2: [1, 3], 3: [2, 4], 4: [1, 3]})"
+      ]
+     },
+     "execution_count": 3,
+     "metadata": {},
+     "output_type": "execute_result"
+    }
+   ],
+   "source": [
+    "result = Solution().clone_graph(node)\n",
+    "result"
+   ]
+  },
+  {
+   "cell_type": "code",
+   "execution_count": 4,
+   "id": "test",
+   "metadata": {},
+   "outputs": [],
+   "source": [
+    "if result is None:\n",
+    "    assert node is None\n",
+    "else:\n",
+    "    assert result.is_clone(node)"
+   ]
+  }
+ ],
+ "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": "python",
+   "pygments_lexer": "ipython3",
+   "version": "3.13.7"
+  }
+ },
+ "nbformat": 4,
+ "nbformat_minor": 5
+}