Author: Daniel Deshmukh
| Metric | Value |
|---|---|
| Username | deshmukhdaniel |
| Profile | leetcode.com/u/deshmukhdaniel |
| Languages | Python (2 solved), C++ (1 solved) |
| Skills | Array, Two Pointers, String, Hash Table, Binary Search |
Learn DSA patterns in Python first, then translate to Java once a pattern clicks. Organized by the 15 core patterns — not by problem number.
- Learn the logic in Python (fast to write, less boilerplate). Once a pattern clicks, redo 2-3 problems of that same pattern in Java.
- Every problem you solve, ask "what pattern is this?" before you code. That's the actual skill interviewers test.
| # | Pattern | Folder | Solved |
|---|---|---|---|
| 1 | Two Pointers | two-pointers/ |
0 |
| 2 | Sliding Window | sliding-window/ |
0 |
| 3 | Fast & Slow Pointers | fast-slow-pointers/ |
0 |
| 4 | Merge Intervals | merge-intervals/ |
0 |
| 5 | Cyclic Sort | cyclic-sort/ |
0 |
| 6 | Linked List Reversal | linked-list-reversal/ |
0 |
| 7 | BFS | bfs/ |
0 |
| 8 | DFS | dfs-backtracking/ |
0 |
| 9 | Two Heaps | top-k-heap/ |
0 |
| 10 | Backtracking | dfs-backtracking/ |
0 |
| 11 | Modified Binary Search | binary-search/ |
0 |
| 12 | Top K Elements | top-k-heap/ |
0 |
| 13 | K-way Merge | k-way-merge/ |
0 |
| 14 | DP (Knapsack) | dp-2d/ |
0 |
| 15 | DP (Fibonacci) | dp-1d/ |
0 |
| 16 | Greedy | greedy/ |
0 |
| 17 | Topological Sort | topological-sort/ |
0 |
| 18 | Trie | trie/ |
0 |
| 19 | Union-Find | union-find/ |
0 |
| 20 | Monotonic Stack | monotonic-stack/ |
0 |
| Week | Focus |
|---|---|
| 1 | Syntax + core DS (Phase 0-1) |
| 2 | Two pointers, sliding window, binary search, hashing |
| 3 | Stack, BFS/DFS, backtracking, tree traversal |
| 4 | Union-Find, heaps, start DP |
| 5 | DP deep dive (1D → 2D), prefix sums |
| 6 | Mixed problem sets, timed mocks, redo weak patterns |
- NeetCode 150 — curated problems grouped by pattern
- LeetCode — filter by company tags
- Grokking the Coding Interview — patterns course