CSES Problem Set

Currently Playing: CSES Speedrun - Graphs - Part III

This is part 3 of me doing problems from the CSES problem set dealing with graphs. Here we get into the harder shortest-path and cycle territory: Bellman-Ford for both positive and negative cycle detection, Dijkstra extended with extra state (DP on Dijkstra), K shortest paths, and directed cycle detection with 3-coloring DFS, with parent-pointer path reconstruction throughout. Problem Set: https://cses.fi/problemset/ 0:00 Intro 0:09 High Score (Bellman-Ford + positive cycle detection) 16:26 Flight Discount (Dijkstra with extra state / DP on Dijkstra) 31:29 Cycle Finding (Bellman-Ford + negative cycle reconstruction) 46:01 Flight Routes (K shortest paths with Dijkstra) 53:51 Round Trip II (directed cycle detection + 3-coloring DFS) 1:06:21 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