Array and Linked List Fundamentals for Coding Interviews
Time Complexity Basics
Common time complexities sorted from fastest to slowest:
O(1) < O(log n) < O(n) < O(n log n) < O(n²) < O(n³) < O(2ⁿ) < O(n!) < O(nⁿ)
LeetCode Training
Chinese site: https://leetcode-cn.com/problemset/all/
English site: https://leetcode.com/
Arrays
Time Complexity
Arrays occupy contiguous memory blo ...
Posted on Fri, 24 Jul 2026 16:11:34 +0000 by TheLoveableMonty