CSES Problem Set

Currently Playing: CSES Speedrun - Graphs - Part VII

This is part 7 of me doing problems from the CSES problem set dealing with graphs. This one covers Eulerian paths and hard search territory: De Bruijn sequences constructed as an Euler path over a bit-shift transition graph, Euler path existence via in/out degree conditions plus connectivity checks, Hamiltonian path counting with bitmask DP over visited-set states, and Knight's Tour solved with backtracking plus Warnsdorff's heuristic (always jump to the square with the fewest onward moves first). Problem Set: https://cses.fi/problemset/ 0:00 Intro 0:14 De Bruijn Sequence (Euler path on bit-shift graph) 16:45 Teleporters Path (Euler path + degree/connectivity checks) 23:43 Hamiltonian Flights (bitmask DP over visited states) 33:04 Knight's Tour (backtracking + Warnsdorff's heuristic) 46:38 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