Jan 26 · 3 min read · One morning I wanted to eat some pizza , so i asked my brother to get me some from pizza hut which is near 2 km. He got me the pizza and I was happy only to realise it was too less for 29 friends who came to my have for a surprise visit! My brother c...
Join discussion
Jan 12 · 3 min read · Big-O notation has been drilled into us since our first data structures class. O(1) good.O(n) acceptable.O(n log n) fine.O(n²) bad. We memorize it for interviews, use it to compare algorithms, and treat it as the final word on performance. But once y...
Join discussion
Dec 23, 2025 · 9 min read · Introduction When you first start programming, you're mostly focused on getting your code to work. Does it produce the right output? Does it handle the basic test cases? That's great, but there's another question you should be asking: how fast does i...
Join discussion
Dec 2, 2025 · 3 min read · If you’re anything like me, the first time someone explained Big-O notation, it felt like they were trying to measure my code using math from another galaxy. “This algorithm is O(n log n).”“Bro… I just want my code to work.” Same energy. But the deep...
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
Sep 11, 2025 · 3 min read · When you write code, there are a multitude of ways to solve problems and make your ideas come to life. But there’s one thing to note: We are programmers! We are LAZY! This is why whenever we write code, we should always double-check that it’s the sim...
Join discussionAug 26, 2025 · 5 min read · Entender la base de Logaritmo Antes de explicar el Big O notation es necesario explicar qué es un logaritmo. Un logaritmo es preguntar cuántas multiplicaciones del mismo número X son necesarias para llegar a un número Y. EJ: \(2^x= 8\)¿Cuántos 2 ten...
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 22, 2025 · 7 min read · There are often many ways to solve a problem. These different approaches are called algorithms. An algorithm is just a clear, well-defined set of step-by-step instructions that a computer follows to perform a computation. For example, if you want to ...
Join discussion
