Open In App

Amazon Interview Experience | Set 419

Last Updated : 12 Jul, 2019
Improve
Improve
Like Article
Like
Save
Share
Report

Round 1: There were three questions in first round:-

  1. How to find all boundary node of a tree. GeeksforGeeks Link
  2. How to reverse a string using without any other variable. GeeksforGeeks Link
  3. From an array, Need to find an index in which sum of left elements & sum of right elements are same. GeeksforGeeks Link

 

Round 2:  

  1. Sort an array arr = {1, 0, 0, 0, 1, 0, 1, 1, 1, 1} with o(n) complexity. It is also called segregation of an array. GeeksforGeeks Link

Like Article
Suggest improvement
Previous
Next
Share your thoughts in the comments

Similar Reads