Amazon Dublin Frontend Engineer FEE (New Grad) – Rejected After Phone Screen

amazon logo
amazon
Frontend Engineer (New Grad)Dublin
August 13, 2025 β€’ 5 reads

Summary

I interviewed for a New Grad Frontend Engineer position at Amazon Dublin and was rejected after the phone screen, where I faced a challenging DSA problem and questions on Amazon's Leadership Principles.

Full Experience

Wanted to share my interview experience so it helps others in the process.

Timeline:

  1. Applied for SDE-1 (India AUTA) for multiple Roles/Job IDs on June 25 β†’ Got 2 OAs.
  2. Applied for Frontend Engineer Dublin on July 23 β†’ Directly got Phone Screen (probably skipped OA because of previous interest form).

Total Rounds:

  1. Round 0: Resume Shortlisting
  2. Round 1: Online Assessments (OA)
  3. Round 2: Phone Screen

OA 1 (India SDE-1):

Difficulty: Medium-Hard

Topics: DSA-heavy β€” I can’t share exact Qs, but expect standard high-quality Amazon-style problems.
Time: Almost took 50+ minutes.

OA 2:

Difficulty: Medium

Topics: Arrays, Sliding Window, HashMaps β€” time-sensitive, edge-case heavy.
Time: Was able to complete in 13 minutes.

Phone Screen (Dublin FEE):

  • DSA Problem: Focused on Binary Search + Prefix Sum, with optimal solution via Segment Tree. I gave a brute-force O(N) first, then tried optimizing (Binary Search in O(log N)) β€” implemented ~50%. Couldn’t finish fully due to time constraints.
  • LPs (Leadership Principles): Took 40+ minutes. Very important. Interviewer asked to structure responses using STAR and go deep into past experiences.

No frontend questions.

Outcome:

Rejected.

My Reflection:

  • LP part went well. Interviewer was supportive.
  • I struggled a bit with DSA optimization under time pressure.
  • Was my first serious interview at this level β€” learned a ton.

πŸ“Œ Will keep applying. This process gave me clarity on what to improve next.
Happy to answer if anyone has questions.

#amazon #interviewexperience #leetcode #frontendengineer #newgrad #dsa

Interview Questions (2)

Q1
DSA Problem: Binary Search, Prefix Sum & Segment Tree
Data Structures & Algorithms

A Data Structures and Algorithms problem that required knowledge of Binary Search and Prefix Sum. The optimal solution was identified to involve a Segment Tree. I attempted a brute-force O(N) solution first, then tried to optimize with Binary Search in O(log N), but could only implement approximately 50% due to time constraints.

Q2
Amazon Leadership Principles
Behavioral

I was asked multiple questions related to Amazon's Leadership Principles. The interviewer stressed the importance of structuring my responses using the STAR method and elaborating on past experiences in detail. This section of the interview lasted over 40 minutes.

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!