Skip to content

Latest commit

 

History

History
72 lines (58 loc) · 2.95 KB

Index.md

File metadata and controls

72 lines (58 loc) · 2.95 KB

Index of DSA =================== 7 - 8 LPA =================== 0. Introduction

  1. Core Concepts
  2. Recursion & Backtracking basic to intermediate
  3. Arrays (Sliding Window, Two Pointer, Prefix Sum, Kadane's Algorithm)
  4. Strings (Basic to Intermediate) including conversion of string to integer and vice versa etc.
  5. Linked List (Implementation, Reverse, CRUD Operations )
  6. Stack & Queue (Implementation using Arrays & Linked List)
  7. Tree
  8. Binary Search Tree
  9. Hashing & HashMaps & Collision resolution
  10. Bit Manipulation (Basic to Intermediate)

=================== above 10 LPA ===================

  1. Advance Recursion & Backtracking
  2. Advance Arrays (Matrix Multiplication & 2D Arrays, Spriral Matrix, Matrix Chain Multiplication)
  3. Advance Strings Algorithms & Pattern Searching (KMP & Rabin Karp)
  4. Advance Linked List (Merge Sort, Quick Sort, Detect Cycle, Detect Intersection)
  5. Advance Stack & Queue (Queue using Stack, Stack using Queue, Deque)
  6. Advance Tree (Binary Tree, Binary Search Tree, AVL Tree, Red Black Tree, Segment Tree, Fenwick Tree) {Mainly Theory}
  7. Graph (DFS, BFS, Topological Sort, Shortest Path, Minimum Spanning Tree, Graph Coloring, Articulation Point, Bridges, Strongly Connected Components) etc.
  8. Trie
  9. Heap & Priority Queue
  10. Disjoint Set & Union Find
  11. Segment Tree & Fenwick Tree
  12. Greedy Algorithms
  13. Dynamic Programming (Basic to advance)
  14. Bit Manipulation

=================== Algorithms ===================

  1. Searching & Sorting Algorithms -> Linear Search, Binary Search, Bubble Sort, Selection Sort, Insertion Sort, Merge Sort, Quick Sort, Heap Sort, Counting Sort, Radix Sort, Bucket Sort etc.

  2. Divide & Conquer -> Binary Search, Merge Sort, Quick Sort, Strassen's Matrix Multiplication, Karatsuba Multiplication etc.

  3. Greedy Algorithms -> Fractional Knapsack, Job Sequencing, Huffman Coding, Prim's Algorithm, Kruskal's Algorithm etc.

  4. Dynamic Programming -> 0/1 Knapsack, Longest Common Subsequence, Longest Increasing Subsequence, Matrix Chain Multiplication, Edit Distance, Coin Change, Rod Cutting, Subset Sum, Travelling Salesman Problem, Floyd Warshall, Bellman Ford, Johnson's Algorithm etc.

  5. Backtracking -> N-Queens, Sudoku, Knight's Tour, Rat in a Maze etc.

  6. Bit Manipulation -> XOR, Counting Bits, Bit Masking etc.

  7. Graph Algorithms -> BFS, DFS, Shortest Path, Minimum Spanning Tree, Topological Sort, Articulation Point, Bridges, Strongly Connected Components etc.

=================== Dynamic Programming Pattern =================== beginner to advance including 1D, 2D and 3D DP patterns

  1. 0/1 Knapsack
  2. Longest Common Subsequence
  3. Longest Increasing Subsequence
  4. Matrix Chain Multiplication
  5. Edit Distance
  6. Coin Change
  7. Rod Cutting
  8. Subset Sum
  9. Travelling Salesman Problem
  10. Floyd Warshall
  11. Bellman Ford
  12. Johnson's Algorithm
  13. DP on Trees
  14. DP on Grid
  15. DP on Strings
  16. DP on Bitmasking
  17. DP on Graphs
  18. DP on Matrix
  19. DP on Interval