Data Structures & Algorithms

Data Structures & Algorithms

Arrays, linked lists, trees, graphs, hash maps, sorting, searching, dynamic programming, and complexity analysis. Master the patterns that underpin every technical interview and production system.

FundamentalsTopics 0–15

·Why D&A Matters
·Big O Notation
·Arrays
·Strings
·Linked Lists
·Doubly Linked Lists
·Stacks
·Queues
·Hash Maps
·Sets
·Recursion
·Binary Search
·Bubble, Selection & Insertion Sort
·Merge Sort
·Quick Sort
·Two Pointers

Start Fundamentals →

IntermediateTopics 16–30

·Binary Trees
·Binary Search Trees
·Tree Traversals
·Heaps & Priority Queues
·Tries
·Graph Representation
·Breadth-First Search
·Depth-First Search
·Topological Sort
·Union-Find
·Sliding Window
·Prefix Sums
·Bit Manipulation
·Greedy Algorithms
·Divide and Conquer

Start Intermediate →

AdvancedTopics 31–45

·Dynamic Programming: Foundations
·DP: 1D Patterns
·DP: 2D Patterns
·DP: Knapsack
·Backtracking
·Dijkstra's Algorithm
·Bellman-Ford
·Floyd-Warshall
·Minimum Spanning Tree
·Segment Trees
·Fenwick Trees (BIT)
·String Matching
·Monotonic Stack Patterns
·Matrix Problems
·Advanced Graph Problems

Start Advanced →

Interview PatternsTopics 46–60

·Fast & Slow Pointers
·Merge Intervals
·Cyclic Sort
·In-place Linked List Reversal
·Tree BFS Patterns
·Tree DFS Patterns
·Two Heaps Pattern
·Top K Elements
·K-way Merge
·Modified Binary Search
·Subsets & Combinations
·DP Interview Patterns
·Graph Interview Patterns
·Interview Strategy
·Complexity Cheat Sheet

Start Interview Patterns →