Get Started →

DSA Tutorial

🔍

Data Structures & Algorithms What is Data Structure?What is an Algorithm?Time Complexity (Big-O)Space Complexity Asymptotic Notation Analyze Code Complexity How to Approach Problems

How to Identify Patterns Brute Force → Optimization Choosing the Right DS Dry Run & Debug Approach

GCD & LCM Prime Numbers Modular Arithmetic

Array Basics 2D Arrays Dynamic Arrays Prefix Sum Kadane's Algorithm Common Mistakes Practice Problems

HashMap Basics Frequency Count Set vs Map Subarray Problems 2Sum Variations Common Mistakes Practice Problems

String Basics String Traversal Palindrome Frequency Count Pattern Matching Common Mistakes Practice Problems

Two Pointers Sliding Window Prefix Sum Pattern Fast & Slow Pointer Binary Search Pattern Meet in the Middle

Linear Search Binary Search Binary Search on Answer Binary Search Variations Lower & Upper Bound Practice Problems

Bubble Sort Selection Sort Insertion Sort Merge Sort Quick Sort Common Mistakes Practice Problems

Recursion Basics Subsets Permutations Common Mistakes

Backtracking Basics Decision Tree Thinking Combination Sum N-Queens Sudoku Solver Word Search Common Mistakes Practice Problems

Stack Basics Monotonic Stack Next Greater Element Min Stack Expression Evaluation Common Mistakes Practice Problems

Queue Basics Queue in BFS Circular Queue Priority Queue Deque Common Mistakes Practice Problems

Linked List Basics Reverse a List Cycle Detection Fast & Slow Pointer Merge Two Lists Doubly Linked List LRU Cache Common Mistakes Practice Problems

Min & Max Heap Top K Problems Merge K Lists Median in Stream Heap + Greedy Combos Practice Problems

Binary Tree DFS Traversals BFS / Level Order Height & Diameter LCA Tree Views Path Problems Common Mistakes Practice Problems

BST Basics Insert & Delete Validate BST Kth Smallest

Graph Basics BFS DFS Graph Representation Connected Components Cycle Detection Topological Sort Shortest Path (BFS)Dijkstra's Bellman-Ford Floyd Warshall Union Find MST Common Mistakes Practice Problems

Divide & Conquer Greedy Paradigm DP Paradigm Paradigm Comparison

Greedy Basics Activity Selection Interval Problems Job Scheduling Gas Station Problem Greedy + Heap Patterns Common Mistakes

DP Patterns Overview State Transition Thinking Memo vs Tabulation Fibonacci Pattern 1D DP 2D DP Knapsack Partition DP DP on Subsequences LIS LCS DP on Strings DP on Grids DP on Trees Bitmask DP Common Mistakes Practice Problems

Trie Basics Insert & Search Word Search Problems

AVL Tree Segment Tree

Bit Basics (AND, OR, XOR)Bit Tricks & Properties XOR Tricks Bit Masking Subset Generation using Bits Power of 2 & Bit Hacks Advanced Bit Manipulation Practice Problems

Union-Find Deep Dive Path Compression Disjoint Set Applications

Top 100 DSA Problems Blind 75 NeetCode 150 Top 50 Must-Solve

Two Pointers Problems Sliding Window Problems Binary Search Problems BFS / DFS Problems Backtracking Problems DP Pattern Problems Greedy + Heap Problems

Easy Problems Medium Problems Hard Problems Easy → Medium Ladder Medium → Hard Ladder

FAANG Question Bank Product-Based Companies Service-Based Companies Mixed Problem Sets Mock Interview Simulator

Weekly Revision Plan Post-Topic Mixed Problems Spaced Repetition Guide Mock Interview Schedule Self-Assessment Checklist

advanced

Content not found for this topic.

NextData Structures & Algorithms

advanced | DSA Tutorial