- Time Complexity β°
- Proof Of Correctness
- Asymptotic analysis(Big-O notation) β
- Stack And Queus
- Linked List
- Trees π²
- Hashing
- Divide And Conquer
- Greedy Algorithm π
- Backtracking
- Dynamic Programming π
- Graphs:[ B.F.S | D.F.S | M.S.T ] π’
- Search And Sort Algorithms