I recently interviewed for Amazon SDE 2. There was a **online test** followed by **4 rounds** of online interviews.

__Online Test : 2 Questions.__

1. You are a in flight Movie service provider. You are given a list of movie lengths and the duration of the flight. return a pair (2) movies whose combined length is the highest and is less than or equal to flight duration. If multiple such combinations are possible, return the pair which has the movie of longer longest duration.

Ex :

MovieLenghts : {27, 1,10, 39, 12, 52, 32, 67, 76}

Flight Duration : 77.

The 2 possible pairs are (1,76) and (10,67), The answer is (1,76) as per the last constraint.

2. You are given a list of pairs of items(strings), each pair is an association. Return the association group with the highest number of elements. If two groups have same size, return the group that has the lexological smallest element between these 2. Also while returning the group, return it in a lexological sorted order.

Sample Input : {{Item0,Item1}, {Item2, Item3}, {Item0, Item4}}

__Round 2 : Technical Round – 2nd Try__

1. Given a list of pairs of characters “Pairs Array” and a list of double numbers “Weights Array” resolve the weights of query array.

Sample Input :

Pairs Array : {{a,b}, {b,c}, {c,d}, …}

Weights Array {5.0, 7.0, 2.0,…}

Query Array {{a,c}}

Explanation : each object in Pairs array is associated with the equivalent element in the weights array as follows.

a/b = 5.0, b/c = 7.0, c/d = 2.0.

Query = {a,c} = a/c = a/b * b/c = 5.0 * 7.0 = 35.0

So the answer is 35.0.

Do Note that the Weight Array can have Zeroes.

2. asked to write code, explain algorithm and space, time complexity.

__Round 3 : Hiring Manager Round: (Design)__

1. Brief Introduction.

2. Describe project I have worked on.

3. Some technical questions on the projects.

4. Explain a situation where you had to go deep to resolve an issue.

5. Design a file sharing system with Version control of files. (Dropbox)

#interview experiences #amazon #marketing #interview

31.00 GEEK