Slides
⏱️
Complexity
Complexity of a Program.
🔄
Recursion
Recursion in Programming.
🌐
BFS
Breadth First Search.
🔍
DFS
Depth First Search.
📦
Huffman
Encoding.
🤑
Greedy Algo
Greedy Algorithms.
📍
Articulation Point
Graph Theory.
🔗
SCC
Strongly Connected.
🌲
Prim's
MST Algorithm.
🌲
Kruskal's
MST Algorithm.
🛣️
Dijkstra
Shortest Path.
🧩
Dynamic Programming
Introduction.
✖️
Matrix Chain
Multiplication.
🧠
Memoized Matrix
Optimization.
🔔
Bellmanford
Shortest Path.
🛤️
Warshall
Shortest Path.
🌊
Network Flow 1
Flow Networks.
🌊
Network Flow 2
Max Flow.
🧵
Rabin Karp
String Matching.
🤖
String Matching
Finite Automata.
🔎
KMP Algorithm
Knuth-Morris-Pratt.
📐
Comp. Geometry
Geometric Algorithms.
📈
Linear Prog 1
Optimization.
📉
Linear Prog 2
Advanced LP.
≈
Approx. Algos
Near-optimal solutions.
❓
NP Completeness
Complexity Classes.