SDE-1
Interview Date
OA: Jan 6, 2025; Interview 1 & 2: Jan 28, 2025; Interview 3: Jan 31, 2025; Interview 4: Feb 14, 2025
Result
Rejected
Difficulty
Hard
Rounds
4 rounds + Online Assessment
Drive Type
Full-Time
Topics asked
Detailed experience
College: Not Specified
Interview Date: OA: Jan 6, 2025; Interview 1 & 2: Jan 28, 2025; Interview 3: Jan 31, 2025; Interview 4: Feb 14, 2025
Interview Type: Full-Time
Result: Rejected
Difficulty: Hard
Rounds: 4 rounds + Online Assessment
Topics Asked: Data Structures (Trees, Arrays), Algorithms (Searching, Dynamic Programming, BFS/DFS concepts), Behavioral (Leadership Principles)
The candidate applied in November 2024 and received an Online Assessment (OA) link on January 6, 2025.
Online Assessment (OA): This round consisted of two Data Structures and Algorithms (DSA) problems, described as Medium-Hard, and a Behavioral Section. The candidate solved both DSA questions optimally and completed the behavioral section, successfully passing the OA.
Interview 1 (Jan 28, 2025): This was a standard DSA round with two questions: "Count all the number of uni-valued subtrees" and "Search in a Rotated Sorted Array". Follow-up questions on Time Complexity (TC), Space Complexity (SC), and edge cases were discussed. The candidate solved both efficiently and cleared this round.
Interview 2 (Jan 28, 2025): Conducted on the same day as Interview 1, this was another DSA round. Two questions were asked: a "Variation of Maximum Falling Path Sum" and a "Variation of Rotten Oranges". Similar to the first round, follow-up questions on TC, SC, and edge cases were asked. The candidate solved both optimally and the interviewer was satisfied, leading to this round being cleared.
Interview 3 (Jan 31, 2025): This round focused entirely on Amazon's Leadership Principles (LPs). The candidate confidently answered standard LP questions and cleared this round.
Interview 4 (Feb 14, 2025): This was an unexpected fourth round, unusual for freshers who typically have three. It was another DSA round, consisting of two problems: "Nodes at a k distance in a Binary Tree" and "Lowest Common Ancestor (LCA) in Binary Tree". Follow-up questions on TC, SC, and edge cases were also discussed. Despite solving both questions optimally, the candidate was ultimately rejected after this round.