Sign in

Data Structures and Algorithms

The DSA roadmap: complexity, arrays, linked lists, stacks, queues, trees, graphs and dynamic programming.

Chapters: 7
Topics: 22
Lectures: 0

Chapters

1Chapter 1 – Complexity Analysis2 topics · 0 lectures
- Big-O Notation
  Lectures coming soon
- Time vs Space Complexity
  Lectures coming soon
Open chapter →
2Chapter 2 – Arrays and Strings3 topics · 0 lectures
- Two Pointers
  Lectures coming soon
- Sliding Window
  Lectures coming soon
- Prefix Sums
  Lectures coming soon
Open chapter →
3Chapter 3 – Linked List5 topics · 0 lectures
Nodes connected by pointers: insertion, deletion, reversal and cycle detection.
- Linked List Basics
  Lectures coming soon
- Singly Linked List
  Lectures coming soon
- Doubly Linked List
  Lectures coming soon
- Circular Linked List
  Lectures coming soon
- Reversing a Linked List
  Lectures coming soon
Open chapter →
4Chapter 4 – Stacks and Queues3 topics · 0 lectures
- Stack
  Lectures coming soon
- Queue
  Lectures coming soon
- Monotonic Stack
  Lectures coming soon
Open chapter →
5Chapter 5 – Trees3 topics · 0 lectures
- Binary Trees
  Lectures coming soon
- Binary Search Trees
  Lectures coming soon
- Tree Traversals
  Lectures coming soon
Open chapter →
6Chapter 6 – Graphs3 topics · 0 lectures
- Graph Representation
  Lectures coming soon
- BFS and DFS
  Lectures coming soon
- Shortest Paths
  Lectures coming soon
Open chapter →
7Chapter 7 – Dynamic Programming3 topics · 0 lectures
- Memoization
  Lectures coming soon
- Tabulation
  Lectures coming soon
- Classic DP Problems
  Lectures coming soon
Open chapter →