AMAlex Mateoinalexmateo.hashnode.dev·1d ago · 7 min readYou Learned the 7 Patterns. The Hard Problems Combine Them.I spent two months drilling the seven patterns until I could name any of them on sight. Sliding window, two pointers, BFS, DFS, binary search, DP, Dijkstra. Show me a problem, I tell you the pattern. 00
URUttkarsh Ruparelinyhqz.hashnode.dev·2d ago · 1 min readday 0: why i'm logging DSA in publici've solved over 500 problems on leetcode and i still freeze on hards. that's the sentence i needed to say out loud before writing this. final year, placement season, applying to backend roles at comp10
GGunjaningunjantech.hashnode.dev·2d ago · 3 min readMy Journey of Learning DSA as a First-Year Computer Science Student My Journey of Learning DSA and Building Consistency As a first-year Computer Science student, I was exposed to many different suggestions about what I should do in college. Before my college started, 00
AMAlex Mateoinalexmateo.hashnode.dev·Jun 9 · 8 min readI Solved 100 LeetCode Problems Before I Realized I Was Studying the Wrong ThingAt problem 47 I thought I was making progress. At problem 83 I was confident. At problem 100 I felt ready. Then I failed the interview. Not because the problem was impossibly hard. Because I had solve00
AMAlex Mateoinalexmateo.hashnode.dev·Jun 8 · 9 min readHow to Derive Any DP Table From Scratch (Without Memorizing Solutions)Most DP guides teach you solutions. This one teaches you derivation. There is a meaningful difference between the two. When you memorize a solution, you can reproduce it on the exact problem you pract00
MRMuhammad Razainablank-slate.hashnode.dev·Jun 4 · 3 min readDivision into Patterns: Leetcode 01Leetcode questions are all the rage right now. Companies like Meta, Google, localized companies, startups — you name it — have Leetcode questions as a critical aspect of their technical interviews. Wh10
YYashrajinyashrajxdev.blog·Jun 2 · 13 min readMaster Binary Search: Templates, Rotated Arrays, Median of Two Sorted Arrays, and Binary Search on AnswerBinary search is one of the most elegant and efficient algorithms, yet it hides many traps. Off-by-one errors, infinite loops, and confusing mid calculations trip up even experienced developers. Once 00
PSPrakhar Srivastavaincodeintuition.hashnode.dev·May 28 · 5 min readIterative Tree Traversal: Turning Recursion Into an Explicit Stack You can write recursive inorder in your sleep. Three lines and a base case. Then an interviewer asks for the iterative version, and the clean recursion you leaned on becomes a puzzle about when to pus00
PSPrakhar Srivastavaincodeintuition.hashnode.dev·May 26 · 11 min readBinary Tree Recursion Patterns Mapped to Information Flow You've solved 50 tree problems. You know what preorder, postorder, inorder, and level order mean. On problem 51 your interviewer hands you something unfamiliar and you have 35 minutes. You sketch the 00
SPSneha Poojaryindsamadesimple.hashnode.dev·May 26 · 4 min readSliding Window Algorithm Explained Visually | From Brute Force to OptimizationIf you’ve solved DSA problems before, chances are you’ve come across questions like: Longest Substring Without Repeating Characters Maximum Sum Subarray of Size K Minimum Window Substring At firs00