Hackerrank round first and then two LC questions as the final round (BFS/DFS medium). Also had a behaviour component, testing the leadership principles and how my experiences aligned with them.
The process took 1 day. I interviewed at Amazon (Seattle, WA) in Feb 2012
Interview
Met the HR rep at the university career fair, i was asked some simple array questions and it went pretty well
Got an email a couple of days later and scheduled an on campus interview, which is two 45min back to back technical interview. Both interviewer were very friendly and helpful
Interview questions [1]
Question 1
I will not give away the interview questions since I've signed the NDA. However, the advises I can offer is:
1: make sure you are FULLY prepared before you attend the interview, they are not EASY. by FULLY prepared, I mean, do a very serious review on your data structures and algorithms!
2: Never begin solve the question before you completely understand what the question is asking. most of the time the interviewer's instruction maybe misleading, not quite accurate or hard to follow. If that happens, do not be afraid to ask for clarifications.
3: Try an example after you write your code. remember to take care of boundary cases such as empty array or null pointer exceptions
4: If you prefer working alone, let your interviewer know, they can let you working alone and come back, or they will try their best not staring at you.
5: Be FULLY PREPARED and good luck!
Expect one behavioral LP question followed by a leetcode medium or hard for two rounds. Be prepared to answer in depth on the behavioral questions and review LeetCode’s list of questions from Amazon.
Interview questions [1]
Question 1
Tell me about what AI platforms you use to help you work more efficiently
HR interview, then I had 1 45 minute coding round with 10 minutes behavioral and 35 minutes coding. Behavioral round was typical star format questions probing at leadership principles. Ex. Tell me about a time you took initiative and it didn’t work out.
Interview questions [1]
Question 1
Given an m x n grid of characters board and a string word, return true if word exists in the grid.
