Skip to content
Related Articles

Related Articles

Amazon Interview Experience | WoW 2020 (6 months Internship)
  • Difficulty Level : Hard
  • Last Updated : 13 Oct, 2020

Amazon WoW is an initiative which gives an opportunity to women students in their final or pre-final year to work at Amazon as an intern or full time employee. The process started with filling an application in Amazon WoW website, in the application basic info about college, branch, resume were to be submitted. After a few days based on the resume mail was sent regarding the round 1 test.

The test consisted of 28 MCQ’s (C++, data structures etc.) and 2 Medium level coding questions.

I was able to solve both the coding questions so I passed the round 1 test.

Round 1 Technical interview:

The interview was online and took place on Amazon Chime platform. The interview started with my introduction and followed by his. After this he jumped straight into the coding questions.



I was asked 2 coding questions:

  1. Given a graph of n nodes and e edges.

           Find the minimum number of edges that must be added to the graph to make it strongly connected.

           Example:

                  n=4, e=2

                   [1,2]

                   [3,4]

                 Output: 1

                 Here 1–>2 and 3–>4 are connected to make it strongly connected we need to join either 1–>4 or 2—>4 or 3–>1 or 2–>3



            Approach: This can be done by finding number of strongly connected components using DFS. If there are N strongly connected components then the                          minimum  number of edges that must be added to the graph to make it strongly connected would be N-1.

      2.   Minimum path sum    

I was asked to tell the time complexity before writing the code. ( clean code in my preferred language)

Round 2 Technical interview:

The interview started with my introduction and followed by his. After this he jumped straight into the coding questions.

I was asked 2 coding questions:

  1. Flattening a linked list
  2. Merge k sorted arrays (priority queue approach)

Some discussion on priority queue insertion time complexity was also done.

Round 3 Technical interview:

Usually Amazon internship have only 2 rounds but sometimes if they do not have enough data points on a candidate they conduct an additional round.

So I had this round 3.

In this round he asked me:

  1. Convert a sorted linked list into a balanced BST
  2. An efficient data structure for searching, inserting and deleting.

Lot of discussion was done on the 2nd question. He was satisfied with Hashing method.

Few DS, CN, OS questions were asked at the end.

Verdict: Selected

Knowing how to calculate time complexity is important. Staying confident, calm and focused throughout increases your chance of clearing the interview.

The secret of cracking an interview is Never Giving Up.

Practice from GeeksForGeeks, LeetCode and any other coding platform with which you are comfortable.


Write your Interview Experience or mail it to contribute@geeksforgeeks.org

My Personal Notes arrow_drop_up
Recommended Articles
Page :