Amazon Graduate SDE 2025 Dublin | Rejection

amazon logo
amazon
Graduate SDEDublin
April 7, 20257 reads

Summary

I interviewed for a Graduate SDE position at Amazon Dublin and was rejected, despite solving all coding questions correctly. I suspect the issue might have been related to my behavioral answers, as I used examples primarily from college projects.

Full Experience

Has anyone experienced this? I'm a recent graduate with experience from college, part-time jobs, and internships. I had an interview loop with Amazon for an SDE position. I solved the questions correctly, and the interviewers agreed with my solutions. However, I think the issue was that I provided examples from my college projects during the behavioral section. Since it was a graduate position, I didn't think they would expect more. I'm unsure what went wrong, but I received a rejection despite writing three completely correct codes. Has anyone else gone through a similar experience?

The Tech Part

OA

Phone screening: find pairs with target sum (30 minutes)

3 interviews 60 minutes each First 30 minutes LP ( Cant remember the questions)

  • variation of course schedule II
  • API to implement find command ( solved with Trie)
  • Unbounded set where each entry has expiration date and disappears once it is expired ( solved with min heap)

Interview Questions (6)

Q1
LeetCode 2214
Data Structures & AlgorithmsMedium

The candidate was asked LeetCode problem 2214.

Q2
Amazon SDE OA Discussion Question
Data Structures & Algorithms

Refer to the LeetCode discussion link for problem details.

Q3
Find Pairs with Target Sum
Data Structures & AlgorithmsEasy

Given an array of numbers and a target sum, find all pairs of numbers in the array that add up to the target sum.

Q4
Course Schedule II Variation
Data Structures & AlgorithmsMedium

A variation of the LeetCode Course Schedule II problem (Topological Sort).

Q5
Implement Find Command API
Data Structures & AlgorithmsMedium

Design and implement an API that mimics the functionality of a 'find' command, possibly for file system search or string searching.

Q6
Unbounded Set with Expiration Dates
Data Structures & AlgorithmsHard

Implement an unbounded set data structure where each entry has an associated expiration date. Entries should automatically disappear from the set once their expiration date is reached.

Discussion (0)

Share your thoughts and ask questions

Join the Discussion

Sign in with Google to share your thoughts and ask questions

No comments yet

Be the first to share your thoughts and start the discussion!