CSES Problem Set

The repository contains a list of solved algorithmic olympiad problems from the resource https://cses.fi/.
Solutions are implemented in the Python programming language.

Some problem notes:

Topological sort:

• Round Trip II (Topo sort + path finder)
• Longest Flight Route (Topo sort + DP)
• Game Routes (Topo sort + DP)

Cycle path:

• Planets Cycles (BFS degree or DFS (good problem))

SCC:

• Planets and Kingdoms (SCC)
• Coin Collector (SCC + DP)

Bellman-Ford:

• High Score (Hard bellman-ford)
• Cycle Finding (Bellman-Ford negative cycle)

Dijkstra:

• Flight Discount (Two Dijkstra)

Eulerian path:

• Mail Delivery
• De Bruijn Sequence

Euler tour:

• Teleporters Path

Binary Lifting:

• Planets Queries I

Maxflow:

• Download Speed
• Police Chase

DP 0-1 Knapsack problem:

• Book Shop
• Coin Combinations I
• Coin Combinations II
• Minimizing Coins
• Money Sums

DP Bitmasks:

• Hamiltonian Flights (dp bitmask)

Other:

• Round Trip
• Flight Routes Check (DFS theorem)