Your tools

Learn & build

DSA Sheet

Roadmaps

Project Ideas

Career & community

Data Structures & Algorithms Mastery Roadmap

Follow Namaste DSA from programming fundamentals to advanced problem solving. Learn each concept, practice the problems, and track your progress through trees, heaps, hashing, backtracking, greedy algorithms, dynamic programming, graphs, tries, and more.

Use this roadmap to choose what to study next, then practice with the Namaste DSA Sheet or follow video lessons in the Namaste DSA course.

Duration

20+ weeks (self-paced)

Level

Beginner to Advanced

Learners

50K+

Career Opportunity

Software Engineer, SDE, Backend Developer, AI/ML Engineer, Competitive Programmer

Prerequisites

No prior DSA experience required; programming basics are included

Choose a programming language and practice consistently

Overall Progress

0 of 238 Completed

Learning Path

1. Introduction to DSA

0/5 completed0%

Resources:

Why to learn DSA?

Choose Your Programming Language

Warm Up - Introduction

Programming Basics

Time & Space Complexity

2. Functions & if-else

0/7 completed0%

Resources:

Functions & if-else

Add Two Numbers with a Function

Check Voting Eligibility

Square Number

Even or Odd

Second Largest

Count Digits

3. Loops & Number Problems

0/8 completed0%

Resources:

Loops A2Z

Count Negative Numbers in an Array

Find Smallest Number in an Array

Find Largest Number in an Array

Print all even number in an Array

Star patterns

Palindrome Number

Reverse Integer

4. Arrays

0/9 completed0%

Resources:

Remove Duplicates

Remove Element

Reverse String

Best Time to Buy and Sell Stocks

Merge Sorted Arrays

Move Zeros

Max Consecutive Ones

Missing Number

Single Number

5. Recursion

0/7 completed0%

Resources:

Recursion A2Z

Fibonacci Number

Sum of first n numbers

Sum of all numbers in array

Sum of odd numbers in array

Factorial of n

Power of Two

6. Searching & Sorting

0/6 completed0%

Resources:

Linear Search

Binary Search

Bubble Sort

Selection Sort

Insertion Sort

Merge Sort

7. Linked List

0/20 completed0%

Resources:

Introduction to Linked List

Design Linked List

Adding Nodes to Linked List

Deleting Nodes in Linked List

Middle of Linked List

Reverse Linked List

Linked List Cycle - Hash Table

Linked List Cycle - Floyd's Algorithm

Palindrome Linked List

Intersection of two Linked Lists

Remove Linked List Elements

Remove nth node from end of List - Two Pass

Remove nth Node from end - One Pass

Remove Duplicates from Sorted List

Odd Even Linked List

Add Two Numbers

Merge Two Sorted Lists

Rotate List

Swap Nodes in Pairs - Iterative Approach

Swap Nodes in Pair - Recursive Approach

8. Strings

0/6 completed0%

Resources:

Length of Last Word

Split a String in Balanced Strings

Reverse String II

Valid Palindrome

Largest Odd Number in a String

Longest Common Prefix

9. Stacks & Queues

0/12 completed0%

Resources:

Introduction to Stacks & Queues

Playing with Stacks & Queues

Implement Stack

Implement Queue using Stacks

Valid Parentheses

Min Stack

Remove Outermost Parentheses

Evaluate Reverse Polish Notation

Next Greater Element

Daily Temperatures

Next Greater Element - II

Rotting Oranges

10. Binary Search Algorithm

0/11 completed0%

Resources:

Square Root of X

Best Practice - Finding Middle Element

Guess Higher or Lower

Search in Rotated Sorted Array

First Bad Version

Find Peak Element

Find Minimum in Rotated Sorted Array

Find First & Last Position in Sorted Array

Find Peak in a Mountain Array

Single Element in a Sorted Array

Find k Closest Elements

11. Two Pointers & Sliding Window

0/12 completed0%

Resources:

Two Sum II

Is Subsequence

Find Index of First Occurrence in String

KMP (Knuth-Morris-Pratt) Algorithm

Intersection of Two Linked Lists

Container with Most Water

Three Sum

Trapping Rain Water

Longest Substring Without Repeating Characters

Longest Repeating Character Replacement

Permutation in String

Sliding Window Maximum

12. Binary Tree

0/22 completed0%

Resources:

Introduction to Trees

Binary Tree

Preorder Traversal

Inorder & PostOrder

Inorder Traversal

Postorder

DFS and BFS in Binary Tree

Level Order Traversal

Maximum Depth of Binary Tree

Path Sum

Symmetric Tree

