##
Amazon Interview experience | Set 325
February 20, 2017

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… Read More »