Skip to content
Related Articles
Get the best out of our app
GeeksforGeeks App
Open App

Related Articles

Amazon Interview | Set 64 (Off-Campus for SDE)

Improve Article
Save Article
Like Article
Improve Article
Save Article
Like Article

I am sharing my off campus SDE interview experience with Amazon.

Online round: (1hr)

  1. Given coin array and a sum K, find min. number of required coin to make sum K.
  2. Two rectangles are given in two D space. Find if these are overlapping or not
  3. KMP for pattern searching

After two days I got the call to come Amazon office for F2F interviews:

1st Round:

  1. Program to construct binary tree from its inorder and preorder traversal. (algo+code)
  2. Reverse every k-element in a linked list(algo+code)

2nd Round:

  1. Tell me about one of your best project in detail.
  2. Design Restaurant reservation system.

3rd Round:

  1. Given a binary search tree of n nodes, find all the pair of  nodes whose sum is equal to a given number k in O(n) time and constant space.(algo+code)
  2. Given a function “f” in which 0 occurs with probability 0.4 and 1 occurs with probability 0.6. Using function “f” deduce a new function “f1” such that both 0 and 1 occurs with probability 0.5
  3. Given a matrtix, find the maximum sum subarray in it.(algo+code)

After one week I got the call from HR for my BR round.

4th Round (BR Round):

  1.  Tell me about yourself.
  2.  Why are you looking for change?
  3.  How will you handle conflict with your manager?
  4. What is the most challenging work done by you  in your current company?
  5. Lots of discussion happened about current company’s project.
  6. Given a number N, find the smallest 3 digits number  such that product of its digits is equal to N. ( algo+ optimal code)

In all the rounds, the most optimal production quality working code was required and if you get stuck, then they will give you HINTS but don’t consider this in your favor!

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
Last Updated : 18 Jun, 2019
Like Article
Save Article
Similar Reads