Invert a Binary Tree

Same Tree

Balanced Binary Tree

Diameter of a Binary Tree

Zigzag Level Order Traversal

Subtree of another Tree

Lowest Common Ancestor

Binary Tree Right Side View

Count Good Nodes in Binary Tree

Populating Next Right Pointers in Each Node

Binary Tree Maximum Path Sum

13. Binary Search Tree

0/6 completed0%

Resources:

Binary Search Tree

Valid Binary Search Tree

Search in a BST

Insert into a BST

Kth Smallest Element

Lowest Common Ancestor of a BST

14. Heaps & Priority Queues

0/11 completed0%

Resources:

Introduction to Heaps

Creating a Heap

Inserting a node in Heap

Extracting Values in Heap & HeapifyDown

Heap Sort Algorithm

Priority Queues - Introduction & Implementation

Kth Largest Element in an Array

Kth Largest Element in a Stream

Last Stone Weight

Top K Frequent Elements

Kth Smallest Element in a Sorted Matrix

15. Hashing & Frequency Maps

0/7 completed0%

Resources:

Two Sum

Find Words Containing Character

Jewels and Stones

Find Most Frequent Vowel and Consonant

Valid Anagram

Isomorphic Strings

Group Anagrams

16. Backtracking

0/13 completed0%

Resources:

Introduction to Backtracking

Subsets - The Power Set

Combinations

Permutations

Subset - II

Combination Sum

Combination Sum - II

Combination Sum - III

Letter Combinations of a Phone Number

Permutations - II

Palindrome Partitioning

Word Search

N Queens

17. Greedy Algorithm

0/13 completed0%

Resources:

Introduction to Greedy Algorithm

Two City Scheduling

Assign Cookies

Lemonade Change

Best Time to Buy and Sell Stock - II

Insert Interval

Merge Intervals

Partition Labels

Non Overlapping Intervals

Task Scheduler

Gas Station

Car Pooling

Candy - Two Pass & One Pass

18. Dynamic Programming

0/18 completed0%

Resources:

Introduction to Dynamic Programming

Fibonacci Numbers using DP

Top Down & Bottom Up - DP approach

Climbing Stairs

Minimum Cost Climbing Stairs

House Robber

House Robber II

Coin Change - Top Down & Bottom Up

Palindromic Substrings

Longest Palindromic Substring

Decode Ways

Maximum Subarray - Kadane's Algorithm

Maximum Product Subarray - Two Approaches

Word Break

Longest Increasing Subsequence

Partition Equal Subset Sum

Coin Change II

Unique Paths

19. Graphs

0/25 completed0%

Resources:

Introduction to Graphs

Breadth First Search (BFS)

Depth First Search (DFS)

Find if Path Exists - BFS

DFS Recursive

All Paths from Source to Target

Reconstruct Itinerary

Detect Cycle in Undirected Connected Graph

Topological Sort - DFS

Kahn's Algorithm - Topological Sort - BFS

Shortest Path Algorithms in Graphs

Shortest Path in Unweighted Graph - BFS

Dijkstra's Algorithm - Weighted Shortest Paths

Bellman-Ford Algorithm - Negative Edge Weights

Floyd-Warshall Algorithm - All-Pairs Shortest Paths

Comparing all Shortest Path Graph Algorithms

Minimum Spanning Tree

Prim's Algorithm - Minimum Spanning Tree

Disjoint Set - Union Find

Kruskal's Algorithm & Union-Find

Comparison - Prim’s vs Kruskal Algorithm

Number of Operations to Make Network Connected

Cheapest Flight with K Stops

Number of Ways to Arrive at Destination

Min Cost to Connect All Points

20. Tries

0/4 completed0%

Resources:

Introduction to Tries

Trie and TrieNode Structure

Insert, Search, PrefixFind - Trie Code

Time & Space Complexity in Tries

21. Searching & Sorting - Advanced

0/4 completed0%

Resources:

Quick Sort

Counting Sort & Stable Counting Sort

Radix Sort

Bucket Sort

22. Dynamic Programming & Arrays - Advanced

0/4 completed0%

Resources:

Jump Game - Dynamic Programming & Greedy

Jump Game - II

Min Cost to Cut a Stick (Rod Cutting Problem)

Super Egg Drop

23. Strings - Advanced

0/8 completed0%

Resources:

Minimum Add to Make Parenthesis Valid

Reverse Words in a String

Sum of Beauty of All Substrings

Decode String

Count and Say

Reorganize String

Repeated String Match

Rabin-Karp Algorithm & Implementation

Keep Growing!

Continue your learning journey.