Iterative Tree Traversal: Turning Recursion Into an Explicit Stack
Prakhar Srivastava
Command Palette
Search for a command to run...
Archive
17 posts published so far
Binary Tree Recursion Patterns Mapped to Information Flow
Prakhar Srivastava
Binary tree Interview Questions: 6 Patterns Behind Every FAANG Problem
Prakhar Srivastava
Binary Search Tree Time Complexity: Why O(log n) Isn't Guaranteed
Prakhar Srivastava
Big O Notation Explained: Growth Rate, Not Operation Count
Prakhar Srivastava
BFS vs DFS: How to Pick the Right Graph Traversal
Prakhar Srivastava
How Backtracking Works: One Skeleton for Every Problem
Prakhar Srivastava
AVL Trees Explained: Rotations, Balance Factors, and Self-Balancing BSTs
Prakhar Srivastava
Amazon vs Google vs Meta: The DSA Patterns Each Company Tests
Prakhar Srivastava
Amazon Bar Raiser: The 10 Minutes That Decide the Coding Round
Prakhar Srivastava
Arrays vs Linked Lists: The O(1) Insertion Myth
Prakhar Srivastava
Am I Ready for FAANG? A 2 Hour Test That Actually Tells You
Prakhar Srivastava
How to Build Algorithmic Intuition for Coding Interviews
Prakhar Srivastava
When the Interviewer Asks: “Why Does This Algorithm Work?”
Prakhar Srivastava
AlgoExpert vs NeetCode: Why Watching Walkthroughs Isn't Enough
Prakhar Srivastava
FAANG Prep: A 90 Day Week by Week Roadmap
Prakhar Srivastava
Why LeetCode Practice Stops Working (And What to Train Instead)
Prakhar Srivastava