It was an on-campus opportunity. We were provided a Job ID from Microsoft and asked to apply on their career portal. Eligibility required a CGPA greater than 7.5, and then the date for our OA was decided.

It was a test of a total of 80 minutes with 2 problems. Both questions were grid-type and of medium to hard difficulty. I was able to solve only 1 problem, so my name did not appear on the list of 40 students shortlisted for the interview round. This was my first opportunity.

A 2D grid contains some obstacles and some guards, each facing a direction and protecting the entire row/column in front of them.

An assassin is standing somewhere in the grid and wants to reach the end of the grid without being caught by guards. The assassin cannot move on cells with obstacles, cells guarded by a guard, or out of the grid.

We just need to return a boolean value (0/1). The assassin can only move to 4 adjacent cells in one move.