General
Deadline: N/A
Week 1
Deadline: 2026-05-10 23:59:59
Week 2
Deadline: 2026-05-10 23:59:59
- Coin sum
- Machine
- Steps
- Efficient formula
- Subsequence construction
- All subsequences
- Difference of one
- List game
Week 3
Deadline: 2026-05-10 23:59:59
- Efficiency of deque
- Changing list
- Smallest elements
- Task list
- Flip list
- Smallest on list
- Efficient change
- Choosing boxes
Week 4
Deadline: 2026-05-10 23:59:59
- Set size
- Tree height
- Order of additions
- Min and max
- Previous and next
- Removing element
- Repeating elements
- Traversal
Week 5
Deadline: 2026-05-10 23:59:59
- Topological ordering
- Strong connectivity
- Course plan
- Path count I
- Connections
- All paths
- Graph game
- Path count II
Week 6
Deadline: 2026-05-10 23:59:59
- Bellman–Ford algorithm
- Dijkstra's algorithm
- Best route
- Train prices
- List jump
- Wall breaking
- Measuring water
- Wrong path
Week 7
Deadline: 2026-05-10 23:59:59
- Minimum spanning tree
- Maximum spanning tree
- Components
- New roads
- Largest set
- Same weigth
- Walls and floors
- Spanning trees