⚡ Bolt: [performance improvement] Optimize solution-matching loops to O(N) map lookups and fix cache bypass

.jules/bolt.md

@@ -6,3 +6,7 @@
 ## 2025-05-20 - Pre-compiling Regex in Loops
 **Learning:** `re.findall(pattern, string)` recompiles (or retrieves from cache) the pattern on every call. In high-frequency functions called inside loops (like complexity estimation), this overhead adds up.
 **Action:** Always pre-compile regexes (`re.compile`) into module-level or class-level constants if they are used repeatedly, especially in tight loops or recursive functions.
+
+## 2025-05-25 - Solution Lookup Optimization
+**Learning:** O(N*M) search loops with an inner `break` (to map elements like exercises to solutions) are a common anti-pattern that creates unexpected bottlenecks when generating complex material collections.
+**Action:** Replace nested loops that map related concepts with O(N) pre-computed dictionary lookups (`{sol['exercise_label']: sol for sol in solutions}`). When refactoring `break` semantics, populate the dict using `if key not in dict` to preserve first-match behavior.