The process took two weeks.

• First was an OA round with three questions on graphs: largest sum cycle, max weight node, and nearest meeting cell.
• Then there was a hackathon part A. It consisted of a question about the tree of space based on an n-ary tree.
• Then there was a hackathon part B, in which we had to make the previous solution thread-safe.

My next round is not scheduled yet, and I'll update you later.

They asked me about multithreading, race conditions, and locks in Java.