feat: add more questions

Author: wislertt

.templates/leetcode/json/insert_interval.json

@@ -0,0 +1,68 @@
+{
+    "question_name": "insert_interval",
+    "class_name": "InsertInterval",
+    "method_name": "insert",
+    "problem_number": "57",
+    "problem_title": "Insert Interval",
+    "difficulty": "Medium",
+    "topics": "Array",
+    "tags": ["grind-75"],
+    "problem_description": "You are given an array of non-overlapping intervals intervals where intervals[i] = [starti, endi] represent the start and the end of the ith interval and intervals is sorted in ascending order by starti. You are also given an interval newInterval = [start, end] that represents the start and end of another interval.\n\nInsert newInterval into intervals such that intervals is still sorted in ascending order by starti and intervals still does not have any overlapping intervals (merge overlapping intervals if necessary).\n\nReturn intervals after the insertion.",
+    "examples": [
+        { "input": "intervals = [[1,3],[6,9]], newInterval = [2,5]", "output": "[[1,5],[6,9]]" },
+        {
+            "input": "intervals = [[1,2],[3,5],[6,7],[8,10],[12,16]], newInterval = [4,8]",
+            "output": "[[1,2],[3,10],[12,16]]"
+        }
+    ],
+    "constraints": "- 0 <= intervals.length <= 10^4\n- intervals[i].length == 2\n- 0 <= starti <= endi <= 10^5\n- intervals is sorted by starti in ascending order.\n- newInterval.length == 2\n- 0 <= start <= end <= 10^5",
+    "parameters": "intervals: list[list[int]], newInterval: list[int]",
+    "return_type": "list[list[int]]",
+    "dummy_return": "[]",
+    "imports": "",
+    "test_cases": [
+        {
+            "args": [
+                [
+                    [1, 3],
+                    [6, 9]
+                ],
+                [2, 5]
+            ],
+            "expected": [
+                [1, 5],
+                [6, 9]
+            ]
+        },
+        {
+            "args": [
+                [
+                    [1, 2],
+                    [3, 5],
+                    [6, 7],
+                    [8, 10],
+                    [12, 16]
+                ],
+                [4, 8]
+            ],
+            "expected": [
+                [1, 2],
+                [3, 10],
+                [12, 16]
+            ]
+        },
+        { "args": [[], [5, 7]], "expected": [[5, 7]] },
+        { "args": [[[1, 5]], [2, 3]], "expected": [[1, 5]] }
+    ],
+    "param_names": "intervals, newInterval, expected",
+    "param_names_with_types": "intervals: list[list[int]], newInterval: list[int], expected: list[list[int]]",
+    "input_description": "intervals={intervals}, newInterval={newInterval}",
+    "input_params": "intervals, newInterval",
+    "expected_param": "expected",
+    "method_args": "intervals, newInterval",
+    "test_setup": "",
+    "test_logging": "",
+    "assertion_code": "assert result == expected",
+    "test_input_setup": "# Example test case\\nintervals = [[1,3],[6,9]]\\nnewInterval = [2,5]",
+    "expected_output_setup": "expected = [[1,5],[6,9]]"
+}

.templates/leetcode/{{cookiecutter.question_name}}/playground.ipynb

@@ -7,8 +7,8 @@
    "metadata": {},
    "outputs": [],
    "source": [
-    "from solution import Solution\n",{%- if cookiecutter.imports %}
-    "\n",
+    "from solution import Solution"{%- if cookiecutter.imports %},
+    "",
     "{{cookiecutter.imports}}"{%- endif %}
    ]
   },
@@ -19,8 +19,8 @@
    "metadata": {},
    "outputs": [],
    "source": [
-    "# Example test case\n",
-    "{{cookiecutter.test_input_setup.replace('# Example test case\\n', '')}}"
+    {% for line in cookiecutter.test_input_setup.split('\n') %}"{{line}}"{% if not loop.last %},
+    {% endif %}{% endfor %}
    ]
   },
   {
@@ -40,7 +40,7 @@
    "metadata": {},
    "outputs": [],
    "source": [
-    "result = Solution().{{cookiecutter.method_name}}({{cookiecutter.method_args}})\n",
+    "result = Solution().{{cookiecutter.method_name}}({{cookiecutter.method_args}})",
     "result"
    ]
   },
@@ -69,7 +69,7 @@
    "file_extension": ".py",
    "mimetype": "text/x-python",
    "name": "python",
-   "nbconvert_exporter": "python",
+   "nbconvert_exporter": "python3",
    "pygments_lexer": "ipython3",
    "version": "3.13.7"
   }

Makefile

@@ -1,5 +1,5 @@
 PYTHON_VERSION = 3.13
-QUESTION ?= reverse_linked_list_ii
+QUESTION ?= insert_interval
 FORCE ?= 0
 
 sync_submodules:

leetcode/insert_interval/README.md

