Abstract AlgorithmsAbstract Algorithms

  • Home
  • All Posts
  • All Series
  • About

Category

big o

1 article

Big O Notation Explained: Time Complexity, Space Complexity, and Why They Matter in Interviews

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

Apr 5, 2026•32 min read

Abstract Algorithms

Exploring the fascinating world of algorithms, data structures, and software engineering through clear explanations and practical examples.

Navigation

  • Home
  • All Posts
  • All Series
  • About

Series

  • System Design Interview Prep
  • How It Works: Internals Explained
  • Architecture Patterns for Production Systems
  • Data Structures and Algorithms

Popular Topics

  • distributed systems
  • System Design
  • data structures
  • consistency
  • Databases
  • algorithms

Author

Abstract Algorithms

Abstract Algorithms

@abstractalgorithms

1 followers on Hashnode

© 2026 Abstract Algorithms. All rights reserved.

Powered by Hashnode