Amazon SDE-1 | Interview Experience | Accepted ✅
Anonymous User
15188
AmazonInterview

🚀 About Me:

  • 🎓 Education: Tier-3 (CSE), 2024 Batch
  • 💻 Current Role: Software Engineer at a Startup
  • 📈 Leetcode: Guardian (2182)
  • 🔥 Codeforces: Expert (1750+)

🏆 Amazon Interview Experience

Amazon reached out to me via email on 15th November 2024.

📌 Online Assessment (OA) - 19th November 2024

  • 📝 Section 1: Coding Assessment
    • 2 Leetcode Medium questions
    • Solved both in 20-25 minutes
  • 🧠 Section 2: Workstyles Assessment
  • 🎭 Section 3: Work Simulation

🖥️ Round 1: Technical Interview (29th November 2024)

📌 Duration: 53 minutes

1️⃣ 962. Maximum Width Ramp

  • Solved in ~45 minutes using a monotonic stack
  • ⏳ Time Complexity: O(N)
  • 📦 Space Complexity: O(N)

2️⃣ 210. Course Schedule II

  • Solved in ~7 minutes using topological sort (Kahn's Algorithm)

✅ Verdict: Passed
💡 The interviewer was very kind and provided ample hints for the first question.

🖥️ Round 2: Technical Interview (3rd December 2024)

📌 Duration: 1 hour 10 minutes

🔹 Data Modeling Question (OOP + Graph Data Structure)

  • The question involved delivery stations and parcel passage.
  • Required designing 5-6 classes and implementing logic similar to a production-level system.
  • The interviewer provided helpful guidance while modeling the data.
  • Had to write request and response calls, extract key information from the request payload, and implement the solution using topological sort (Kahn’s Algorithm).
  • Successfully wrote the code.

📌 LP Question at the End:
"Describe a situation where you put in extra effort beyond your assigned work and achieved success."

✅ Verdict: Passed

📚 Preparation Tips:

✅ Be comfortable with writing classes and constructors in your preferred language.
✅ Have a strong grasp of OOP concepts.
✅ Master DSA fundamentals.

🖥️ Round 3: Technical + Bar Raiser (23rd December 2024)

📌 Duration: 1 hour

Technical Question:

📌 Problem Statement:
"Two sorted linked lists are given. You need to traverse the lists, starting from any list and ending at any list. You can switch lists at common nodes. Return the maximum sum while traversing the linked lists."

🔹 Example:

L1 = 1 -> 5 -> 8 -> 12  
L2 = 2 -> 4 -> 5 -> 12  
Output: 2 + 4 + 5 + 8 + 12 = 31

🔹 Constraints: Cannot change the data type (i.e., no conversion from linked list to array/vector).
🔹 Solution:

  • Solved using two-pointer approach.
  • ⏳ Time Complexity: O(N)
  • 📦 Space Complexity: O(1)

📌 Follow-up:
"What if we have K sorted linked lists?"
🔹 Solution: Used priority queue (heap).

✅ PS: Wrote working code for the follow-up question as well.

Leadership Principles (LP) Questions:

💡 2 easy LP questions.

✅ Verdict: Passed

🎉 Final Outcome:

📞 Received a call from the recruiter a week later and was offered the role.

✨ All the best to everyone preparing for Amazon interviews!

🔱 हर हर महादेव 🔱

Comments (50)