© 2026 Hashnode
Why Do We Need Time Complexity ? Let’s understand this with a simple real-life coding example. Imagine two developers, Ram and Bharat, are given the same programming problem. Ram writes a solution in 112 lines of code Bharat solves the same problem...

Note : I’ve officially started my 27-day DSA journey using Striver’s SDE Sheet. Over the next few weeks, I’ll be journaling my progress daily — breaking down brute-force to optimal solutions, writing clean Java code, analyzing time and space complex...

Imagine searching for a solution on stackoverflow you came across two solution one is of 2 lines another is 10 lines there is a great chance that you will pick the one with 2 lines. But wait that’s now always right. Understanding Time Complexity Tim...

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...
