Overview
Big O notation, complexity comparison table, and when to use each data structure
Arrays & Strings
Static/dynamic arrays, string manipulation, two-pointer technique, and sliding window
Linked Lists
Singly, doubly, circular linked lists, fast & slow pointer technique
Stacks & Queues
LIFO/FIFO, monotonic stack, deque, and priority queue applications
Hash Tables
Hash functions, collision resolution, and common use cases
Trees
Binary tree, BST, AVL, traversals (inorder, preorder, postorder, BFS)
Heaps
Min/max heap, heapify, and top-K elements problems
Graphs
Adjacency list/matrix, directed/undirected, weighted graphs
Tries
Prefix trees, autocomplete, and word search problems