Tutorial · 65 chapters
Data Structure & Algrorithm
DSA stands for Data Structures and Algorithms is the backbone of computer science. It’s the study of how to organize data efficiently in memory and the step-by-step procedures (algorithms) used to process that data. Think of it as a toolkit for writing clean, fast, and scalable software.
Mission log
01Introduction to DSA02Algorithms03Time Complexity04Space Complexity05Big O, Big Ω & Big Θ06Arrays in DSA07Dynamic Arrays08Strings in DSA092D Arrays in DSA10Recursion11Backtracking12Linear Search13Binary Search14Sorting Algorithms15Bubble Sort16Selection Sort17Insertion Sort18Merge Sort19Quick Sort20Counting Sort & Radix Sort21Two Pointers Technique22Sliding Window Technique23Prefix Sum24Bit Manipulation25Linked List26Doubly Linked List27Circular Linked List28Linked List Problems (Reversal & Fast/Slow Pointers)29Stack30Stack Applications (Expression Conversion & Monotonic Stack)31Queue32Circular Queue33Deque34Hashing35HashMap36HashSet37Trees38Binary Tree39Binary Search Tree40Tree Traversal41AVL Tree (Self-Balancing BST)42Heap43Heap Sort44Priority Queue45Trie46Graphs47Graph Representation48Graph Traversal49Breadth First Search (BFS)50Depth First Search (DFS)51Cycle Detection in Graphs52Topological Sort53Disjoint Set Union (Union-Find)54Minimum Spanning Tree (Prim & Kruskal)55Dijkstra's Algorithm56Bellman-Ford & Floyd-Warshall57Greedy Algorithms58Divide and Conquer59Recurrence Relations & Master Theorem60Dynamic Programming611D Dynamic Programming622D Dynamic Programming63Knapsack Problems64DP on Strings (LCS & Edit Distance)65String Pattern Matching (KMP & Rabin-Karp)
