📝 Coding Interview Quiz Bank
Test your pattern recognition and algorithmic thinking.
How to Use
- Quiz Mode: Answer questions to test recall
- Flashcard Mode: Review patterns with spaced repetition
- Track Progress: Note which patterns need more practice
Topics Covered
| Category | Key Concepts |
|---|---|
| Data Structures | Arrays, HashMaps, Stacks, Heaps, Trees |
| Big O | Time/space complexity analysis |
| Core Patterns | Two Pointers, Sliding Window, Binary Search |
| Advanced | DP, Backtracking, Graphs, BFS/DFS |
Pattern Quick Reference
| Pattern | Trigger | Template |
|---|---|---|
| Two Pointers | Sorted + pair | left=0, right=n-1 |
| Sliding Window | Subarray/substring | for right: while invalid: left++ |
| Binary Search | Sorted + O(log n) | while left <= right: mid |
| BFS | Shortest path, levels | Queue + visited set |
| DFS | All paths, tree/graph | Recursion or stack |
| Backtracking | Generate combinations | Choose → Explore → Unchoose |
| DP | Count ways, optimize | State + transition + base case |
| Heap | Top K, priority | heapq with size k |