feat: dev

Author: wislertt

.amazonq/rules/problem-creation.md

@@ -14,6 +14,7 @@
 - **Tree problems**: Use `.templates/leetcode/examples/tree.json5`
 - **Basic problems**: Use `.templates/leetcode/examples/basic.json5`
 - **Don't add extra fields** - templates are complete
+- **Python naming convention**: Use snake_case for all parameter names (e.g., `new_interval` not `newInterval`)
 - **If lint fails**: Fix JSON and regenerate, don't edit generated files
 - **After any manual edits**: Always update JSON template and verify with `make p-gen FORCE=1`
 

.templates/leetcode/json/insert_interval.json

@@ -7,16 +7,16 @@
     "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.",
+    "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 new_interval = [start, end] that represents the start and end of another interval.\n\nInsert new_interval 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,3],[6,9]], new_interval = [2,5]", "output": "[[1,5],[6,9]]" },
         {
-            "input": "intervals = [[1,2],[3,5],[6,7],[8,10],[12,16]], newInterval = [4,8]",
+            "input": "intervals = [[1,2],[3,5],[6,7],[8,10],[12,16]], new_interval = [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]",
+    "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- new_interval.length == 2\n- 0 <= start <= end <= 10^5",
+    "parameters": "intervals: list[list[int]], new_interval: list[int]",
     "return_type": "list[list[int]]",
     "dummy_return": "[]",
     "imports": "",
@@ -54,15 +54,15 @@
         { "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",
+    "param_names": "intervals, new_interval, expected",
+    "param_names_with_types": "intervals: list[list[int]], new_interval: list[int], expected: list[list[int]]",
+    "input_description": "intervals={intervals}, new_interval={new_interval}",
+    "input_params": "intervals, new_interval",
     "expected_param": "expected",
-    "method_args": "intervals, newInterval",
+    "method_args": "intervals, new_interval",
     "test_setup": "",
     "test_logging": "",
     "assertion_code": "assert result == expected",
-    "test_input_setup": "# Example test case\nintervals = [[1,3],[6,9]]\nnewInterval = [2,5]",
+    "test_input_setup": "# Example test case\nintervals = [[1,3],[6,9]]\nnew_interval = [2,5]",
     "expected_output_setup": "expected = [[1,5],[6,9]]"
 }

leetcode/insert_interval/README.md

@@ -7,9 +7,9 @@
 
 ## 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.
+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 new_interval = [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).
+Insert new_interval 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.
 
@@ -18,14 +18,14 @@ Return intervals after the insertion.
 ### Example 1:
 
 ```
-Input: intervals = [[1,3],[6,9]], newInterval = [2,5]
+Input: intervals = [[1,3],[6,9]], new_interval = [2,5]
 Output: [[1,5],[6,9]]
 ```
 
 ### Example 2:
 
 ```
-Input: intervals = [[1,2],[3,5],[6,7],[8,10],[12,16]], newInterval = [4,8]
+Input: intervals = [[1,2],[3,5],[6,7],[8,10],[12,16]], new_interval = [4,8]
 Output: [[1,2],[3,10],[12,16]]
 ```
 
@@ -35,5 +35,5 @@ Output: [[1,2],[3,10],[12,16]]
 - intervals[i].length == 2
 - 0 <= starti <= endi <= 10^5
 - intervals is sorted by starti in ascending order.
-- newInterval.length == 2
+- new_interval.length == 2
 - 0 <= start <= end <= 10^5

leetcode/insert_interval/playground.ipynb

@@ -19,7 +19,7 @@
    "source": [
     "# Example test case\n",
     "intervals = [[1, 3], [6, 9]]\n",
-    "newInterval = [2, 5]\n",
+    "new_interval = [2, 5]\n",
     "expected = [[1, 5], [6, 9]]"
    ]
   },
@@ -41,7 +41,7 @@
     }
    ],
    "source": [
-    "result = Solution().insert(intervals, newInterval)\n",
+    "result = Solution().insert(intervals, new_interval)\n",
     "result"
    ]
   },

leetcode/insert_interval/solution.py

@@ -1,21 +1,21 @@
 class Solution:
     # Time: O(n)
     # Space: O(n)
-    def insert(self, intervals: list[list[int]], newInterval: list[int]) -> list[list[int]]:
+    def insert(self, intervals: list[list[int]], new_interval: list[int]) -> list[list[int]]:
         result = []
         i = 0
 
-        # Add intervals before newInterval
-        while i < len(intervals) and intervals[i][1] < newInterval[0]:
+        # Add intervals before new_interval
+        while i < len(intervals) and intervals[i][1] < new_interval[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])
+        while i < len(intervals) and intervals[i][0] <= new_interval[1]:
+            new_interval[0] = min(new_interval[0], intervals[i][0])
+            new_interval[1] = max(new_interval[1], intervals[i][1])
             i += 1
-        result.append(newInterval)
+        result.append(new_interval)
 
         # Add remaining intervals
         result.extend(intervals[i:])

leetcode/insert_interval/tests.py

@@ -11,7 +11,7 @@ def setup_method(self):
         self.solution = Solution()
 
     @pytest.mark.parametrize(
-        "intervals, newInterval, expected",
+        "intervals, new_interval, 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]]),
@@ -20,8 +20,10 @@ def setup_method(self):
         ],
     )
     @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)
+    def test_insert(
+        self, intervals: list[list[int]], new_interval: list[int], expected: list[list[int]]
+    ):
+        logger.info(f"Testing with intervals={intervals}, new_interval={new_interval}")
+        result = self.solution.insert(intervals, new_interval)
         logger.success(f"Got result: {result}")
         assert result == expected