Amazon Interview Experience | Set 403 (On Campus for Full Time)
Last Updated :
11 Jul, 2019
Codding round (90 min):
20 objectives from DS, OS, DBMS, Networking and 2 coding questions:
-
https://www.hackerrank.com/contests/dakshonline/challenges/yule-ball
- https://www.hackerearth.com/practice/data-structures/arrays/1-d/practice-problems/algorithm/i-demand-trial-by-combat-13/
ROUND I:
- Given a binary string (e.g. 01, 101, 011), in each iteration 0 becomes 01 and 1 becomes 10, find kth character in the string after nth iteration. GeeksforGeeks Link
simple approach, time complexity, express time complexity in terms of n only
efficient approach, explanation, time complexity
- Given n ropes of different lengths, connect them into one rope. cost to connect two ropes is equal to sum of their lengths. connect the ropes in minimum cost :
GeeksforGeeks Link
- When and why merge sort is preferred over quicksort – time/space complexity
ROUND II:
- Project discussion
- Make binary tree symmetric – which all cases are possible, which traversal is used and why
- Make half of the linked list reverse (iterative, recursive) and some questions from linked list
- Recursion, data structure that is used in recursion
- C++ string, overloading of + operator in string class
ROUND III:
- Design a data structure to show most frequently purchased item to a customer, show items that are frequently purchased in a given time span GeeksforGeeks Link
- Priority_queue, map/unordered_map, sliding window concept
- Search a given word in a dictionary (approach, time complexity, cost of insertion/deletion of new word in different data structures) GeeksforGeeks Link
- Binary search tree, AVL tree (Rotation, Insertion, Deletion), Trie data structure
- Search a pattern in given string (Simple approach & Using KMP algorithm), handle all the cases GeeksforGeeks Link
- LRU Cache Implementation
ROUND IV:
- Introduce Yourself
- Project discussion
- Convert a given Integer to its corresponding Roman numeral GeeksforGeeks Link
- Hamiltonian cycle & few graph questions (Cycle in directed/undirected graph) GeeksforGeeks Link
In between they asked some questions from OS, DBMS, Networking:
– Belady’s Anomaly, Context Switching, Conflict Serializability, Functions of some OSI-layers etc..
Like Article
Suggest improvement
Share your thoughts in the comments
Please Login to comment...