Get started
Start with DSA Fundamentals
Programming Fundamentals
Module 01
DSA Fundamentals
Programming FundamentalsLogic BuildingAlgorithm AnalysisData Structures & Libraries+3 more
0/31 solved0%
28 easy3 med.0 hard
Module 02
Sorting Techniques
Elementary Sorting AlgorithmsAdvanced Sorting Algorithms
0/7 solved0%
6 easy1 med.0 hard
Module 03
Arrays: From Fundamentals to Advanced
Fundamentals & Basic OperationsLogic Building: Rotations & SetsTwo Pointers & Sliding WindowGreedy & Kadane's Algorithm+4 more
0/40 solved0%
16 easy19 med.5 hard
Module 04
Binary Search
Learning 1D Array Binary SearchBinary Search on AnswersBinary Search on 2D Arrays
0/32 solved0%
11 easy9 med.12 hard
Module 05
Strings: Basic to Advanced
Basic String ManipulationHashing, Sorting, and ParsingAdvanced String Algorithms
0/15 solved0%
9 easy5 med.1 hard
Module 06
Linked List Data Structures
Singly Linked List: FundamentalsDoubly Linked List: FundamentalsMedium Problems of Singly Linked ListMedium Problems of Doubly Linked List+1 more
0/31 solved0%
10 easy18 med.3 hard
Module 07
Recursion and Backtracking
Get a Strong HoldSubsequences PatternAdvanced Backtracking
0/25 solved0%
2 easy14 med.9 hard
Module 08
Bit Manipulation & Number Theory
Learn Bit ManipulationInterview ProblemsAdvanced Maths
0/18 solved0%
12 easy6 med.0 hard
Module 09
Stacks and Queues
LearningPrefix, Infix, Postfix Conversion ProblemsMonotonic Stack & Queue ProblemsAdvanced Implementation & Design
0/34 solved0%
6 easy22 med.6 hard
Module 10
Sliding Window & Two Pointer
Finding Longest Subarrays (Standard Sliding Window)Counting Subarrays and Fixed WindowMinimum Window and Advanced Constraints
0/12 solved0%
1 easy8 med.3 hard
Module 11
Heaps
Medium ProblemsHard Problems
0/39 solved0%
8 easy22 med.9 hard
Module 12
Greedy Algorithms
Basic Greedy ProblemsIntermediate Greedy TechniquesIntervals and Scheduling
0/16 solved0%
2 easy13 med.1 hard
Module 13
Binary Trees
Learning Traversals
0/13 solved0%
11 easy2 med.0 hard
Module 14
Binary Search Trees
Concepts and Basic OperationsProperties and ValidationConstruction and Iterator PatternsAdvanced Problems
0/16 solved0%
5 easy8 med.3 hard
Module 15
Graphs
Introduction to GraphsBFS & DFS ProblemsTopological SortShortest Path Algorithms+2 more
0/54 solved0%
3 easy12 med.39 hard
Module 16
Dynamic Programming
Introduction to DP1D DP2D/3D DP and GridsDP on Subsequences+5 more
0/56 solved0%
0 easy20 med.36 hard