# Companies matching "Amazon.com"

Sort: Popular Date
Sort: Popular Date

### Area Manager at Amazon.com

Sep 17, 2009
 “You have 25 laborers for a shift. Pickers pick 100 units an hour Small item packers pack 150 units an hour Large item packers pack 25 units an hour You must pack 7500 small units during a ten...”

### Software Development Engineer at Amazon.com

May 9, 2012
 “Given an integer set of numbers, print all the subsets. For some reason the interviewer asked to print the supersets, but what he means is subsets.”

### Software Engineer at Amazon.com

May 12, 2010
 “Given a list of integers, some of which may be negative, extract the pair that sums to the largest number.”

### Software Development Engineer at Amazon.com

Jan 18, 2012
 “"Solve a maze", you have a 2D matrix with 1's as blocked and 0's as path. Find a path from one corner to another, backtracking should be allowed.”

### Software Development Engineer at Amazon.com

Mar 20, 2009
 “How would you implement a top 3 word count in a text editor application?”

### Software Development Engineer Intern at Amazon.com

Feb 15, 2012
 “To return the 'm' smallest numbers from a file of 'n' numbers”

### Software Development Engineer In Test at Amazon.com

Jan 27, 2012
 “Asked to implement a function that takes an integer and returns whether or not the number had an odd or even number of 1 bits.”

### Software Development Engineer at Amazon.com

Jan 29, 2012
 “Given a binary tree with the usual left and right pointers on each node, and additionally a parent pointer, make an algorithm to discover the closest ancestor to 2 nodes on the tree.”

### Senior Software Engineer at Amazon.com

Sep 28, 2011
 “Given an array of integers A[1...n], compute the array B[1...n] such that B[k] is the product of all the elements of A, except A[k]. Part ii) Try to do it without division (some mobile devices...”

### Software Development Engineering Intern at Amazon.com

Jun 23, 2012
 “You are given an array with n positive integers where all values in the array are repeated except for one. Return the one that is not repeated.”
2130 of 3,858 Interview Questions