May 25 · 10 min read · You learn that a binary search tree gives you O(log n) search, insertion, and deletion. Then you feed it a sorted array of timestamps from a log and the tree degenerates into a linked list. Every sear
Join discussion
Apr 5 · 34 min read · TLDR: Big O notation describes how an algorithm's resource usage grows as input size grows — not how fast it runs on your laptop. Learn to identify the 7 complexity classes (O(1) through O(n!)), deriv
Join discussionMar 20 · 8 min read · for example: arr1 = [1, 3, 2, 1, 4, 5] arr2 = [3, 2, 2, 1, 1] answer = [3, 2, 1] simple enough right? and if you've done even a little bit of DSA prep your brain immediately goes - HashSet. put all e
Join discussion
Feb 4 · 14 min read · Imagine you've just created an algorithm, and it works lightning-fast on your brand-new computer. You're thrilled with the results and can't wait to share your success, so you ask your friend to give it a try. However, when your friend runs the same ...
Join discussion
Jan 30 · 9 min read · Introduction: Why This Matters You're building a dashboard that displays sales data. You need to find the highest sale to set the Y-axis scale on your chart. Or maybe you're processing sensor data and need to identify peak values. Finding the maximum...
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 6 · 7 min read · Your code works. It runs. It produces the right output. But here's the question nobody asks beginners: How well does it work? You write a function that searches through a list. It works for 10 items. It works for 100 items. But what happens when you ...
Join discussion
Jan 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
