Dynamic Programming: KnapsackExplores dynamic programming for the Knapsack problem, discussing strategies, algorithms, NP-hardness, and time complexity analysis.
DFS Continuation: Topological SortCovers topics like DFS output, edge classification, acyclic graphs, correctness, time analysis, SCCs, and the Topological Sort algorithm.
Causal Inference & Directed GraphsExplores causal inference, directed graphs, and fairness in algorithms, emphasizing conditional independence and the implications of DAGs.
Shortest Path in Directed GraphsCovers finding the shortest path in directed graphs efficiently using algorithmic approaches and discussing related NP-complete problems.
Topological Sort and SCCExplores topological sort, acyclic graphs, Strongly Connected Components, magic algorithm, component graph, flow networks, and their applications.
Solving Parity Games in PracticeExplores practical aspects of solving parity games, including winning strategies, algorithms, complexity, determinism, and heuristic approaches.
