AMD Interview Experience | Sr. Software System Designer | Bangalore
- Location
- Bangalore
- Experience
- 5 years
- Posted
- 7 Oct 2026
Summary
I interviewed with AMD in Bangalore for a Senior Software System Designer role with 5 years of experience and received an offer.
How it went
I recently interviewed with AMD, Bengaluru for a Senior Software System Designer role with around 5 years of experience. Sharing my interview experience for anyone preparing for similar roles. Round 1 - Coding + Resume (Online)
- Easy/Medium LeetCode-style coding.
- Lowest Common Ancestor (LCA) of two nodes in a Binary Tree
- Detailed discussion around my projects and resume.
- Focus was on problem-solving approach, code quality and complexity. Round 2 - OS + Concurrency + Coding (In-Person) Questions covered:
- Mutex vs Semaphore
- fork() and child processes
- User Mode vs Kernel Mode
- Process States
- Threads and synchronization
- CPU caches
- LRU Cache
- Easy/Medium coding:
- Sort an array containing 0s and 1s
- The round was around 1.5 hours. Round 3 - Systems + Current Work (In-Person)
- Deep dive into my current project and responsibilities.
- Producer-Consumer problem.
- C/C++ fundamentals. (free & delete , malloc and new) etc.
- High-performance and system-level programming concepts. Hiring Manager Round (Online)
- Discussion around my current responsibilities and projects.
- Teamwork, collaboration and overall experience. Final Managerial Round (Online)
- Mostly non-technical discussion.
- Day-to-day work, development/release process, cross-team dependencies and joining availability.
- No major coding/technical questions. Outcome Selected and joined AMD as a Senior Software System Designer. Overall, my interview focused heavily on in depth discussion on C/C++, Operating Systems, multithreading/concurrency fundamentals, DSA and practical system-level problem solving.
Questions asked (2)
- 01
Lowest Common Ancestor in Binary Tree
Data Structures & Algorithms · Medium
Given a binary tree and two nodes, find the lowest common ancestor (LCA) of the two nodes.
- 02
Sort an Array Containing 0s and 1s
Data Structures & Algorithms · Easy
Given an array consisting only of 0s and 1s, sort the array so that all 0s appear before all 1s.