Skip to content
Related Articles

Related Articles

Amazon Interview Experience | Set 162

Improve Article
Save Article
  • Difficulty Level : Hard
  • Last Updated : 27 Jun, 2019
Improve Article
Save Article

Round 1:

Q-1: Word Break Problem

Round 2:

Q-1: Search an element in a sorted and rotated array

Q-2: Given a string of 0s and 1s, count the number of substring which start and end with 1.

I was rejected after round 2 because I did not do well in round 1, was put on hold.

Was called again

Round 1:

Q-1: Determine if Two Trees are Identical

Q-2: Check for Children Sum Property in a Binary Tree

Round 2:

Q-1: In a tennis tournament of N players every player plays with every other player.
The following condition always hold-
If player P1 has won the match with P2 and player P2 has won from P3, then Player P1 has also defeated P3.
Find winner of tournament in O(N) time and O(1) space. Find rank of players in O(NlogN) time.

Q-2: Given N scientists and K black holes, each scientist can query on radius, size and temperature of a black hole, what data structure would you use?
Following queries are important.
Which scientist had queried on which black hole.
What were the queries made by that scientist.

Round 3.
Q-1: Max sum path in two arrays

Q-2: Dice throw

Round 4:

Discussion on current project in company and college problem.

Questions on OS.

Q-1: Given 2 files find common words.
Both files are too large to be loaded in memory.

Q-2: Point of inflexion in an infinite mathematical graph which is strictly increasing then strictly decreasing. Simple binary search was not the solution.

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
Related Articles

Start Your Coding Journey Now!