Homework before week 2

This week we will cover some basic algorithmic techniques:

  • sorting

  • binary search

  • BFS and DFS for graph traversal

Homework reading

We will follow Competitive Programmer’s Handbook by Antti Laaksonen. Please read at least the following parts to prepare for week 2:

  • Chapter 3: Sorting (including Section 3.3: Binary search)

  • Chapter 12: Graph traversal (covers BFS and DFS)

Homework problems

Here you will find a mini-contest with two tasks. Please ask the course staff if you need help solving the homework tasks!

Use the pre-created CSES homework account assigned to you. Its name will look like aalto26bh_NNN. You will receive the account credentials at a course meeting; do not use a personal CSES account.

The homework contest details and point submission form will be added here soon.

Posting submission...