Application :

• YOE : 2.5
• Got a call from Amazon recruiter

Round 0 - Online Assessment

• Had 2 Coding questions (90mins) + few leadership/behavioural questions
• 1st question was to get the minimum operations required to convert a string of 'H' and 'T' to a sequence of the form of all Ts followed by Hs, where an operation is converting H to T or vice versa.
  • e.g. input : THTH, output : 1 (can be converted to either TTTH or THHH)
• 2nd question was a variation of this problem

Round 1 - Problem Solving (60mins)

• 1st question : DP / Backtracking
• 2nd question : Greedy

Round 2 - Low Level Design (60mins)

• LLD Question : was asked to optimise class design where an operation is performed on multiple classes and the classes share some common attributes. The operation can be of several types and the result of each operation on each class depends upon the attributes of the class and the type of operation applied. Question was open-ended
• Leadership principle question

Round 3 - High Level Design (60mins)

• HLD for Instagram
• Leadership principle question

Round 4 - Bar Raiser (60mins)

• 2 questions were asked
• 1st question : Binary tree + DP
• 2nd question : Give an optimal data structure for finding IP addresses from a list of addresses which repeat atleast than K times (trie was expected) + some follow up questions on different approaches taken by me