Data structure topics list
list all the topics of data structure and algorithm
Got it 👍 — here’s a comprehensive list of Data Structures and Algorithms (DSA) topics, structured in
a logical learning order:
1. Basics
Time Complexity (Big-O, Big-Ω, Big-Θ)
Space Complexity
Recursion (basic & advanced)
Iteration vs Recursion
Master’s Theorem (for analyzing recurrences)
2. Arrays
Basics (insertion, deletion, traversal)
Searching (Linear Search, Binary Search, Ternary Search)
Sorting (Bubble, Selection, Insertion, Merge, Quick, Heap, Counting, Radix, Bucket)
Prefix Sum & Difference Array
Kadane’s Algorithm (Maximum Subarray Sum)
Sliding Window Technique
Two Pointers Technique
Binary Search on Answer
3. Strings
String Manipulation Basics
Palindrome Checking
Anagrams & Isomorphism
Pattern Matching (Naive, KMP, Rabin-Karp, Z-Algorithm)
Trie Data Structure
Suffix Array & Suffix Tree
Printed using ChatGPT to PDF, powered by PDFCrowd HTML to PDF API. 1/5
String Hashing & Rolling Hash
4. Linked List
Singly Linked List
Doubly Linked List
Circular Linked List
Fast & Slow Pointers (Floyd’s Cycle Detection)
Reversing a Linked List (Iterative & Recursive)
Merging & Splitting Linked Lists
5. Stacks & Queues
Stack Implementation (Array & Linked List)
Queue Implementation (Array & Linked List)
Circular Queue
Deque (Double-Ended Queue)
Monotonic Stack & Queue
Applications (Balanced Parentheses, Next Greater Element, LRU Cache, Min Stack)
6. Hashing
Hash Tables (Chaining, Open Addressing)
Hash Maps & Sets
Collision Handling
Applications (Frequency Counting, Subarray Problems, Two-Sum Problem)
7. Trees
Binary Tree (Basics, Traversals: Inorder, Preorder, Postorder, Level-order)
Binary Search Tree (BST)
AVL Tree, Red-Black Tree, Segment Tree, Fenwick Tree (BIT)
Lowest Common Ancestor (LCA)
Trie (Prefix Tree)
Heap (Min Heap, Max Heap, Priority Queue)
8. Graphs
Printed using ChatGPT to PDF, powered by PDFCrowd HTML to PDF API. 2/5
Graph Representations (Adjacency List, Matrix)
Graph Traversals (DFS, BFS)
Connected Components
Bipartite Graph Check
Topological Sort (Kahn’s Algorithm, DFS-based)
Shortest Path (Dijkstra, Bellman-Ford, Floyd-Warshall)
Minimum Spanning Tree (Prim’s, Kruskal’s)
Disjoint Set Union (DSU/Union-Find)
Strongly Connected Components (Kosaraju, Tarjan)
Bridges & Articulation Points
Eulerian Path & Hamiltonian Path
Maximum Flow (Ford-Fulkerson, Edmonds-Karp)
9. Advanced Data Structures
Segment Tree (with Lazy Propagation)
Binary Indexed Tree (Fenwick Tree)
Disjoint Set Union (with Path Compression & Union by Rank)
Sparse Table (for RMQ)
Treap, Splay Tree
10. Greedy Algorithms
Activity Selection
Huffman Encoding
Minimum Spanning Tree (Prim’s & Kruskal’s)
Interval Scheduling
Fractional Knapsack
11. Dynamic Programming (DP)
Basics (Memoization & Tabulation)
Classic Problems: Fibonacci, Knapsack, Coin Change
Subset Sum & Partition DP
Longest Common Subsequence (LCS), Longest Increasing Subsequence (LIS)
Matrix Chain Multiplication
Printed using ChatGPT to PDF, powered by PDFCrowd HTML to PDF API. 3/5
DP on Strings (Edit Distance, Palindromic Substrings)
DP on Grids (Unique Paths, Minimum Path Sum)
Bitmask DP
Digit DP
DP on Trees
DP with Binary Search
12. Backtracking
N-Queens Problem
Rat in a Maze
Sudoku Solver
Word Search
Hamiltonian Cycle & Path
13. Divide and Conquer
Binary Search
Merge Sort & Quick Sort
Maximum Subarray (Kadane’s & Divide-Conquer)
Matrix Exponentiation
14. Mathematical Algorithms
Prime Numbers (Sieve of Eratosthenes, Segmented Sieve)
GCD/LCM (Euclidean Algorithm)
Modular Arithmetic (Modular Exponentiation, Modular Inverse)
Number Theory (Chinese Remainder Theorem, Fermat’s Little Theorem)
Combinatorics (nCr, Pascal’s Triangle, Catalan Numbers)
Probability Basics
15. Advanced Topics
Bit Manipulation Tricks
Geometry Algorithms (Convex Hull, Line Intersection, Closest Pair of Points)
Randomized Algorithms
String Algorithms (Suffix Automaton, Aho-Corasick)
Printed using ChatGPT to PDF, powered by PDFCrowd HTML to PDF API. 4/5
Computational Geometry
Game Theory (Nim Game, Grundy Numbers)
👉 This is a full roadmap of DSA.
Do you want me to rearrange this into a study roadmap (beginner → advanced) or keep it as a
reference list?
Printed using ChatGPT to PDF, powered by PDFCrowd HTML to PDF API. 5/5
