Coding Patterns Quick Reference
Stop memorizing 300 problems — learn the 15 patterns that solve them. Sliding window, two pointers, BFS/DFS, DP and more, each with Python and JavaScript solutions.
📁 File Structure 32 files
├── LICENSE
├── README.md
├── cheatsheets/
│ ├── complexity-reference.md
│ ├── pattern-selection-guide.md
├── free-sample.zip
├── guide/
│ ├── 01-overview.md
│ ├── 02-sliding-window-and-two-pointers.md
│ ├── 03-dynamic-programming-patterns.md
├── index.html
├── interactive.html
├── patterns/
│ ├── 01-sliding-window.md
│ ├── 02-two-pointers.md
│ ├── 03-fast-slow-pointers.md
│ ├── 04-merge-intervals.md
│ ├── 05-cyclic-sort.md
│ ├── 06-in-place-reversal.md
│ ├── 07-bfs.md
│ ├── 08-dfs.md
│ ├── 09-two-heaps.md
│ ├── 10-subsets.md
│ ├── 11-binary-search-modified.md
│ ├── 12-bitwise-xor.md
│ ├── 13-top-k-elements.md
│ ├── 14-k-way-merge.md
│ ├── 15-dynamic-programming.md
├── solutions/
│ ├── README.md
│ ├── binary_search.py
│ ├── dynamic_programming.py
│ ├── graph_traversal.py
│ ├── sliding_window.py
│ ├── two_pointers.py
├── study-plan/
│ ├── coding-prep-plan.md
📖 Documentation Preview README excerpt
Coding Patterns Quick Reference
> 15 essential coding patterns with 60+ fully solved problems in Python and JavaScript.
> Master the patterns that appear in 95% of technical interviews.
What's Inside
| Directory | Contents |
|---|---|
| `patterns/` | 15 in-depth pattern guides with 3-4 solved problems each |
| `cheatsheets/` | Pattern selection guide + Big-O complexity reference |
| `solutions/` | Runnable Python files with test cases for core patterns |
| `study-plan/` | 4-week structured preparation plan |
Pattern Index
| # | Pattern | Difficulty | Key Signal |
|---|---|---|---|
| 01 | [Sliding Window](patterns/01-sliding-window.md) | Easy-Medium | Contiguous subarray/substring, fixed or variable size |
| 02 | [Two Pointers](patterns/02-two-pointers.md) | Easy-Medium | Sorted array, pair finding, partitioning |
| 03 | [Fast & Slow Pointers](patterns/03-fast-slow-pointers.md) | Medium | Cycle detection, linked list middle/nth node |
| 04 | [Merge Intervals](patterns/04-merge-intervals.md) | Medium | Overlapping intervals, scheduling |
| 05 | [Cyclic Sort](patterns/05-cyclic-sort.md) | Medium | Numbers in range [0, n] or [1, n], missing/duplicate |
| 06 | [In-Place Reversal](patterns/06-in-place-reversal.md) | Medium | Reverse linked list or sub-list in-place |
| 07 | [BFS](patterns/07-bfs.md) | Medium | Level-order traversal, shortest path (unweighted) |
| 08 | [DFS](patterns/08-dfs.md) | Medium | Tree paths, graph exploration, backtracking |
| 09 | [Two Heaps](patterns/09-two-heaps.md) | Medium-Hard | Find median, split into two halves |
| 10 | [Subsets](patterns/10-subsets.md) | Medium | Generate permutations, combinations, power set |
| 11 | [Modified Binary Search](patterns/11-binary-search-modified.md) | Medium | Sorted/rotated array, find boundary, answer space |
| 12 | [Bitwise XOR](patterns/12-bitwise-xor.md) | Medium | Find single/missing numbers without extra space |
| 13 | [Top K Elements](patterns/13-top-k-elements.md) | Medium | Kth largest/smallest, most frequent |
| 14 | [K-Way Merge](patterns/14-k-way-merge.md) | Hard | Merge K sorted lists, external sort |
| 15 | [Dynamic Programming](patterns/15-dynamic-programming.md) | Hard | Optimization over overlapping subproblems |
Recommended Study Order
Study patterns in this order, grouped by difficulty:
Week 1 — Foundation Patterns (build intuition)
1. Sliding Window
2. Two Pointers
3. Modified Binary Search
Week 2 — Linked List & Array Patterns
4. Fast & Slow Pointers
5. In-Place Reversal
6. Merge Intervals
7. Cyclic Sort
Week 3 — Tree, Graph & Combinatorial Patterns
8. BFS
9. DFS
10. Subsets
11. Bitwise XOR
Week 4 — Advanced Patterns
12. Two Heaps
13. Top K Elements
14. K-Way Merge
15. Dynamic Programming
... preview truncated, see full README in product download.
📄 Code Sample .json preview
📅 Changelog
v1.0.0 — Initial release.
Purchases include lifetime updates. Check the product page for the latest version.
📄 Product Preview
Try the interactive reader and demo tools below, or get the full product with all content unlocked.
📖 Interactive Reader (Free Preview)⚙ Try Demo Tools📦 Download Free Sample❓ Frequently Asked Questions
What license is this under?
MIT License. You can use it in commercial, client, and internal projects. See our license terms page for details.
How do I download after purchase?
Immediately after purchase, you'll be redirected to a download page. A download link is also sent to your email.
Do I get updates?
Yes. All products include lifetime updates at no extra cost. Re-download anytime for the latest version.
What if it doesn't work for me?
DM @DatanestDigital on X and we'll make it right.
Can I get a refund?
DM @DatanestDigital on X with your order number and we'll help.
Is there support?
DM @DatanestDigital on X. We respond within 1-2 business days.