Vanakkam DSA Learning Hub
A complete reference for both DSA courses from lms.vanakkamdsa.com. All notes, videos, resources and a problem tracker — fully organised for efficient study.
Navigation
- Course 1 — Vanakkam DSA - HR Community (8 sections · 41 chapters)
- Course 2 — Vanakkam DSA - Cohort III (29 sections · 311 chapters)
- Problem Tracker — Checklist to track your LeetCode / DSA problem solving progress
Quick Stats
| Course 1 (HR Community) | Course 2 (Cohort III) | |
|---|---|---|
| Sections | 8 | 29 |
| Chapters | 41 | 311 |
| Total Videos | ~38 | ~280 |
| PDF Notes | 5 | 19 |
LMS Direct Links
Tip: Each section page contains direct LMS links to every chapter. PDF notes are highlighted. Use the Problem Tracker to tick off problems as you solve them.
Course Notes
All 280 lessons across 24 sections. Click each section to view lessons and take notes.
Course: https://namastedev.com/learn/namaste-dsa/introduction
Course Sections at a Glance
| # | Section | Lessons |
|---|---|---|
| 1 | Introduction | 2 |
| 2 | Warm Up | 11 |
| 3 | Time/Space Complexity | 1 |
| 4 | Arrays — Easy/Medium | 9 |
| 5 | Recursion — Easy/Medium | 6 |
| 6 | Searching & Sorting — Easy/Medium | 6 |
| 7 | Linked List — Easy/Medium | 14 |
| 8 | Strings — Easy/Medium | 14 |
| 9 | Stack and Queues | 14 |
| 10 | Binary Search Algorithm | 13 |
| 11 | Two Pointers & Sliding Window | 10 |
| 12 | Binary Tree | 21 |
| 13 | Binary Search Tree | 10 |
| 14 | Heap / Priority Queue | 13 |
| 15 | Hashing | 10 |
| 16 | Backtracking | 13 |
| 17 | Greedy Algorithm | 14 |
| 18 | Dynamic Programming | 20+ |
| 19 | Graphs | 20+ |
| 20 | Tries | 8 |
| 21 | Searching & Sorting — Advanced | 6 |
| 22 | DP and Arrays — Advanced | 5 |
| 23 | Strings — Advanced | 9 |
| 24 | Bonus | 4 |
All 24 Sections
Section 1: Introduction
Section 2: Warm Up
Section 3: Time/Space Complexity
Section 4: Arrays — Easy/Medium
Section 5: Recursion — Easy/Medium
Section 6: Searching & Sorting — Easy/Medium
Section 7: Linked List — Easy/Medium
Section 8: Strings — Easy/Medium
Section 9: Stack and Queues
Section 10: Binary Search Algorithm
Section 11: Two Pointers & Sliding Window
Section 12: Binary Tree
Section 13: Binary Search Tree
Section 14: Heap / Priority Queue
Section 15: Hashing
Section 16: Backtracking
Section 17: Greedy Algorithm
Section 18: Dynamic Programming
Section 19: Graphs
Section 20: Tries
Section 21: Searching & Sorting — Advanced
Section 22: DP and Arrays — Advanced
Section 23: Strings — Advanced
Section 24: Bonus