**1) (Telephonic round 1)**

a. Print a matrix in spiral order (Code)

Soln: Solved it using recursion. Each recursive call was supposed to print boundary elements. On every recursive call, shifted the origin point and passed the new size of the matrix.

b. Given a pair of brace {}. Validate it. (Code)

Soln: using two variables (i.e open_count and close_count) and proceed further.

c. What if we have multiple types of braces? (Approach)

Soln: Using stack.

**2) (Telephonic round 2)**

a. Given the list of songs. How would you shuffle it? (Code)

Soln: Gave various approaches from naive to optimal. The optimal one was similar to the shuffling of the array of ints.

b. Give list of words. Print all anagrams together. (Code)

Soln: Used Hashmap with key as “sort(str[i])” and value as List which is anagrams.

**3) 3: In-house 1**

There are various varieties of clothes (say shirt). Varieties are based on parameters like pattern, size, color, etc.

a. What will be your input format so that it can store all values of all parameters?

List<List<String>>. Each List<String> denotes values for a particular parameter

b. Design a class for a shirt for the same requirement.

c. You have to return all different types of shirts that can be formed based on various combinations of input parameters. (Code)

d. Assuming you have all types of shirts available. Now there are various queries like:

i. Show all types of shirts having color “red”,

ii. Show all types of shirts having size “small” and pattern “check” etc. etc.

So how will you store I/P so that this requirement can be fulfilled efficiently?

**4) In-house 2**

a. Given a Binary Tree. Assuming each node denotes some x,y coordinate. root node denotes (0,0). Write a code to display the coordinate of all nodes.

case (i): Tree is complete and no node’s x-coordinate is overlapping. (i.e all nodes will expand along the x-axis so that no node overlaps). (Code)

o(0,0) / \ o(-1,-1) o(1,-1) / \ / \ o(-2,-2) o(-1,-2) o(0,-2) o(1,-2)

Here we can see that many nodes are overlapping over x-cordinate.

case (ii): Tree is incomplete and no node’s x-coordinate is overlapping. (Approach)

case (iii): Tree is incomplete and the node’s x-coordinate can overlap. (Approach)

b. Design a DS to perform

Insert

Search

Delete

get Random

All in O(1).

Soln: Focus on Delete and get_Random. On further analysis, the only get_Random was required to me modified. Only a bit of tweak will serve the purpose.

**5) In-house 3**

a. Given the array of ints. Assuming total no. of elements is even. We need to tell whether this array can be grouped in sets of pairs such that the sum of each pair is divisible by K.

eg: 0,2,4,8,12,20,18,4 and k=4

so (0,8), (2,18), (4,20), (4,12) is one such set in which sum of each pair is divisible by k. (Code)

b. There is a vertical rod. Discs of various radiuses are inserted in it. When we will try to take out any disc then 1st all the discs above it has to be taken out. Taking out a disc and putting it back is counted as one step.

Considering this, what will be the minimum no of steps in which these discs of the various radius can be stored in sorted order in the rod.

Only a minimum no of steps was required. “How to sort” was not required. (Approach)

c. Given array of ints. find ar[i],ar[j] such that j>i and ar[j]-ar[i] is maximum. Famous problem. (Code)

**6) (Semi-Technical- Hiring Manager)**

a. Normal HR questions. Why Amazon over your previous company, some areas where you want to improve, define dream job, and similar other questions as per the discussions.

As per feedback: my answer for “Why Amazon over prev company” was not clear here.

b. Given two arrays of ints of size m and m+n in sorted order. merge it inplace. Famous problem. (Code)

c. Given string.

Qusn: Find the char occurring max no of times.

Soln: Simple one. Take an auxiliary array of size 256 and maintain the frequency of each char. Scan auxiliary array and get the required char. O(k+n) where k=256 here.

Counter Qusn: Why O(k+n)? Why can’t it be O(n) only?

Soln: At the time of maintaining freq of each, compared to get max freq char also. No need to travel aux array again. O(n)

Counter Qusn: What if memory size is only 100 bytes?

Soln: Detailed one.

Counter Qusn: Assuming updating freq of each char takes 1sec, so it will take N secs roughly. How can we improve it?

Soln: Use multi-threading for parallel programming.

Counter qusn: Will there be any issue?

Soln: In case one acquires lock, the other one that needs lock will go in waiting. This adds extra time and so can take more than N secs.

Counter Qusn: How to improve this?

Soln: Detailed one.

And many more such counter questions.

**7) (Amazon Seattle. Semi HR. Analysis of thought process- BAR RAISER)**

a. Again the same question. Why Amazon over the previous company?

This time I was prepared 🙂

b. One +ve point and one -ve point from the amazon India site.

c. Was prepared for this and already did some pre-analysis on the site.

Many more such HR questions.

d. Analysis of thought process:

Assuming a new building is going to be constructed for IT official purpose. 75 floors. You are builder. This building will be on lease for diff companies.

i. How many lifts you will add in that building?

ii. At which floor each lift will stop?

Note: At each step, I had to identify the required data after analysis and then only data for the same was provided.

Soln (i): (As it is totally based on thought process, so counter-question from your side is good point)

1. No of Lifts are determined by many factors. Major factors are height of lift and no of persons working in that building.

2. I was knowing height of building. To calculate no of persons, I asked size of each floor. It was 100 sq m each floor.

3. Each floor will have cubicles and other rooms and passages. Assuming 70% of total area is used by cubicles.

4. Each cubicle will have 4 persons. After calculation, it came to be 40 employees per floor. So 3000 employees in whole building.

5. Next analysis was: In most of the IT companies, the in/out timing is flexible. Generally in time is b/w 9:00-11:00 and out is b/w 5:00-7:00.

6. We have 2hrs of the window in which all employees will use the lift. So no of lifts will depend on this factor also.

7. After calculation, it came out to be approx 9 lifts (which was a good no according to him).

Soln (ii): Now the qusn is at which floor each lift will stop.

8. AS we don’t know how many companies will be there in this building at any time, so it is advisable to provide equal chance for employees on the basis of floor no. rather than on the basis of the company.

9. Best way would be to minimize the no. of stops of each lift.

10. This can be done by giving each lift equal no of floors on which it will stop.

11. It can simply be calculated as 75/9= 9 (round off).

12. So 1st lift will have floor buttons b/w 1-9, 2nd will have b/w 10-18, and so on.

13. This approach was best (according to him) for the current scenario.

14. Remember that each floor should get an equal chance and we don’t know how many companies will be there.

Tips: Geeksforgeeks, Careercup, Cracking the coding Interview (Book) +++++.

Finally got offer in few days. 🙂 Very satisfied.

If you like GeeksforGeeks and would like to contribute, you can also write an article and mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

## Recommended Posts:

- Amazon SDE-1 Interview Experience | Amazon WOW-2020
- Amazon Interview Experience SDE-1 | Amazon-WOW 2020
- Amazon Interview Experience | Set 249 (Telephonic Interview)
- Amazon Interview Experience (Telephonic Interview)
- Amazon Interview Experience | Set 180 (Telephonic Interview )
- Amazon Interview -SDE 1 Interview Experience
- Amazon Interview | Set 30
- Amazon Interview | Set 18
- Amazon Interview | Set 19
- Amazon Interview | Set 32
- Amazon Interview | Set 31
- Amazon Interview | Set 28
- Amazon Interview | Set 29
- Amazon Interview | Set 27
- Amazon Interview | Set 22
- Amazon Interview | Set 20
- Amazon Interview | Set 21
- Amazon Interview | Set 26
- Amazon Interview | Set 25
- Amazon Interview | Set 23