-
Notifications
You must be signed in to change notification settings - Fork 13
Interview Experience 12
#SoftwareDevelopmentEngineer
##First Online round: 20 MCQs and 2 coding questions.
Coding Questions were:
-
Add 3 numbers represented as linked list
-
Given an array find largest product of 3 numbers such that numbers are in increasing order and result should be printed in order in which numbers appear in input array.
##Second round F2F interview:
-
Given a matrix return all the indexes of unique rows where even orientation of rows matter ex. 1 2 3 is not equal to 1 3 2
-
Given a matrix find an element such that it exists in all the rows some discussion on time complexity of sorting and searching algorithm
##Third round F2F interview:
-
Tell me about yourself
-
Given a binary tree make every level a linked list and store all the heads of linked list and return that. firstly i gave level order traversal approach then constraints were introduced like O(1) space , no usage of queue etc..
##Fourth round F2F interview:
-
Tell me about yourself
-
Dijkstra Algorithm explain with example
-
Top view of a tree
-
kth largest element in an infinite running stream of numbers
-
Daemon's process and a question related to it and connected to AWS(Amazon web service)
-
Normalization in DBMS
##Fifth round Bar Raiser Telephonic interview:
-
Tell me about yourself
-
whats your motivation to join amazon
-
finding the maximum sum subarray (All negative case must be considered)
-
Given a linked list and a number k swap every first and kth element in blocks of k nodes and links must be changed not data swapping.
walkover of codes with inputs he desired
-
Find minimum numbers of jumps to reach end of array
-
Do u have any question
All the coding related questions required working code snippet.