CSES Problem Set

Currently Playing: CSES Speedrun - Graphs - Part VI

This is part 6 of me doing problems from the CSES problem set dealing with graphs. Here we get into the heavier graph theory territory: Strongly Connected Components via Kosaraju's algorithm (forward DFS for topological order + reverse-graph DFS for component assignment), 2-SAT reduced to SCC on an implication graph, SCC condensation into a DAG for max-coin pathfinding, and Eulerian circuits via Hierholzer's algorithm. Problem Set: https://cses.fi/problemset/ 0:00 Intro 0:25 Planets and Kingdoms (Kosaraju's SCC: forward DFS + reverse graph) 14:45 Giant Pizza (2-SAT via SCC on implication graph) 33:06 Coin Collector (SCC condensation to DAG + topological DP) 51:36 Mail Delivery (Eulerian circuit via Hierholzer's algorithm) 1:07:33 Wrap-up 🚀 Book a Mock Interview with me: https://calendly.com/anatoliy-sokolov 💬 Join the Discord Community: https://discord.gg/ufpdqkSupH #softwareengineering #codinginterview #leetcode #faang