Amazon visited our campus for internship and placement. The Selection Process starts with an online test comprises of 20 technical questions involving data structures,operating system basic concepts,algorithms and aptitude questions and two coding questions.
First Round Questions
- Given an array find all sets of size 3 having sum of elements less than a given number k.
neveropen Link - Find n-th magic number.
neveropen Link
27 out of 150 were selected for the second round.
Second round questions.
- given a BST with additional information at each node howmany nodes in its left subtree and right subtree. find the kth largest element in that tree.
neveropen Link - merge two sorted linked list.
neveropen Link
15 out of 27 got selected.
3rd round questions.
- Given two rectangles diagonally opposite coordinates. find whether a rectangle is completely overlapping the other or not.
neveropen Link - Given a binary tree create a new tree which is mirror image of that tree.
neveropen Link - Given three consecutive even numbers. prove mathematically that atleast one of them is divisible by 6.
neveropen Link
If you like neveropen and would like to contribute, you can also write an article using write.neveropen.co.uk or mail your article to review-team@neveropen.co.uk. See your article appearing on the neveropen main page and help other Geeks.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
Related Practice Problems
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 neveropen!