Skip to content
Home
Programming
Data Structures

Data Structures

Data structures guides covering fundamental and advanced data structures, their implementations, trade-offs, and when to use each one.

Learning Path — 18 articles

1 Data Structures Guide with Complexity Cheat Sheet Data Structures Guide with Complexity Cheat Sheet. Understand the essentials of data structures guide — from … 8 min Start Here 2 Trees and Graphs Guide — Data Structures and Algorithms Learn trees and graphs — binary trees, BST, AVL trees, graph representations, traversal algorithms, and solving problems … 8 min Start Here 3 Arrays and Linked Lists — Performance Trade-offs Guide Arrays and Linked Lists — Performance Trade-offs Guide. A practical guide to arrays linked lists guide, covering key … 8 min Start Here 4 Hash Tables Guide — Design and Collision Resolution Hash Tables Guide — Design and Collision Resolution. An accessible introduction to hash tables guide, exploring key … 8 min 5 Stacks and Queues Guide — LIFO and FIFO Patterns Stacks and Queues Guide — LIFO and FIFO Patterns. Everything you need to get started with stacks queues guide, explained … 8 min 6 Heaps and Priority Queues Guide with Heap Sort Heaps and Priority Queues Guide with Heap Sort. Everything you need to get started with heaps priority queues guide, … 8 min 7 Graph Algorithms Guide — BFS, DFS, Shortest Paths Graph Algorithms Guide — BFS, DFS, Shortest Paths. Discover the principles and practices of graph algorithms guide in … 8 min 8 Trie Data Structure Guide — Prefix Trees for Strings Trie Data Structure Guide — Prefix Trees for Strings. A practical guide to tries guide, covering key concepts, … 8 min 9 Sorting Algorithms: Complete Guide Learn sorting algorithms — comparison sorts (quick, merge, heap) vs non-comparison (counting, radix), complexity, … 8 min 10 Searching Algorithms Guide — Linear and Binary Search Searching Algorithms Guide — Linear and Binary Search. Learn what you need to know about searching algorithms guide: … 8 min 11 Dynamic Programming: From Basics to Advanced Learn dynamic programming — memoization, tabulation, optimal substructure, overlapping subproblems, classic DP problems, … 8 min 12 Greedy Algorithms: When Local Optima Build Global Solutions Learn greedy algorithms — making locally optimal choices, proof techniques, fractional knapsack, Huffman coding, and … 8 min 13 Divide and Conquer: Breaking Problems Down Learn divide and conquer — recursion, master theorem, merge sort, quick sort, binary search, closest pair, and analyzing … 7 min 14 Recursion: Thinking Recursively Learn recursion — base cases, recursive cases, stack frames, tail recursion, backtracking, recursion trees, and … 8 min 15 Bloom Filters and Probabilistic Data Structures Bloom Filters and Probabilistic Data Structures. Learn what you need to know about bloom filters probabilistic guide: … 7 min 16 String Data Structures Guide Learn string data structures — suffix trees, tries, Aho-Corasick, Knuth-Morris-Pratt, Z-algorithm, Rabin-Karp, and … 8 min Advanced 17 Approximate Nearest Neighbor Search Learn approximate nearest neighbor search — locality-sensitive hashing, product quantization, HNSW, ANNOY, and vector … 7 min Advanced 18 Spatial Data Structures: Quadtrees and KD-Trees Learn spatial data structures — quadtrees, kd-trees, R-trees, spatial indexing, range queries, nearest neighbor search, … 8 min Advanced