Software Development Engineer I Interview Questions | Glassdoor

# Software Development Engineer I Interview Questions

298

Software development engineer i interview questions shared by candidates

## Top Interview Questions

Sort: RelevancePopular Date

### Software Development Engineer I at Amazon was asked...

Jan 28, 2016
 The on-site interview was a group interview format. They split the group up into teams of three and had one overarching problem that was then split into three separate coding problems where each member of each three person team picked one of the three coding problems to work on. The three coding problems were related to each other in the sense that the output from one would be the input for the other.1 AnswerI worked on the coding problem from 9am until 3:30pm. You can solve the problems on your own in the time allotted, however you should work in a group and show your teamwork skills. My solution produced the correct output, yet I did not receive an offer, showing that you do not need to complete the problem in order to receive an offer. They just want to see how you work.

### Software Development Engineer I at Amazon was asked...

Jan 11, 2012
 Find all pairs of numbers in an array that sum to a given number, n, in linear time1 AnswerAgain, the general idea is to make one pass through the array and insert the numbers into a hash table. Then, on the second pass, compute the difference between n and the current value and search for it in the hash table. If it exists, those two form a pair. Repeated pairs were allowed (determined from clarifying question). O(n) time (2n specifically), O(n) space.

### Software Development Engineer I at Amazon was asked...

Aug 21, 2015
 make some coding questions1 Answerpretty well

### Software Development Engineer I at Amazon was asked...

May 24, 2011
 Given a log file containing (User_Id, URL, Timestamp) user can navigate page from one to the other. Find the three page subset sequence repeated maximum number of times. Records are sorted by Timestamp.1 AnswerSolved using queue of queues and Hash table.

### Software Development Engineer I at Amazon was asked...

May 24, 2011
 Bar raiser Given a NumberPool containing number sequence of numbers from 1 to infinity. Implement an interface, essentially two functions- checkin(N): which adds number to the number pool and makes it available. checkout(): returns minimum number from the pool and makes it unavailable.1 AnswerGave 4 implementations using ArrayList (checkin: O(N), checkout: O(N lg N)), Binary Search Tree (checkin: O(lg N) + balancing cost, checkout: O(lg N)), Binary Heap (checkin: O(lg N) + heapify cost, checkout: O(1) + heapify cost) and Hash table (checkin: O(1), checkout: O(N)).

### Software Development Engineer I at Amazon was asked...

May 24, 2011
 Given a acyclic graph, find out its root; that is point where all the nodes converge. eg. G(V, E) = {(A->B), (B->C), (D->C)} C should be the root.1 Answershould be a straight forward.

### Software Development Engineer I at Amazon was asked...

May 24, 2011
 Bar raiser 1. Given array of numbers, find a, b, c such that a + b = c. Can you beat O(N**2) ? 2. Difference between Quick sort and Merge sort. What modifications you make in Quick sort so that it provides O(N lg N) worst case complexity.2 Answers1. Solved using hash table. complexity O(N**2). Told that there exist algorithm 3SUM which beats O(N**2) - http://en.wikipedia.org/wiki/3SUM. 2. Didn't get this question even after he gave me a hint. Answer is to find median in O(N) time(yeah it is possible to find median in O(N) in an unsorted array !) and assign that as pivot in each pass of quicksort. Thus quicksort behaves like merge sort by splitting array exactly in the middle.This is almost the same as 3sum problem and check http://bit.ly/2aJyjFx for full solution and all its variants.

### Software Development Engineer I at Amazon was asked...

Apr 4, 2014
 Writing a Poker game during the on-site interview which is quite efficient in terms of memory and speedBe the first to answer this question

Mar 2, 2015