Apr 5 · 32 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!)), derive time and space complexity by counting loops and ...
Join discussionFeb 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
Nov 29, 2025 · 11 min read · Time and Space Complexities are fundamental concepts in computer science used to measure the performance and resource usage of an algorithm. 1. What Do Time & Space Complexities Mean? Time Complexity Time complexity measures the amount of time an al...
Join discussion
Nov 22, 2025 · 9 min read · Have you ever written code that works perfectly on your local machine with 10 items, but completely freezes when you test it with 10,000 items? I have. And it’s usually not because the logic is broken - it’s because the logic isn't scalable. And toda...
Join discussion
Nov 8, 2025 · 4 min read · Welcome to the second part of the DSA learning series. If you haven't read the first part, I highly recommend giving it a read. So, let's move on to today's topic. You might have guessed what we will discuss in this article. Space and time complexity...
Join discussionNov 8, 2025 · 10 min read · Google to test building AI Data Centres in Space When I first read that Google plans to build AI data centers in space, I thought it was satire. Then I read the technical paper. Then I talked to researchers working on the project. This isn't science...
Join discussionOct 11, 2025 · 15 min read · 🧨 A Broken Code Story A developer had written this beautiful function to find duplicate user accounts. Worked like a charm in testing with a sample dataset of 50 users. The tech lead approved it and was shipped it to production. Two hours later, the...
Join discussion
Oct 1, 2025 · 2 min read · You are given a positive integer n. A positive integer is a base-10 component if it is the product of a single digit from 1 to 9 and a non-negative power of 10. For example, 500, 30, and 7 are base-10 components, while 537, 102, and 11 are not. Expre...
Join discussionSep 17, 2025 · 2 min read · Many times there are more than one ways to solve a problem with different algorithms and we need a way to compare multiple ways. Also, there are situations where we would like to know how much time and resources an algorithm might take when implement...
Join discussion
