Skip to content
Related Articles

Related Articles

Improve Article
Save Article
Like Article

Amazon Interview Experience | Set 361

  • Difficulty Level : Hard
  • Last Updated : 11 Jul, 2019


Round 1 :

  1. Given 2 array of size m , n , find the pair from diff array with minimum difference
    Solution: GeeksforGeeks Link
  2. Given the dialer of a feature phone and a dictionary of words , find the string suggestions after dialing n numbers.
  3. Verify if the Tree validates the definition parent_node.data = left_node.data + right_node.data.
    Solution: GeeksforGeeks Link

Round 2 :

Hey geek! It's time to become a success story instead of reading them. Check out our most renowned DSA Self Paced Course, now at a student-friendly price and become industry ready. And if you are looking for a more complete interview preparation resource, check out Complete Interview Preparation Course that will prepare you for the SDE role of your dreams!

Feeling prepared enough for your interview? Test your skills with our Test Series that will help you prepare for top companies like Amazon, Microsoft, TCS, Wipro, Google and many more!

  1. How to handle server scaling up to sudden increased of request?
  2. How to handle scaling the data?
  3. Design BookMyShow tables .

Round 3 :

  1. Given an array of Strings , not necessarily in any order , find out if the string create a chain , such that first last char of a string is the first character of another and thus making a chain including at least all string.
    Solution: GeeksforGeeks Link
  2. Given a party with n people , a given function Knows() , such that A knows B : true if a knows B. A Celebrity would be a person who knows no one but is known by all.

    Find out the celebrity if he exists in the party. I would like the mail id to be kept confidential.

If you like GeeksforGeeks and would like to contribute, you can also write an article and mail your article to contribute@geeksforgeeks.org. 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!