Official Certification

Master

Start your DSA journey with our structured roadmap that takes you from fundamentals—like arrays and linked lists—to advanced topics such as dynamic programming and graph algorithms.

24 Courses
120+ Hours
818 Problems
Download Curriculum
50k+ already enrolled

What you'll learn

Practice Arrays
Practice Strings
Linked Lists
Stacks and Queues
Time complexity
Searching and Sorting Algorithms
Practice Sorting
Greedy Algorithms
Two Pointers and Sliding Window Technique
Prefix Sum Problems
Binary Search
Recursion
2D Array / Matrices
Trees and Binary trees
Graphs
Heaps
Bit Manipulation
Dynamic programming
Number theory
Combinatorics
Hashing
Disjoint Set Union
Tries
Data Structures Interview Questions
1Level 1

Linear Data Structures

Learn to implement and use Linear Data Structures

Linear data structures are the most used data structures due to their simplicity and ease of use.

Practice Arrays

Practice Course57 Problems
Array Traversal
Maximum and second maximum of an Array
Comparing multiple Arrays
Conditions on Arrays
Aggregation on Arrays
Constructing an Array based on conditions

Practice Strings

Practice Course43 Problems
String traversal
Compare two strings
Compare consecutive elements on a single string
Check for Palindrome
Convert string to integer
Convert string to title case
Check if two strings are Anagrams
Substring check
Binary strings
Represent big integers using string

Linked Lists

Learn Course18 Problems
Singly Linked List
Insertion at the front
Insertion at the end
Insertion at k-th position
Deletion in a linked list
Circular Linked list
Doubly Linked list

Stacks and Queues

Learn Course27 Problems
Stack introduction
Push, Pop, Peek, isEmpty, isFull functions
Implementing a Stack
Stacks using inbuilt libraries
Valid parenthesis problem
Dealing with Reverse Polish Notation
Finding Next Greater Element
Largest Rectangle in a Histogram
Queue introduction - Enqueue / Dequeue
Queue Implementation
To do list using a Queue
2Level 2

Basic Algorithms

Learn to analyse algorithms & move to important ones

Start with learning about what algorithms are and how to analyze them. Then move to important algorithms like Binary Search, Greedy, Two pointers, Sorting etc.

Time complexity

Learn Course39 Problems
Fundamentals of Time Complexity
Applying time complexity to DSA problems
Log and Square root time complexity
Practice problems

Searching and Sorting Algorithms

Learn Course35 Problems
Introduction to linear Search
Practice Linear Search
Introduction to Sorting
Bubble Sort
Selection Sort
Insertion Sort
Merge Sort
Quick Sort
Counting Sort
Radix Sort

Practice Sorting

Practice Course15 Problems
Using inbuilt sorting functions
Sorting an Array of elements
Reverse sorting
Sorting an Array of pairs
Sorting using custom sort function
Counting sort
Sort multiple arrays

Greedy Algorithms

Learn Course22 Problems
Introduction to Greedy Algorithms
Basics of Greedy and Proofs
Chopsticks Problem
Evacuate to Moon Problem
Snakes and Moongose Problem
Maximum Score Problem
Maximize Disjoint Pair Sum

Two Pointers and Sliding Window

Practice Course30 Problems
Two Pointers Technique
Sliding Window Technique
Remove duplicates from a sorted array
Find if absolute difference of two elements equals B
Find common elements in two arrays
Minimum Similar Substring
Palindrome by Splitting
More practice problems

Prefix Sum Problems

Practice Course14 Problems
Creating Prefix Array
Optimizations using Prefix Sum
Suffix Arrays
Good Subarrays problem
Counting Pretty Numbers problem
Mystical Numbers problem
Rectangular Queries problem
More Practice Problems

Binary Search

Learn Course21 Problems
What is Binary Search?
Visualization of Binary Search
Time Complexity Analysis of Binary Search
Using Inbuilt libraries
Solve Average Flex
Solve The Wave
Implicit Binary Search
Binary Search Templates
Solve Coins and Triangle

Recursion

Learn Course43 Problems
Introduction to Recursion
Base Condition
Solve Sum of N Numbers using Recursion
Factorial using Recursion
Fibonacci series
Linear search and patterns using Recursion
Palindrome using Recursion
All Possible Subsets
Backtracking - Unique Combinations Sum
Backtracking - Find Unique Permutations
3Level 3

Non-Linear Data Structures

Learn to implement and use Trees and Graphs

To store and perform complex operations on a variety of data, linear data structures are not enough. Tree and Graph like data structures work best in such cases.

Trees and Binary Trees

Learn Course35 Problems
Introduction to Trees
Binary Tree Properties
Tree Traversals (BFS/DFS)
Height and Diameter
Lowest Common Ancestor

Graphs

Learn Course40 Problems
Graph Representations
BFS & DFS
Shortest Path (Dijkstra)
Minimum Spanning Tree (Prim/Kruskal)
Topological Sort

Heaps

Learn Course15 Problems
Min Heap & Max Heap
Heapq in Python/PriorityQueue
Kth largest element
Median of Stream

Disjoint Set Union

Learn Course12 Problems
Introduction to DSU
Union by Rank/Size
Path Compression
Graph Connectivity

Tries

Learn Course10 Problems
Introduction to Tries
Trie Operations (Insert/Search)
Longest Common Prefix
Tries with XOR
4Level 4

Dynamic Programming & Math

Master optimization & mathematical problem solving

Dive into one of the most important paradigms in algorithmic problem solving: Dynamic Programming. Also cover essential Number Theory and Combinatorics.

Dynamic Programming - I

Learn Course45 Problems
Introduction to DP
Memoization vs Tabulation
1D DP Problems
House Robber
Frog Jump

Dynamic Programming - II

Learn Course35 Problems
2D DP
Grid Paths
0/1 Knapsack
Unbounded Knapsack
Longest Common Subsequence (LCS)
Longest Increasing Subsequence (LIS)

Bit Manipulation

Learn Course15 Problems
Bitwise Operators
Bit Masking
XOR Problems
Power Set Algorithm

Number Theory

Learn Course20 Problems
Prime Numbers & Sieve
GCD & LCM (Euclidean Algo)
Modular Arithmetic
Prime Factorization
5Level 5

Advanced Data Structures

Learn sophisticated structures for complex queries

Equip yourself with advanced tools like Segment Trees and Fenwick Trees to solve range query problems efficiently.

Segment Trees

Learn Course25 Problems
Building a Segment Tree
Point Updates
Range Sum/Min Queries
Lazy Propagation

Fenwick Trees (BIT)

Learn Course12 Problems
Binary Indexed Trees Logic
Point Update & Range Query
Inversion Count

Advance String Algorithms

Learn Course15 Problems
KMP Algorithm
Rabin-Karp Rolling Hash
Z-Algorithm
6Level 6

Expert Topics

Master CP & System Design concepts

Final frontier for competitive programming and complex system optimization. Covers Graph Theory depth and Game Theory.

Advanced Graph Theory

Learn Course20 Problems
Strongly Connected Components (Kosaraju/Tarjan)
Bridges & Articulation Points
Bellman Ford
Floyd Warshall

Game Theory

Learn Course10 Problems
Introduction to Game Theory
Nim Game
Sprague-Grundy Theorem

Geometric Algorithms

Learn Course8 Problems
Convex Hull (Graham Scan)
Intersection of Lines
Area of Polygon
PRO ACCESS

Unlock Everything

AI tutor, certificate, interview prep & more.

₹6999₹27,996