The interview was for 1 hour. Initially was given a minute to introduce myself. The interview consists of two sections

1. Case specific, theoritical questions.

   • Given a DB of a customer, how do you find the number of friends for that particular customer.
   • You have a fleet of services which has a LB in front of them which assigns tasks in round-robin fashion. Do you think this would be the right infrastucture to solve a case where you want the service to perform a customer disclosure task.
   • You have an API which performes the analytics operation and another API which does credit card transaction updates.
     Which of these would be strongly consistent and which one is eventual consistent.
   • You have a service which sends customer email notifications. The service was down for some time and few
     customers ( there is a DB of all customer who are supposed to get the notifications ) have not recieved their notifications.
     How do you identify which customers haven't received the notifications.

2. Coding question. You will ONLY be given 20 mins to solve it. Not an extra min more. In this 20 mins you need to understand/explain your approach and solve the problem. Was given a node tree and asked to find which nodes have single parent and which nodes dosen't have parents.