CSES Problem Set

Currently Playing: CSES Speedrun - Graphs - Part IV

This is part 4 of me doing problems from the CSES problem set dealing with graphs. Here we tackle topological sort DP for longest paths and path counting, Dijkstra with multi-dimensional state tracking (min cost + route count + min/max flights simultaneously), and binary lifting for efficient k-th successor queries on functional graphs. Problem Set: https://cses.fi/problemset/ 0:00 Intro 0:10 Course Schedule (topological sort) 5:23 Longest Flight Route (topological sort DP + path reconstruction) 16:40 Game Routes (topological sort DP for counting paths) 21:51 Investigation (Dijkstra with multi-state tracking: cost, routes, min/max flights) 41:02 Planets Queries I (binary lifting on functional graphs) 55:51 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