Know Thy Complexities!

algorithmscomplexitybig-odata-structuresinterview-prep

Abstraction: Big-O complexity cheat sheet for common algorithms and data structures

Key points:

Covers best, average, and worst-case time and space complexities for common sorting and search algorithms
Created to consolidate interview preparation material on algorithm complexity in one reference
Includes complexities for data structures used in CS: arrays, linked lists, trees, heaps, hash tables, graphs
Author vetted the resource through interviews at Google, Facebook, Yahoo, LinkedIn, and Uber
Sorting algorithms vary widely: e.g., quicksort O(n log n) average but O(n²) worst; merge sort O(n log n) all cases

Connections: Algorithmic Complexity · Big O Notation · Data Structures