Amazon

1. 1

   Other round

   Amazon ML Challenge (hackathon)
   Unstop4320 min1 questionseliminatory

   multimodal price prediction · ML modelling

   72-hour hackathon; top 50 rank needed to qualify.

2. 2

   Online test

   Online assessment
   HackerRank90 min2 questionsmixed

   DSA · situational judgement

   Easy-medium coding plus situation-based behavioural choices.

3. 3

   Technical interview

   DSA interview
   Amazon Chime with Google Docs60 min2 questionsvirtualeliminatory

   heaps · binary search on answer · greedy

4. 4

   Technical interview

   ML interview
   Amazon Chime60 minvirtual

   ML breadth · deep learning · LLMs · transformers · resume depth

   Breadth versus depth varies by interviewer.

Advice from candidates

29 pieces of advice, in their own words. Names removed.

• Basic DSA preparation from Striver sheet was enough in my case. Depending on the cycle, the difficulty of questions might differ. Practising medium-difficult level questions and completing the striver sheet should be more than enough for preparation.

  preparation · 2023-24

• Solve more and more problems from LeetCode (Easy and Medium), CodeChef (Division 2, or, 3-4 star level problems) etc.

  test · 2022-23

• Prepare for coding along with solving for the algorithm. Be prepared to describe your projects. Well understanding of COA and/or OS if you had taken them. Otherwise, basic understanding related to IDEs, Terminals, memory-management may suffice. Not so important, but prepare one question to ask the interviewer, if you’d get the chance at the end of your interview.

  interview · 2022-23

• Keep yourself calm. Stay confident reagrding whatever you answer. If you don’t know the answer, tell them that you don’t know. (You may mention the reason, if acceptable by them.) Keep interacting with them in a formal manner. (Not too much formal!) Make it a discussion and not a one-sided lecture-type session.

  interview · 2022-23

Loading the other 25…

Question patterns reported

The kind of problem, not the problem itself. Our practice questions are written to match these patterns.

• Technicalpartition array to minimise maximum pages
• Technicaltree depth or width question
• Technicalmax-sum fixed-size submatrix, approaches only
• Technicalpairwise node swap in linked list, then circular variant
• Technicalset union and intersection on linked lists
• Technicalhash collision resolution basics
• Technicalfast dictionary lookup including all permutations of words
• Technicalvalidate BST from preorder traversal
• Technicalspread time over grid with 8-neighbour infection
• Technicalcheck if two trees are mirror images
• Technicalcombine results of several lookup services
• Codingfrequency sort then greedy assignment of keys to minimise presses
• Codingrow and column count aggregation on a binary grid
• Codingtrack index updates through queries on array of values
• Codingdesign register, login, logout with hash map
• Codingbuy-sell stock with unlimited transactions, array
• Technicalcoin-change style DP question
• Technicalshortest path in tree between two numbered nodes
• Technicalshortest root to leaf path in binary tree
• Technicalmulti-source BFS on grid
• Technicallongest run of ones in array
• Technicalvalidate steps before writing to a file, pseudo code
• Technicalpre-checks before adding values from specific file positions
• Technicalminimise sum of squared differences using limited increments, heap-based