Dec 5, 2025 · 13 min read · Confession time. The first time someone mentioned "Big O Notation" in a tech conversation, I nodded along like I knew exactly what they were talking about. I did not know what they were talking about. My brain went: "Big O? Is that a rapper? A DJ? So...
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
Aug 26, 2025 · 5 min read · Understanding the Base of a Logarithm Before explaining Big O notation, it's necessary to explain what a logarithm is. A logarithm asks how many multiplications of the same number X are needed to reach a number Y. Ex: \(2^x = 8\) How many 2s do I ne...
Join discussion
Jul 2, 2025 · 5 min read · I remember reading a programming book which said, “Write Code That Is Clean And Reusable“. I always wondered what “Clean And Reusable Code“ meant. As a beginner in programming, it was really out of my level to understand the difference between brute-...
Join discussion
Jul 14, 2024 · 3 min read · Big O notation is a mathematical concept used to describe an algorithm's performance or complexity. It shows how the runtime or space needs of an algorithm increase as the input size grow. If the pace of an algorithm is not known, it will be difficul...
Join discussion
Dec 31, 2023 · 2 min read · Demystifying Big O Notation: Why Should You Care? Hey there, fellow coder! Let’s talk about this funky thing called Big O notation. It might sound like jargon at first, but trust me, understanding it can level up your coding game big time! What’s the...
Join discussionJul 27, 2023 · 2 min read · Introduction Big O notation serves as a compass in the vast landscape of algorithmic analysis, guiding developers to navigate the efficiency and scalability of their code. Big O of N!, denoted as O(N!), represents a factorial time complexity, signify...
Join discussion
Jul 26, 2023 · 2 min read · Introduction In the realm of algorithm analysis, Big O notation acts as a guiding compass for developers to navigate the efficiency of their code. Big O of 2^N, denoted as O(2^N), represents an exponential time complexity, signifying that the executi...
Join discussion
Jul 25, 2023 · 3 min read · Introduction In the world of algorithms and computational analysis, the understanding of Big O notation plays a significant role in deciphering the time complexity of algorithms. Big O of N log N, represented as O(N log N), denotes a logarithmic-line...
Join discussion
Jul 24, 2023 · 3 min read · Introduction In the realm of algorithm analysis, Big O notation serves as a guiding light for developers seeking to optimize the efficiency of their code. Big O of Log N, denoted as O(log N), represents a logarithmic time complexity, implying that an...
Join discussion