Amazon SDE Intern Interview Experience
July 23, 2026 · 0 reads
Summary
I cleared the Amazon SDE Intern interview process, passing the online assessment, two technical rounds, and a behavioral round.
Full Experience
Amazon | SDE Intern / New Grad | Bengaluru
Candidate Profile
- Education: B.Tech in Computer Science @ CMR University
- Target Role: Software Development Engineer (Intern / Entry-Level)
- Location: Bengaluru, India
- Experience: Fresher / Campus Placement
Application Process
Applied via the campus placement drive at CMR University. The process consisted of 3 rounds: an Online Assessment followed by 2 technical interviews.
Round 1: Online Assessment (OA) - 90 mins
- Platform: HackerRank
- Format: 2 Coding Questions + 10 MCQs (CS Fundamentals: OS, DBMS, Networks)
- Q1 (Easy-Medium): Array manipulation / Two Pointers approach.
- Q2 (Medium): Graph Traversal (BFS/DFS) on a grid.
- Outcome: Passed all hidden test cases and advanced to the next round.
Round 2: Technical Interview 1 - 45 mins
- Focus: Data Structures, Algorithms, and Code Optimization.
- Question 1: Given a binary tree, print the bottom view / level order traversal.
- Discussion: Started with a naive approach, then optimized it using a queue-based BFS.
- Question 2: Follow-up on time and space complexity (O(N) time, O(N) space).
- Interviewer Experience: Very supportive; encouraged talking through edge cases (e.g., empty trees, single-node trees).
Round 3: Technical & Behavioral - 45 mins
- Project Discussion: Deep dive into my college project built with Web technologies. Asked about database choices and challenges faced during integration.
- Core Fundamentals: Questions on OOPs concepts (Polymorphism, Abstraction) and indexing in Databases.
- Behavioral Questions:
- "Describe a time you had a conflict during a group project and how you resolved it."
- "Why do you want to join our team?"
Interview Questions (1)
1.
Binary Tree Bottom View (Level Order Traversal)
Data Structures & Algorithms
Given a binary tree, print its bottom view. The bottom view consists of the nodes that would be visible if the tree were viewed from the bottom. Perform a level order traversal using BFS and output the nodes that appear at the lowest level for each horizontal distance.
Preparation Tips
- Explain your thought process: Don't start coding right away. Talk out loud while planning the approach with the interviewer.
- Focus on Patterns: Understanding common patterns (Sliding Window, Two Pointers, BFS/DFS) was far more helpful than memorizing specific problems.
- Mock Interviews: Practice explaining your logic clearly under time pressure.