There were two coding questions given in this round. The platform used was HackerRank, and both questions had to be completed in their office within 1 hour. Internet usage was strictly prohibited.

1. Find the maximum sum in an array such that no two elements are adjacent. An additional condition was that the first and last elements should also not be taken together. This question was a modification of the standard problem.

2. In a Cartesian plane, there were N tanks and M objects placed. Tanks can fire in four directions (North, South, East, West). The positions of tanks and objects were given as input and were fixed. We had to find a way to give directions to N tanks such that they would not hit any object or any other tanks. If a tank could fire in two directions, a direction whose ASCII code was lesser was given preference.