LetCodes

Learn DSA

This is a starter landing page for DSA. Replace this paragraph with a short, friendly description of the topic and what readers will learn from the tutorial series.

Tutorial contents

Introduction to DSA
Why Learn DSA?
How to Approach Problems
DSA Roadmap
Complexity Analysis
Big O Notation
Time Complexity
Space Complexity
Best, Worst & Average Case
Amortized Analysis
Asymptotic Notations (Ω, Θ, O)
Recursion Basics
Recursion Tree & Call Stack
Tail Recursion
Common Recursion Patterns
Arrays
Array Operations
Two Pointers Technique
Sliding Window
Prefix Sum
Kadane's Algorithm
Strings
String Algorithms
Pattern Matching (KMP, Rabin-Karp)
Anagrams & Palindromes
Hashing
Hash Tables
Collision Handling
Linked Lists
Singly Linked List
Doubly Linked List
Circular Linked List
Common Linked List Problems
Stacks
Stack Applications
Queues
Deque
Priority Queue
Monotonic Stack & Queue
Trees
Binary Trees
Tree Traversals (DFS, BFS)
Binary Search Tree (BST)
Balanced Trees (AVL, Red-Black)
Heaps
Trie (Prefix Tree)
Segment Tree
Fenwick Tree (BIT)
Graphs
Graph Representations
Breadth-First Search (BFS)
Depth-First Search (DFS)
Topological Sort
Shortest Path Algorithms
Dijkstra's Algorithm
Bellman-Ford Algorithm
Floyd-Warshall Algorithm
Minimum Spanning Tree
Kruskal & Prim Algorithms
Union-Find (DSU)
Cycle Detection
Sorting Overview
Bubble, Selection & Insertion Sort
Merge Sort
Quick Sort
Heap Sort
Counting, Radix & Bucket Sort
Searching Overview
Linear Search
Binary Search
Binary Search Variants
Brute Force
Greedy Algorithms
Divide & Conquer
Backtracking
Dynamic Programming
Memoization vs Tabulation
Knapsack Problems
LIS & LCS
Edit Distance
DP on Grids
DP on Trees
Bitmask DP
Bit Manipulation
Math for DSA
GCD & LCM
Primes & Sieve of Eratosthenes
Modular Arithmetic
Combinatorics
Interval Problems
Matrix Problems
LRU Cache
Design Problems
Suffix Arrays & Trees
Problem-Solving Patterns
Complexity Cheat Sheet
Top Interview Problems
Study Plan
Interview Questions