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 13 · 11 min read · 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...
Join discussion
Aug 5, 2025 · 2 min read · 알고리즘의 성능을 나타내는 척도로는 일반적으로 **복잡도(Complexity)**를 사용합니다. 복잡도는 크게 시간 복잡도와 공간 복잡도로 나뉘며, 각각 알고리즘이 실행되는 데 걸리는 시간과 필요한 메모리 공간의 양을 의미합니다. 동일한 기능을 수행하는 알고리즘이라면, 복잡도가 낮은 쪽이 더 효율적인 것으로 간주됩니다. 다만 시간과 공간은 종종 트레이드오프 관계에 있기 때문에, 코딩 테스트와 같은 환경에서는 메모리를 좀 더 사용하는 대신 실행 ...
Join discussionJul 15, 2025 · 8 min read · 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...
IIrfanulhak commented
May 4, 2025 · 3 min read · 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...
Join discussion
May 4, 2025 · 3 min read · Time complexity tells us how fast or slow an algorithm is as the input grows. It doesn't give the actual time in seconds, but gives a mathematical idea of how performance will scale. Case 1: One by One Search – O(n) You have a list of fruits and yo...
Join discussion
Apr 7, 2025 · 1 min read · When we talk about time complexity, we often associate it with backend systems, algorithms, and data science. But in the modern web, where front-end applications are increasingly data-driven and state-heavy, understanding time complexity is not just ...
Join discussion
Dec 31, 2024 · 3 min read · When analyzing algorithms, the concept of space complexity often accompanies its counterpart, time complexity. However, the term is frequently misused or conflated with auxiliary space. This article clarifies the differences, highlights their signi...
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
