Library › Data Structures & Algorithms
DSA-WB
Data Structures & Algorithms
From arrays to graphs and dynamic programming — the patterns interviewers actually test, drilled.
- 01Complexity Analysis & Big-O A — Foundations
- 02Arrays & Two Pointers B — Linear Structures
- 03Sliding Window B — Linear Structures
- 04Strings B — Linear Structures
- 05Hashing & Hash Maps B — Linear Structures
- 06Stacks & Queues B — Linear Structures
- 07Linked Lists B — Linear Structures
- 08Searching: Linear & Binary C — Searching & Sorting
- 09Sorting Algorithms C — Searching & Sorting
- 10Recursion & Backtracking D — Recursion & Trees
- 11Trees & Binary Search Trees D — Recursion & Trees
- 12Heaps & Priority Queues D — Recursion & Trees
- 13Graphs: BFS & DFS E — Graphs & Optimization
- 14Dynamic Programming E — Graphs & Optimization
- 15Greedy & Bit Manipulation E — Graphs & Optimization
- 16Matrix & 2D Arrays F — Specialized Topics
- 17Number Theory & Math for DSA F — Specialized Topics
- 18Intervals & Range Problems F — Specialized Topics
Open the interactive reader →
Same content with progress tracking and self-check drills.