Amazon
Amazon

Software Development Engineer 1

Binary Tree Cousin Sum

Medium
Round 1 (December)CodingCandidate Selected

Calculate the sum of cousin nodes in a binary tree. The approach involves two traversals: the first to calculate the sum of values at each level and the second to compute the sibling sums. The new node value is the level sum minus the sibling sum.

This question was asked in

Amazon Software Development Engineer 1 Interview Experience

The Amazon interview process consisted of three rounds, featuring a mix of coding, behavioral, and system design questions. Candidates can expect technical questions related to Binary Search and Dynamic Programming in the first two rounds, followed by discussions on project experience and Leadership Principles in the final round. Overall, the interview experience at Amazon appears to be challenging and comprehensive, testing both technical and behavioral competencies.

AI Powered

Share Your Story

Share your interview in your own words — our AI handles the rest. Hardly takes 2 minutes.

Take Mock Interview

Prepare better with expert feedback

Want to Connect 1:1?

Connect with me 1:1 for career guidance, resume reviews, interviews, and more.

Show Your Love!

Connect with us on social media

Binary Tree Cousin Sum | Amazon Interview Question | InterviewRecap | InterviewRecap