Get Started →

DSA Tutorial

🔍

Introduction to DSA What is Data Structure?What is an Algorithm?

Time Complexity (Big-O)Space Complexity Asymptotic Notation

How to Approach Problems How to Identify Patterns Brute Force to Optimal Choosing the Right Data Structure

Array Basics How Arrays Work in Memory Array Traversal Array Operations Time & Space Complexity 2D Arrays Dynamic Arrays Practice Problems

String Basics How Strings Work in Memory String Traversal String Operations Mutable vs Immutable Strings Time & Space Complexity Practice Problems

Linear Search Binary Search Binary Search Patterns Practice Problems

Sorting Basics Bubble Sort Selection Sort Insertion Sort Merge Sort Quick Sort Stable vs Unstable Sorting Sorting Comparison Practice Problems

Hashing Basics HashMap HashSet Collision Handling Frequency Counting Time & Space Complexity Practice Problems

Recursion Basics How Recursion Works Call Stack Base Case & Recursive Case Recursion Tree Practice Problems

Linked List Basics Singly Linked List Doubly Linked List Circular Linked List Linked List Collection frameworks Practice Problems

Stack Basics Stack Operations Stack Implementation Stack Collection Frameworks Balanced Parentheses Expression Evaluation Monotonic Stack Practice Problems

Queue Basics Queue Operations Queue Implementation Queue Collection Frameworks Circular Queue Deque Priority Queue Queue in BFS Practice Problems

Tree Basics & Terminologies Types of Trees Binary Tree Basics & Types Binary Tree DFS Traversals BFS / Level Order Traversal Binary Tree Operations Binary Tree Practice Problems BST Basics BST DFS Traversals BST BFS Traversal BST Operations BST Practice Problems Heap Trie Advanced Trees

Graph Basics and Terminologies Graph Representation Types of Graphs Breadth First Search (BFS)Depth First Search (DFS)Connected Components Cycle Detection Topological Sort Shortest Path Algorithms Dijkstra's Algorithm Minimum Spanning Tree Union Find (DSU)Practice Problems

Backtracking Basics Decision Tree Thinking Time & Space Complexity Subsets Permutations Combination Problems N-Queens Sudoku Solver Word Search Common Mistakes Practice Problems

DP Basics State Transition Thinking Memoization Tabulation Memoization vs Tabulation 1D Dynamic Programming 2D Dynamic Programming Knapsack Pattern Longest Common Subsequence (LCS)Longest Increasing Subsequence (LIS)Time & Space Complexity Common Mistakes Practice Problems

Two Pointers Sliding Window Fast & Slow Pointers Prefix Sum Hashing Pattern Binary Search Pattern Greedy Pattern Divide & Conquer Heap Pattern Monotonic Stack & Queue Practice Problems

Top 100 DSA Problems Blind 75 NeetCode 150 Pattern → Problem Map Easy → Medium Roadmap Medium → Hard Roadmap FAANG Question Bank Mock Interviews

Weekly Revision Plan Spaced Repetition Guide Mixed Problem Sets Mock Interview Schedule Self Assessment Checklist

2D Dynamic Programming

Content not found for this topic.

Previous1D Dynamic Programming

NextKnapsack Pattern

2d dp | DSA Tutorial