Status: 7 Years Exp.
Position: SSE
Location: Bangalore
Date: January 11, 2020

Onsite(1st Round)

• Behavioral question : Most challenging work done recently?
• Write a program to check Endianness?
• Maximum Train Station https://www.geeksforgeeks.org/minimum-number-platforms-required-railwaybus-station/
• Serailize and Deserialize data (while sending serialize it and deserialize it after receving it on the other end)
  struct Data { int a; unsigned char b; char *ptr; } ;
  Do we need any extra variable to send above structure data?
  Pointers are specific to your machine and other machine is not aware it, so need to add length variable berfore char *ptr.

2nd Round

• Behavioral question: Explain current role and responsibility?
• Given wall with two types of brick porus brick(absorb water) and opaque brick(can't absorb water). If it rains return true if water reaches to ground. Water can move to neighbor bricks in all 5 direction due to gravity.
  [0,0,1,0,0,1]
  [0,1,0,0,1,0]
  [0,0,0,1,0,0]
  [0,0,1,0,0,0]
  [0,1,0,0,0,0]
  I solved it using DFS.
  follow up: Why DFS?

True: (0,5)->(1,4)->(2,3)->(3,2)->(4,1)
-System Design: Design whatsapp OTP registeration for user.

3rd Round:

• Given BST of numbers and sum k find two numbers which add up to given sum.
  Space Complexity:O(1)
  Time ComplexityO(n)
  Didn't able to finsih code in time.

Result: Rejected

Learning:

• Use timer for practice, and leetcode contest are best to test yourself while solving problem in timing constraints.
• Even though i have solved above mentioned problems earlier, constraints might cause problem, so always optimze your solution while practising.

Hope it might help someone and happy leetcoding..