Algorithms and data structures

All topics · Alphabetical index

Concepts

• Big O; Big Theta; Big Omega; amortized analysis
• Arrays; linked lists; stacks; queues; deques; ring buffers
• Hash maps; hash sets; collision resolution; load factor
• Heaps; priority queues; balanced search trees; tries
• B-trees; B+ trees; LSM trees; skip lists
• Binary search; two pointers; sliding window; prefix sums; difference arrays
• Recursion; backtracking; divide and conquer; greedy algorithms; dynamic programming
• BFS; DFS; topological sorting; cycle detection; strongly connected components
• Shortest paths; minimum spanning trees; union-find
• Segment trees; Fenwick trees; interval trees
• Bloom filters; Count-Min Sketch; HyperLogLog; reservoir sampling
• Consistent hashing; rendezvous hashing; sorting stability

Further reading

Reference links for this topic.

• Open Data Structures