Two 45-minute interviews were conducted by different recruiters. Each interview included two tasks. You needed to solve these and write code in a Google Doc, adhering to the appropriate code style.

Some tasks were straightforward, such as implementing binary search or finding an element in a binary tree. One task involved finding an Eulerian cycle in a graph (which I did not code in time). Another task required describing how data is stored on a hard drive.

You're given a number sequence. You need to answer queries: given x, find the number in the sequence which is smallest and at least x.