Status: 2-3 YOE, MS CS in Canada
Position: SDE in Fintech Startup
Location: East Coast, Canada
Date: May 21, 2021

• Online Assessment (90 minutes):

  I got asked following two questions in the 105 minute time limit on hackerrank:

  Storage Optimization or Maximum Area after Horizontal & Vertical cuts - Greedy based solution.
  CloudFront Caching - Underlying problem is to find different connected components in a graph.
  I implemented both questions but was failing 1 test-case in both of them.

• Onsite (4 rounds): Each round was an hour long.
  - Round 1 : Coding - Binary Tree Traversal based question using DFS + 2 LP questions for 20 minutes
  - Round 2 : Bar raiser/Hiring Manager round. Interviewer was senior, asked and drilled down in LP questions a lot + Coding - Tree Lowest Common Ancestor
  - Round 3 : Low Level Design (TicTacToe) + LP Questions
  - Round 4 : High Level Design (Facebook Messenger) + LP Questions

All the interviewers were very humble and helpful. Coding rounds were fairly easy for me. Didn't do well in the third round as I hadn't prepared well enough for low-level designs. Interviewer was generous enough to give hints along the way.

Result: I am not keeping my hopes high, since, I am aware that I lagged clarity in LP explanantions plus low-level design.