Amazon Interview Experience | Set 419

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


Write your Interview Experience or mail it to contribute@geeksforgeeks.org



My Personal Notes arrow_drop_up

Check out this Author's contributed articles.

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

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.




Article Tags :
Practice Tags :


1


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.