LeetCode Question Finder & Curriculum Curator
A precision curation engine for competitive coding and technical interview preparation. Filters out low-quality and redundant problems to surface the essential canonical LeetCode questions that maximize pattern recognition and interview return on investment.
Trigger Phrases
| User Input |
Target Output |
| "Find best BFS questions on LeetCode" |
Top canonical BFS problems grouped by sub-pattern (Grid, Tree, Multi-source) |
| "Good practice problems for Dynamic Programming" |
Structured roadmap across 1D, 2D Grid, Knapsack, and String DP |
| "What sliding window problems should I practice?" |
Progressive practice ladder from fixed-size to dynamic-size windows |
| "Give me a 7-day LeetCode plan for Binary Trees" |
Day-by-day milestone schedule mixing warm-ups and core Mediums |
Curation Methodology
Phase 1: Multi-Source Web & Dataset Research
Always conduct live search across multiple proven curricula to verify problem numbers, canonical names, and frequency:
- Foundational Curricula: Blind 75, Grind 75, NeetCode 150, Striver's SDE Sheet, Sean Prashad's LeetCode Patterns.
- Topic Deep Dives: LeetCode Explore Cards, LeetCode Discuss top-voted compilation threads.
- Company Frequency Signals: Cross-reference problems frequently asked in FAANG / Big Tech interviews.
(Verify problem titles and numbers via live web search; never guess a problem number).
Phase 2: Pattern-First Categorization
Rather than a flat difficulty list, group problems by the underlying technique / sub-pattern:
- E.g., for Binary Search: Classic Sorted Array -> Search on Answer Range -> Rotated / Modified Arrays.
- E.g., for Graphs: BFS Shortest Path -> Topological Sort (Kahn's) -> Disjoint Set Union (Union-Find) -> Dijkstra.
- E.g., for Trees: DFS Traversals / Tree Recursion -> BFS Level-Order -> Lowest Common Ancestor -> Tree Construction.
Master Output Template
# 📘 LeetCode Practice Plan: <Topic Name>
## ⭐ The Essential 3 (80% Interview Yield)
If you only have time to solve three problems on this topic, do these:
1. **[#ID Title](https://leetcode.com/problems/slug/)** — Why: The foundational template problem.
2. **[#ID Title](https://leetcode.com/problems/slug/)** — Why: The classic interview variation.
3. **[#ID Title](https://leetcode.com/problems/slug/)** — Why: The multi-concept or edge-case boundary challenge.
---
## 🧭 Problem Matrix by Pattern & Difficulty
### Sub-Pattern A: [e.g., 1D State / Fixed-Window]
| # | Problem Title | Difficulty | Frequency | Core Insight / Technique | Free vs Premium |
|---|---|---|---|---|---|
| [#123](https://leetcode.com/problems/slug/) | Title Name | 🟢 Easy | High 🔥 | Two-pointer contraction | Free |
| [#456](https://leetcode.com/problems/slug/) | Title Name | 🟡 Medium | High 🔥 | Monotonic deque tracking | Free |
### Sub-Pattern B: [e.g., Grid / State Transformation]
| # | Problem Title | Difficulty | Frequency | Core Insight / Technique | Free vs Premium |
|---|---|---|---|---|---|
| [#789](https://leetcode.com/problems/slug/) | Title Name | 🟡 Medium | Medium | Multi-source BFS queue initialization | Free |
| [#999](https://leetcode.com/problems/slug/) | Title Name | 🔴 Hard | Niche | State compression with bitmask | Premium (Alt: [#FreeAlt]) |
---
## 🪜 Progressive Practice Progression
### 🟢 1. Foundation & Warm-up (2–3 Problems)
Build muscle memory for the core template without confusing edge cases.
- **[#ID Title](https://leetcode.com/problems/slug/)**: Focus on base cases and standard loops.
### 🟡 2. Core Interview Standards (4–6 Problems)
The standard interview difficulty range testing pattern adaptation.
- **[#ID Title](https://leetcode.com/problems/slug/)**: Introduces state tracking and deduplication.
- **[#ID Title](https://leetcode.com/problems/slug/)**: "Hidden" variation where the topic is disguised.
### 🔴 3. Advanced / Mastery (1–2 Problems)
Push boundary conditions and combine multiple data structures.
- **[#ID Title](https://leetcode.com/problems/slug/)**: Complex constraints requiring amortized $O(1)$ updates.
---
## 🗓️ Recommended 7-Day Study Schedule
| Day | Focus / Milestone | Problems to Solve | Estimated Time |
|---|---|---|---|
| **Day 1** | Template & Mechanics | [#123 Title], [#124 Title] | 45 mins |
| **Day 2** | Standard Variations | [#200 Title], [#201 Title] | 60 mins |
| **Day 3** | State Tracking & Edge Traps | [#300 Title] | 60 mins |
| **Day 4** | Mixed Review & Re-solve | Re-solve Day 1 & 2 without looking at solutions | 45 mins |
| **Day 5–6** | Interview Mediums | [#400 Title], [#401 Title] | 90 mins |
| **Day 7** | Timed Mock Challenge | Pick 1 Medium + 1 Hard under 45-min timer | 60 mins |
---
## 💡 Next Steps & Companion Skills
- Want to build the intuition before writing code? Ask for **`problem-intuition`** on any problem above.
- Stuck or code failing hidden test cases? Use **`leetcode-unstuck`** for step-by-step diagnostic coaching.
- Need a complete concept study guide? Use **`dsa-deep-dive`**.
Quality Rules
- Clickable Links Always: Use markdown links pointing to
https://leetcode.com/problems/<slug>/. Never leave naked problem names.
- Include Problem Number: Always include the official LeetCode ID number (
#200, #322, etc.) for instant searchability.
- Handle Premium Gracefully: If a classic problem is LeetCode Premium (e.g.,
#253 Meeting Rooms II, #269 Alien Dictionary), explicitly note it and provide an accessible free alternative (e.g., LintCode equivalent or similar free LeetCode problem).
- Pedagogical Ordering: Problems must be ordered logically (conceptually simplest to most nuanced), never alphabetical or random.
1---2name: leetcode-question-finder3description: Research and assemble the highest-yield LeetCode practice questions for any DSA topic (BFS, DFS, Dynamic Programming, Two Pointers, Monotonic Stack, Sliding Window, Tries, Graphs, etc.). Curates battle-tested problem sets grouped by core pattern and difficulty (Easy/Medium/Hard), with direct URLs, frequency signals, key takeaways, and a structured 7-to-14 day practice sequence. Use when the user asks for "best LeetCode questions for X", "practice questions for DP / graphs", "what LeetCode problems should I do to master sliding window", or wants a curated problem roadmap.4license: MIT5---67# LeetCode Question Finder & Curriculum Curator89A precision curation engine for competitive coding and technical interview preparation. Filters out low-quality and redundant problems to surface the essential canonical LeetCode questions that maximize pattern recognition and interview return on investment.1011---1213## Trigger Phrases1415| User Input | Target Output |16|---|---|17| "Find best BFS questions on LeetCode" | Top canonical BFS problems grouped by sub-pattern (Grid, Tree, Multi-source) |18| "Good practice problems for Dynamic Programming" | Structured roadmap across 1D, 2D Grid, Knapsack, and String DP |19| "What sliding window problems should I practice?" | Progressive practice ladder from fixed-size to dynamic-size windows |20| "Give me a 7-day LeetCode plan for Binary Trees" | Day-by-day milestone schedule mixing warm-ups and core Mediums |2122---2324## Curation Methodology2526### Phase 1: Multi-Source Web & Dataset Research27Always conduct live search across multiple proven curricula to verify problem numbers, canonical names, and frequency:28- **Foundational Curricula:** Blind 75, Grind 75, NeetCode 150, Striver's SDE Sheet, Sean Prashad's LeetCode Patterns.29- **Topic Deep Dives:** LeetCode Explore Cards, LeetCode Discuss top-voted compilation threads.30- **Company Frequency Signals:** Cross-reference problems frequently asked in FAANG / Big Tech interviews.31*(Verify problem titles and numbers via live web search; never guess a problem number).*3233### Phase 2: Pattern-First Categorization34Rather than a flat difficulty list, group problems by the **underlying technique / sub-pattern**:35- E.g., for **Binary Search**: Classic Sorted Array -> Search on Answer Range -> Rotated / Modified Arrays.36- E.g., for **Graphs**: BFS Shortest Path -> Topological Sort (Kahn's) -> Disjoint Set Union (Union-Find) -> Dijkstra.37- E.g., for **Trees**: DFS Traversals / Tree Recursion -> BFS Level-Order -> Lowest Common Ancestor -> Tree Construction.3839---4041## Master Output Template4243```markdown44# 📘 LeetCode Practice Plan: <Topic Name>4546## ⭐ The Essential 3 (80% Interview Yield)47If you only have time to solve three problems on this topic, do these:481. **[#ID Title](https://leetcode.com/problems/slug/)** — Why: The foundational template problem.492. **[#ID Title](https://leetcode.com/problems/slug/)** — Why: The classic interview variation.503. **[#ID Title](https://leetcode.com/problems/slug/)** — Why: The multi-concept or edge-case boundary challenge.5152---5354## 🧭 Problem Matrix by Pattern & Difficulty5556### Sub-Pattern A: [e.g., 1D State / Fixed-Window]57| # | Problem Title | Difficulty | Frequency | Core Insight / Technique | Free vs Premium |58|---|---|---|---|---|---|59| [#123](https://leetcode.com/problems/slug/) | Title Name | 🟢 Easy | High 🔥 | Two-pointer contraction | Free |60| [#456](https://leetcode.com/problems/slug/) | Title Name | 🟡 Medium | High 🔥 | Monotonic deque tracking | Free |6162### Sub-Pattern B: [e.g., Grid / State Transformation]63| # | Problem Title | Difficulty | Frequency | Core Insight / Technique | Free vs Premium |64|---|---|---|---|---|---|65| [#789](https://leetcode.com/problems/slug/) | Title Name | 🟡 Medium | Medium | Multi-source BFS queue initialization | Free |66| [#999](https://leetcode.com/problems/slug/) | Title Name | 🔴 Hard | Niche | State compression with bitmask | Premium (Alt: [#FreeAlt]) |6768---6970## 🪜 Progressive Practice Progression7172### 🟢 1. Foundation & Warm-up (2–3 Problems)73Build muscle memory for the core template without confusing edge cases.74- **[#ID Title](https://leetcode.com/problems/slug/)**: Focus on base cases and standard loops.7576### 🟡 2. Core Interview Standards (4–6 Problems)77The standard interview difficulty range testing pattern adaptation.78- **[#ID Title](https://leetcode.com/problems/slug/)**: Introduces state tracking and deduplication.79- **[#ID Title](https://leetcode.com/problems/slug/)**: "Hidden" variation where the topic is disguised.8081### 🔴 3. Advanced / Mastery (1–2 Problems)82Push boundary conditions and combine multiple data structures.83- **[#ID Title](https://leetcode.com/problems/slug/)**: Complex constraints requiring amortized $O(1)$ updates.8485---8687## 🗓️ Recommended 7-Day Study Schedule8889| Day | Focus / Milestone | Problems to Solve | Estimated Time |90|---|---|---|---|91| **Day 1** | Template & Mechanics | [#123 Title], [#124 Title] | 45 mins |92| **Day 2** | Standard Variations | [#200 Title], [#201 Title] | 60 mins |93| **Day 3** | State Tracking & Edge Traps | [#300 Title] | 60 mins |94| **Day 4** | Mixed Review & Re-solve | Re-solve Day 1 & 2 without looking at solutions | 45 mins |95| **Day 5–6** | Interview Mediums | [#400 Title], [#401 Title] | 90 mins |96| **Day 7** | Timed Mock Challenge | Pick 1 Medium + 1 Hard under 45-min timer | 60 mins |9798---99100## 💡 Next Steps & Companion Skills101- Want to build the intuition before writing code? Ask for **`problem-intuition`** on any problem above.102- Stuck or code failing hidden test cases? Use **`leetcode-unstuck`** for step-by-step diagnostic coaching.103- Need a complete concept study guide? Use **`dsa-deep-dive`**.104```105106---107108## Quality Rules1091101. **Clickable Links Always:** Use markdown links pointing to `https://leetcode.com/problems/<slug>/`. Never leave naked problem names.1112. **Include Problem Number:** Always include the official LeetCode ID number (`#200`, `#322`, etc.) for instant searchability.1123. **Handle Premium Gracefully:** If a classic problem is LeetCode Premium (e.g., `#253 Meeting Rooms II`, `#269 Alien Dictionary`), explicitly note it and provide an accessible free alternative (e.g., LintCode equivalent or similar free LeetCode problem).1134. **Pedagogical Ordering:** Problems must be ordered logically (conceptually simplest to most nuanced), never alphabetical or random.
sumanjeet0012