Big O
Articles and practice problems tagged Big O.
Articles
Data Structures
Arrays Explained: How They Work and What Each Operation Costs
How arrays store data in memory, why reading by index is O(1) but inserting at the front is O(n), and what that means for JavaScript arrays.
· 8 min read
Fundamentals
Big O Notation Explained
What Big O notation measures, the common complexity classes from O(1) to O(2^n), and how to work out the time and space complexity of your own code.
· 10 min read
Fundamentals
Data Structures and Algorithms: What They Are and Where to Start
What data structures and algorithms are, why they are learned together, and the order to study them in if you are starting from zero.
· 8 min read
Data Structures
Hash Tables Explained: How Map and Set Find Things Instantly
How a hash table turns a key into a position, why lookups are O(1) on average, how collisions are handled, and when to use Map and Set in JavaScript.
· 10 min read