Amazon Interview experience | Set 325 Last Updated : 08 Jul, 2019 Improve Improve Like Article Like Save Share Report 1st Round(Hackerrank) Given an array, find largest sum of 1) Contiguous subarray 2) Non Contiguous Subarray Largest region of cells problem 2nd Round(Written test) Add two numbers represented by linked list Get a number, find next greater element with same digits Given a sorted array find if a[i]+a[j]=0 (i != j) 3rd Round(ftf) Max Sum level in a binary tree https://www.geeksforgeeks.org/print-nodes-binary-tree-k-leaves/ All Practice Problems for Amazon ! Like Article Suggest improvement Previous Amazon Interview Question Next Goldman Sachs Interview Experience | Set 23 (2+ years Experience for Java Developer Role) Share your thoughts in the comments Add Your Comment Please Login to comment...