I applied through a college or university. The process took one day.

The OA had three questions: easy, medium, and hard. The first two were worth 50 points, and the last was worth 100 points. The hard question is mentioned below. Most candidates who did two or more questions were selected for the first interview.

There are tiles in a house arranged in a straight line. They are named -, F, and D, where - is an empty tile, F is a food tile, and D is a dirty tile. You need to find the minimum cost needed to put all the food tiles together. You can only move a tile one step at a time, only at a clean tile. If the tile is dirty, you have to clean it then move to it. You are given a string, for example "--F-D--F--", and you are given x and y respectively, where x is the cost to move a food tile to an adjacent tile, and y is the cost of cleaning a dirty tile. You are also given "q", which is the number of queries. Your input looks like n and q, where n is the length of the given string, and q is the number of queries. There is s, which is the input string of tiles. There are x and y, which are the queries given q times. If q is 1, you will only have one row of x and y, and so on.