@@ -0,0 +1,39 @@
+# 57. Insert Interval
+
+**Difficulty:** Medium
+**Topics:** Array
+**Tags:** grind-75
+**LeetCode:** [Problem 57](https://leetcode.com/problems/insert-interval/description/)
+
+## Problem Description
+
+You are given an array of non-overlapping intervals intervals where intervals[i] = [starti, endi] represent the start and the end of the ith interval and intervals is sorted in ascending order by starti. You are also given an interval newInterval = [start, end] that represents the start and end of another interval.
+
+Insert newInterval into intervals such that intervals is still sorted in ascending order by starti and intervals still does not have any overlapping intervals (merge overlapping intervals if necessary).
+
+Return intervals after the insertion.
+
+## Examples
+
+### Example 1:
+
+```
+Input: intervals = [[1,3],[6,9]], newInterval = [2,5]
+Output: [[1,5],[6,9]]
+```
+
+### Example 2:
+
+```
+Input: intervals = [[1,2],[3,5],[6,7],[8,10],[12,16]], newInterval = [4,8]
+Output: [[1,2],[3,10],[12,16]]
+```
+
+## Constraints
+
+- 0 <= intervals.length <= 10^4
+- intervals[i].length == 2
+- 0 <= starti <= endi <= 10^5
+- intervals is sorted by starti in ascending order.
+- newInterval.length == 2
+- 0 <= start <= end <= 10^5

leetcode/insert_interval/__init__.py

@@ -0,0 +1,78 @@
+{
+ "cells": [
+  {
+   "cell_type": "code",
+   "execution_count": null,
+   "id": "fc4d8c0c",
+   "metadata": {},
+   "outputs": [],
+   "source": [
+    "from solution import Solution"
+   ]
+  },
+  {
+   "cell_type": "code",
+   "execution_count": null,
+   "id": "ecb1908a",
+   "metadata": {},
+   "outputs": [],
+   "source": [
+    "# Example test case\n",
+    "intervals = [[1, 3], [6, 9]]\n",
+    "newInterval = [2, 5]"
+   ]
+  },
+  {
+   "cell_type": "code",
+   "execution_count": null,
+   "id": "ccd8921e",
+   "metadata": {},
+   "outputs": [],
+   "source": [
+    "expected = [[1, 5], [6, 9]]"
+   ]
+  },
+  {
+   "cell_type": "code",
+   "execution_count": null,
+   "id": "29433b11",
+   "metadata": {},
+   "outputs": [],
+   "source": [
+    "result = Solution().insert(intervals, newInterval)\n",
+    "result"
+   ]
+  },
+  {
+   "cell_type": "code",
+   "execution_count": null,
+   "id": "3a4e7961",
+   "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": "python",
+   "pygments_lexer": "ipython3",
+   "version": "3.13.7"
+  }
+ },
+ "nbformat": 4,
+ "nbformat_minor": 5
+}

leetcode/insert_interval/playground.ipynb

@@ -0,0 +1,26 @@
+class Solution:
+    # Time: O(n)
+    # Space: O(n)
+    def insert(self, intervals: list[list[int]], newInterval: list[int]) -> list[list[int]]:
+        result = []
+        i = 0
+
+        # Add intervals before newInterval
+        while i < len(intervals) and intervals[i][1] < newInterval[0]:
+            result.append(intervals[i])
+            i += 1
+
+        # Merge overlapping intervals
+        while i < len(intervals) and intervals[i][0] <= newInterval[1]:
+            newInterval[0] = min(newInterval[0], intervals[i][0])
+            newInterval[1] = max(newInterval[1], intervals[i][1])
+            i += 1
+
+        result.append(newInterval)
+
+        # Add remaining intervals
+        while i < len(intervals):
+            result.append(intervals[i])
+            i += 1
+
+        return result

leetcode/insert_interval/solution.py

@@ -0,0 +1,27 @@
+import pytest
+from loguru import logger
+
+from leetcode_py.test_utils import logged_test
+
+from .solution import Solution
+
+
+class TestInsertInterval:
+    def setup_method(self):
+        self.solution = Solution()
+
+    @pytest.mark.parametrize(
+        "intervals, newInterval, expected",
+        [
+            ([[1, 3], [6, 9]], [2, 5], [[1, 5], [6, 9]]),
+            ([[1, 2], [3, 5], [6, 7], [8, 10], [12, 16]], [4, 8], [[1, 2], [3, 10], [12, 16]]),
+            ([], [5, 7], [[5, 7]]),
+            ([[1, 5]], [2, 3], [[1, 5]]),
+        ],
+    )
+    @logged_test
+    def test_insert(self, intervals: list[list[int]], newInterval: list[int], expected: list[list[int]]):
+        logger.info(f"Testing with intervals={intervals}, newInterval={newInterval}")
+        result = self.solution.insert(intervals, newInterval)
+        logger.success(f"Got result: {result}")
+        assert result == expected