Data Structures & Algorithms
The core of every technical interview.
Arrays to graphs: complexity, sorting, dynamic programming, and NP-completeness.
Unit 1
Arrays & lists
Dynamic arrays, linked lists, and complexity analysis
Unit 2Stacks & queues
LIFO and FIFO structures and their applications
Unit 3Trees
Binary trees, search trees, and traversals
Unit 4Balanced trees & heaps
AVL trees and priority queues
Unit 5Hash tables
Hashing, collisions, and load factors
Unit 6Sorting
Comparison sorts and their limits
Unit 7Graphs
Representations, BFS, DFS, and shortest paths
Unit 8Dynamic programming
Memoization and classic DP problems
Unit 9Advanced algorithms
Greedy algorithms, NP-completeness, and heuristics