lecture 1: - (DONE) ✅
-
Hanoi tower
-
Longest Common Prefix
-
Maximum Sub Array
-
Master Theorem TC calculator
-
find Min Max
-
Median problem
-
Closest Pair Problem
lecture 2: - (DONE) ✅
-
Coing Change Problem (DP solution)
-
Fractional KnapSack Problem (Greedy Solution)
-
Activity problem (Greedy solution)
-
Secretary problem (תזמון תדלוק)
-
Polynomial Coefficients (Greedy & no code)
-
Reuven store (Greedy & no code)
-
Network cables (Greedy & no code)
-
Cops and burglars (Policemen catch thieves)
-
Shannon fano algorithm (psuedo greedy & no code)
-
Huffman algorithm (psuedo greedy & no code)
lecture 3: - (DONE) ✅
-
Fibbonaci Sequence
-
Binomial Coefficients
-
World Series Odds
-
Matrix Chain Multiplication
-
The Integer Knapsack Problem
-
Kadane's algorithm
-
Sub matrix with highest sum
-
Lowest common subsequence
-
Subset Sum
-
Edit distance
lecture 4: (DONE) ✅
-
DFS
-
BFS
lecture 5: (DONE) ✅
-
Topological sort
-
SCC algorithm + implementation
-
Graham's scan
lecture 6: (DONE) ✅
-
Andrew Algorithm
-
Union Find
-
Ackerman
lecture 7: (DONE) ✅
-
Dynamic Array
-
Islands problem
-
TSP (Travelling salesman problem)
lecture 8:
-
Dijkstra
-
Bellman-Ford Algorithm
-
MST (Kruskal)
-
MST (Prim)