Skip to content
Related Articles

Related Articles

Amazon Interview Experience | Set 310 (For Internship)

View Discussion
Improve Article
Save Article
Like Article
  • Difficulty Level : Easy
  • Last Updated : 08 Jul, 2019

Technical round 1:
1 I was asked to implement L.R.U.(least recently used cache) using any DS i want
2 Build a Binary Tree using inorder and preorder

Technical round 2:
1-Quick sort
2-Questions about DBMS and DS to make it more efficient
3-Find minimum and maximum number in an array with minimum number of if statements.
4-Discussion about c++

They didn’t conducted more technical rounds.

If you like GeeksforGeeks and would like to contribute, you can also write an article and mail your article to See your article appearing on the GeeksforGeeks main page and help other Geeks.

My Personal Notes arrow_drop_up
Recommended Articles
Page :

Start Your Coding Journey Now!