Lazy imports for leetcode

executors/factory.py

@@ -1,15 +1,14 @@
-from .leetcode_env.leetcode_env.leetcode_types import ProgrammingLanguage
-
 from .py_executor import PyExecutor
 from .rs_executor import RsExecutor
-from .leet_executor import LeetExecutor
 from .executor_types import Executor
-from .leetcode_env.leetcode_env.utils import PySubmissionFormatter, RsSubmissionFormatter
+from .leet_executor import LeetExecutor
 
 def executor_factory(lang: str, is_leet: bool = False) -> Executor:
     if lang == "py" or lang == "python":
         if is_leet:
             print("Using LeetCode Python executor")
+            from .leetcode_env.leetcode_env.leetcode_types import ProgrammingLanguage
+            from .leetcode_env.leetcode_env.utils import PySubmissionFormatter, RsSubmissionFormatter
             return LeetExecutor(ProgrammingLanguage.PYTHON3,
                                 PyExecutor(),
                                 PySubmissionFormatter)
@@ -17,6 +16,8 @@ def executor_factory(lang: str, is_leet: bool = False) -> Executor:
             return PyExecutor()
     elif lang == "rs" or lang == "rust":
         if is_leet:
+            from .leetcode_env.leetcode_env.leetcode_types import ProgrammingLanguage
+            from .leetcode_env.leetcode_env.utils import PySubmissionFormatter, RsSubmissionFormatter
             return LeetExecutor(ProgrammingLanguage.RUST,
                                 RsExecutor(),
                                 RsSubmissionFormatter)

executors/leet_executor.py

@@ -1,16 +1,18 @@
+from __future__ import annotations
+
 from typing import List
 
 from .executor_types import ExecuteResult, Executor
 from .executor_utils import to_jsonl
 from datetime import datetime
 
-from .leetcode_env.leetcode_env.utils import SubmissionFormatter
-from .leetcode_env.leetcode_env.leetcode_types import ProgrammingLanguage
-
 class LeetExecutor(Executor):
-    
-    def __init__(self, lang: ProgrammingLanguage, executor: Executor, formatter: SubmissionFormatter):
+    def __init__(self, lang, executor: Executor, formatter):
+        from .leetcode_env.leetcode_env.utils import SubmissionFormatter
+        from .leetcode_env.leetcode_env.leetcode_types import ProgrammingLanguage
         from .leetcode_env.leetcode_env.environment import LeetCodeEnv
+        assert isinstance(formatter, SubmissionFormatter)
+        assert isinstance(lang, ProgrammingLanguage)
         self.lang = lang
         self.executor = executor
         self.formatter = formatter

executors/leetcode_env

@@ -1 +1 @@
-Subproject commit db41e86d5d1777f4cde7a2973a606120c9a72163
+Subproject commit 2ab159560725cf8482600ca1d0adf55d1b315c14

reflexion.py

@@ -30,8 +30,10 @@ def run_reflexion(
         test_feedback = []
         cur_func_impl = ""
         while cur_pass < pass_at_k and not is_solved:
-            # tests_i = gen.internal_tests(item["prompt"], model, 1)
-            tests_i = item['visible_tests']
+            if is_leetcode:
+                tests_i = item['visible_tests']
+            else:
+                tests_i = gen.internal_tests(item["prompt"], model, 1)
 
             # first attempt
             cur_func_impl = gen.func_impl(item["prompt"], model, "simple")

test.py

@@ -0,0 +1,55 @@
+# Fails 2
+def minReverseOperations(self, n: int, p: int, banned: List[int], k: int) -> List[int]:
+        from collections import deque
+        banned = set(banned)
+        arr = tuple(0 if i in banned else (1 if i == p else 0) for i in range(n))
+        queue = deque([(arr, p, 0)])  # Add a third element to the tuple to store the number of
+        ans = [-1] * n
+        visited = set()
+
+        while queue:
+            cur_arr, cur_pos, ops = queue.popleft()
+            
+            if cur_pos not in visited:
+                visited.add(cur_pos)
+                ans[cur_pos] = ops
+
+                for i in range(n):
+                    for j in range(i + k, n + 1):
+                        new_arr = cur_arr[:i] + tuple(reversed(cur_arr[i:j])) + cur_arr[j:]
+                        new_pos = new_arr.index(1)
+                        
+                        if new_pos not in banned and (new_arr, new_pos) not in visited:
+                            queue.append((new_arr, new_pos, ops + 1))
+
+        return ans
+
+# Fails 1
+def minReverseOperations(self, n: int, p: int, banned: List[int], k: int) -> List[int]:
+        from collections import deque
+        banned = set(banned)
+        arr = tuple(0 if i in banned else (1 if i == p else 0) for i in range(n))
+        queue = deque([(arr, p, 0)])  # Add a third element to the tuple to store the number of operations
+        ans = [-1] * n
+        visited = set()
+
+        while queue:
+            cur_arr, cur_pos, ops = queue.popleft()
+            
+            if cur_pos not in visited:
+                visited.add(cur_pos)
+                ans[cur_pos] = ops
+
+                for i in range(n):
+                    for j in range(i + k, n + 1):
+                        # Check if the subarray to be reversed contains any banned positions
+                        if any(cur_arr[i:x] for x in range(i, j) if x in banned):
+                            continue
+                        
+                        new_arr = cur_arr[:i] + tuple(reversed(cur_arr[i:j])) + cur_arr[j:]
+                        new_pos = new_arr.index(1)
+                        
+                        if new_pos not in banned and (new_arr, new_pos) not in visited:
+                            queue.append((new_arr, new_pos, ops + 1))
+
+        return ans