SDE 2
Interview Date
Not Specified (experience shared March 31, 2024)
Result
Selected (Received offer letter)
Difficulty
Challenging
Rounds
4 rounds
Drive Type
Full-Time
Topics asked
Detailed experience
College: Institute of Aeronautical Engineering (Hyderabad), Graduated 2021
Interview Date: Not Specified (experience shared March 31, 2024)
Interview Type: Full-Time
Result: Selected (Received offer letter)
Difficulty: Challenging
Rounds: 4 rounds
Topics Asked: Data Structures, Algorithms, System Design, C/C++, Python, Bash scripting, YANG
The candidate, with 2.6 years of experience, was interviewed for an SDE 2 role at AMD after a recruiter posted job openings on LinkedIn.
Round 1: Technical Interview (1 Hour) The interviewer asked the candidate to implement a Queue using a Stack and explain AVL trees and their applications. A scenario was presented where a custom binary search tree (BST) class performed poorly on search after receiving a large data stream, and the candidate had to analyze the issue (unbalanced tree) and suggest solutions like self-balancing trees (AVL or Red-Black).
Round 2: Technical Interview (45 min) Technical questions involved solving the Rainwater Trapping problem and verifying the height balance of a binary tree.
Round 3: Technical Interview (45 mins) The candidate was asked to write code to find the first duplicate element in an array with O(n) time and O(1) space complexity. Other questions included writing code for inorder, preorder, and postorder tree traversals, and solving the N stairs problem (counting ways to climb stairs by 1 or 2 steps).
Round 4: Technical Interview (2 Hours) This final round was an in-depth technical challenge requiring code for various tasks: searching for a number within a sorted n*n matrix, checking if all nodes in a tree were at the same level, comparing strings for rotations, finding the common node where two separate linked lists intersected, memory management (allocating and deallocating memory for a dynamically sized matrix), matrix operations (multiplying two matrices), and creating a binary tree by summing corresponding nodes from two given trees.
The candidate received positive feedback and an offer letter. The process was challenging but rewarding, with friendly and encouraging interviewers. Tips included brushing up on data structures, algorithms, coding skills, and showcasing problem-solving abilities.