Amazon Interview Experience for Internship Improve Improve Like Article Like Save Share Report 1st round (Online) 30 MCQs and 2 coding questions 1) Find the contiguous sub-array with maximum sum (Kadane’s Algorithm) 2) Find mean, median and mode of an array of integers. 2nd round (F2F) 2 coding questions 1) Clone a linked list with an additional random pointer 2) Search in a row wise and column wise sorted matrix 3rd round (F2F) 2 coding questions 1) Print the boundary of a binary tree. But this wasn’t the solution according to him. Leaf nodes that are surrounded by other nodes are not be included. Basically print the left view, right view and bottom view of the binary tree. 2) Trapping rainwater problem Last Updated : 25 Feb, 2020 Like Article Save Article Previous Amazon Interview Experience for SDE-1 Internship Next Length of Smallest Subsequence such that sum of elements is greater than equal to K Share your thoughts in the comments Add Your Comment Please Login to comment...