Must-Do-Algorithm

Placement preparation

These algorithm must be done if you are preparing for placements:

Binary Index Tree or Fenwick Tree ✔️
Segment Tree ✔️
Topological Sort ✔️
Line Sweep ✔️
Critical Connections in a Network ✔️
Prime Factorization using Sieve O(log n) ❌
LCSreturns ❌
Graph ---> 1.Shortest Path ->a.Dijkstra ✔️ ---> 2.Minimum Spanning ->a. Kruskals ✔️ ->b. Prim's ✔️
Strongly Connected Components ❌
KMP ✔️
DSU ❌
Knapsack 0-1 ✔️
LRU cache ✔️
Heap ✔️
Heap Using Priority Queue ✔️
Red Black Tree

->Go to leetcode do atleast one question from each topic

Name		Name	Last commit message	Last commit date
Latest commit History 53 Commits
8.Graph		8.Graph
1.0 Binary-Index-Tree or Fenwick-Tree.cpp		1.0 Binary-Index-Tree or Fenwick-Tree.cpp
1.1Example of Binary-Indexed-Tree.cpp		1.1Example of Binary-Indexed-Tree.cpp
10.KMP-Algorithm.cpp		10.KMP-Algorithm.cpp
13. LRU_Cache_solution1.cpp		13. LRU_Cache_solution1.cpp
14. Heap.cpp		14. Heap.cpp
2.Segment-Tree.cpp		2.Segment-Tree.cpp
3.Topological-sort.cpp		3.Topological-sort.cpp
4. Line-sweep.cpp		4. Line-sweep.cpp
5.Critical-Connections-in-Network.cpp		5.Critical-Connections-in-Network.cpp
README.md		README.md