Round 1 - OA

90 minutes - 3 questions

1. Rotting Oranges
2. Course Schedule II
3. Given a 2d array of size N X M. Each cell contains either '0' or '1', find number of paths from the cell (0,0) to the cell (N-1,M-1), such that the sequence formed by the cells is a Palindrome -> Meet in the Middle.
   N, M <= 15

Interview Round 1

2 DSA questions in 1 hour, had to code on google docs

1. Decode Ways 2 - Solved completely
2. House Paint 3 - Could only discuss the approach, and pseudocode for optimal solution

Interview Round 2

60 minutes
Had to design a Proctored Exam System

1. ER Diagram
2. Classes
   Interviewer was friendly and gave hints

Interview Round 3

• Discussed about my hackathon project in detail, design decisions etc.
• CDN, DNS, GeoDNS
• DBMS normalisation and its adv/disadv

Verdict - Rejected : No feedback