'Coding has over 700 languages', '67% of programming jobs aren’t in the technology industry', 'Coding is behind almost everything that is powered by electricity'
Amazon interview experience Real time questions & tips from candidates to crack your interview
SDE - 1
Amazon
2 rounds | 4 Coding problems
Interview preparation journey
Preparation
Duration: 8 months
Topics: Data Structures, Dynamic Programming , Trees, LinkedList, OOPS, Stack, Queue
Tip

Tip 1 : Build strong fundamentals in Data Structures and Algorithms. Practise basic data structures like Arrays, Linked List, Tree, Stack, Queues. For Graphs practise - BFS, DFS, Kruskal, Prims.
Tip 2 : Practice coding questions (medium-hard level) on online platforms like CodeZen, Codeforces, CodeChef.
Tip 3 : Practice mock interviews before the real interview.

Application process
Where: Campus
Eligibility: 7 CGPA
Resume tip

Tip 1 : Briefly write you skills in which you are comfortable. Don't try to add anything vague as you will be questioned about everything which is written on resume.
Tip 2 : Have at least two projects on your resume which reflects application of your acquired skills

Interview rounds
01
Round
Medium
Video Call
Duration60 minutes
Interview date3 Jul 2020
Coding problem2

In this round i was tested for Data Structure competency. Two questions were asked.

1. Group Anagrams
Moderate
30m average time
70% success
0/80

You have been given an array/list of strings 'inputStr'. You are supposed to return the strings as groups of anagrams such that strings belonging to a particular group are anagrams of one an...

View more
Problem approach

I first gave a brute force stored string solution . After explaining my solution I was asked to optimise it so I followed up with using a map and unique key to represent the strings(storing counts)

2. Peer to peer network dicussion

Given a peer to peer network, how will you design an algorithm to transfer data from one to node to the other receiver nodes? In its simplest form, a peer-to-peer (P2P) network is created when two or more PCs are connected and share resources without going through a separate server computer.

Problem approach

I discussed the problem with the interviewer and clarified my doubts regarding if there is weight assigned to network link between the nodes. I first proposed dijkstra algorithm but he told me that in large network it would be difficult to implement it. Then I gave BFS approach to him as in BFS we traverse level wise and then we can reach to closest receiver node.

02
Round
Medium
Video Call
Duration90 minutes
Interview date8 Jul 2020
Coding problem2

Two questions were asked in this round on data structures and algorithms.

1. BST iterator
Moderate
20m average time
65% success
0/80

You are given a class named as BSTIterator that represents an iterator over inorder traversal of a binary search tree. You need to implement the following things as follows:

View more
Problem approach

I solved it by using stack and then performing an in order traversal of the BST.

2. K Most Frequent Words
Moderate
36m average time
65% success
0/80

You have been given an array/list 'WORDS' of 'N' non-empty words, and an integer 'K'. Your task is to return the 'K' most frequent words sorted by their frequency from highest to lowe...

View more
Problem approach

I calculated the frequency of each word in the list and then stored it in a map. Then I sorted it with the help of priority queue.

Start a Discussion
Similar interview experiences
SDE - 1
4 rounds | 7 problems
Interviewed by Amazon
2117 views
SDE - 1
4 rounds | 9 problems
Interviewed by Amazon
1225 views
SDE - 1
3 rounds | 5 problems
Interviewed by Amazon
440 views
SDE - 1
3 rounds | 6 problems
Interviewed by Amazon
94 views
Companies with similar interview experiences
SDE - 1
4 rounds | 5 problems
Interviewed by Microsoft
43252 views
SDE - 1
4 rounds | 8 problems
Interviewed by Samsung
9748 views
SDE - 1
2 rounds | 4 problems