Amazon Interview Experience for SDE-1 | Off-Campus 2021 Last Updated : 05 Oct, 2021 Improve Improve Like Article Like Save Share Report Round 1: Two questions were discussed. https://www.geeksforgeeks.org/median-of-two-sorted-arrays/ Most frequent subtree sum in a binary tree. (Using hashing and postorder traversal) Round 2: Coding question https://www.geeksforgeeks.org/boundary-traversal-of-binary-tree/ https://www.geeksforgeeks.org/find-length-largest-region-boolean-matrix/ Round 3: HM Leadership questions, why amazon, etc. Design a class Student that can return the percentage of a student. Round 4: BR Leadership questions like project under a tight deadline etc. Return the sum of all nodes whose Kth ancestor is even. For the maximum length of a sequence in a 2D matrix, you are only allowed to move down or right. Also, a sequence between 2 numbers can be formed only if the consecutive numbers have an absolute difference of https://www.geeksforgeeks.org/longest-increasing-path-matrix/ Like Article Suggest improvement Previous Amazon Interview Experience for SDE-I (On-Campus) Next Celigo Interview Experience for SDE | On-Campus 2021 Share your thoughts in the comments Add Your Comment Please Login to comment...