5d ago · 25 min read · TLDR: This is the code companion to the Parking Lot System Design post. We implement the core classes (ParkingLot, ParkingSpot, Ticket) in Java, apply the Singleton, Factory, and Strategy patterns, and use a Min-Heap to find the nearest available spo...
Join discussion5d ago · 13 min read · TLDR: Backtracking is "Recursion with Undo." You try a path, explore it deeply, and if it fails, you undo your last decision and try the next option. It explores the full search space but prunes invalid branches early, making it far more efficient th...
Join discussionJan 29 · 6 min read · "A man, a plan, a canal: Panama" - Is this a palindrome? Most beginners say NO because of spaces and punctuation. But here's the thing: it is a palindrome when you know how to check properly. Let me show you why this simple problem teaches you string...
Join discussion
Jan 28 · 4 min read · Ever wondered why a simple "reverse a string" question appears in almost every coding interview? It's not just about flipping characters. It's about understanding time complexity, space optimization, and multiple problem-solving approaches. Let's div...
Join discussion
Jan 18 · 3 min read · If you’re having a coding interview, and that you are overwhelmed by the number of coding problems out there, you’re not alone. Especially when you are in a hurry, you want to grasp as much problem solving skills as possible, and this article ( and o...
Join discussion
Jan 11 · 4 min read · https://youtu.be/3HTKc-ZgZbg?si=RDDcTwm-3EzP66P8 Understanding What Happens Behind the Scenes When you write your first "Hello World" program in Python, you're just scratching the surface of what's actually happening inside your machine. While most...
Join discussionJan 6 · 5 min read · If Part 1 helped you clear your Java fundamentals and avoid rookie mistakes, Part 2 is where things get serious. In this second part of the series, we move beyond basics and step into the real interview battlefield — the kind where interviewers test ...
Join discussionJan 2 · 3 min read · LeetCode 961: N-Repeated Element in Size 2N Array is usually solved with a simple Hash Set (O(N) space) or randomized checks. But recently, I challenged myself to solve it deterministically using O(1) space. The result? A modified version of Moore’s ...
Join discussion
Jan 2 · 9 min read · Read This Before Your Next Automation Interview (Seriously.) Let’s cut the nonsense. Automation interviews don’t reject you because you don’t know Selenium, Appium, or APIs.They reject you because you sound like everyone else. Same definitions.Same t...
Join discussionDec 20, 2025 · 3 min read · Binary trees are one of the most fundamental data structures in computer science. They appear everywhere—from database indexing and file systems to compilers and interview questions. If you're learning DSA or preparing for technical interviews, under...
Join discussion