I applied online. The process took 2 weeks. I interviewed at Amazon (Irvine, CA) in Aug 2013
Interview
First off was the phone test. Since I know algorithms and data structures, having several years of experience as a software engineer, I passed this one easily.
Then they invite you to a 5-hour long interview that continues through lunch. 2 were behavioral interviews, 3 were technical. Only 1 of the technical interviews I felt was appropriate for asking a level-2 software engineer -- it was based on OO design and data structures, with a little bit of complexity (basically asking which data structure would be the most efficient for their problem).
The other 2 technical interviews were completely asinine and were basically just solving some silly matrix-based puzzles using algorithms. It wasn't necessarily difficult, but it was more like something you'd assign in a Junior/senior level programming course. It has absolutely NOTHING to do with real-world SW engineering. I felt I wasted 5 hours of my life (plus the ridiculous commute to Irvine) attending this interview and that I didn't even get a real chance to show the interviewers what I'm capable of.
Interview questions [1]
Question 1
Can't go into detail because of the NDA. But basically 1 OO/design problem. 2 silly puzzle-solving algorithms. Both involved traversing matrices.
I applied through a recruiter. I interviewed at Amazon (Hyderâbâd) in Aug 2013
Interview
I attended the amazon interview on 3rd Aug 2013 in Hyderabad.
Written test for 1 hour but no limit on time given finally.
1) Given a single linked list of integers determine if it is palindrome. like 1 2 3 4 3 2 1. Need to support 1 2 3 3 4 3 3 1 as well. No extra allocation or space should be consumed.( can use some temp variable).
2) Given an array of integers A . Create one more arrary B fill each element (i th position) with the highest freq element from (0 to ith position in A array).
3) Given a series of number form a binary tree find the least the minimum weight binary tree. The weight of the node is depth x value of the element + weight of the left tree + weight of the right tree.Weight of the root node is the weight of the tree . Find the minimum weight binary tree out of all possible binary trees that are possible. And the code should return the minimum weight.
Interview questions [1]
Question 1
The third question was pretty difficult as per me.
I applied through a recruiter. The process took 1 day. I interviewed at Amazon
Interview
My interview process was atypical. AWS was having a hiring event and had flown several engineers over from Seattle. I met with each of them. Most started out with some pleasantries, then an algorithm question that needed to be whiteboarded. Usually, followed with "what's the big O, can we get any better".
I provided algorithms that I would charitably call "ok"
After the technical interviews, I talked to one of the senior recruiters who asked me my salary requirements and whether I would like to work in Herndon or Seattle.
Everyone was super nice and smart. Spoiler alert: I took the offer they eventually made, and this is the first place I'm going into wondering "Am I smart enough to work here?"
Interview questions [1]
Question 1
Provide two algorithms: one to serialize a binary tree, the other to deserialize it.