Amazon | FTE (2023) | India | [Result (Accepted)]

amazon logo
amazon
new graduate fteindiaOffer
September 18, 202215 reads

Summary

I successfully navigated the Amazon new graduate FTE hiring process in India, which included an Online Assessment and a technical interview. I received an offer after being selected as one of the successful candidates.

Full Experience

This year, Amazon came to our university to hire for new graduate FTE 2023. The eligibility criteria were:

  1. At least 7 CGPA
  2. Students from circuit branches
  3. No current backlog

Part 1: Amazon Online Assessment

The OA included two questions. I completed the first question, which involved finding pairs with a specific sum within a given range, and I also encountered a second question.

Part 2: Amazon Interview

Around 80 students qualified for the interview round. We were initially told there would be 3 technical rounds, with each being an elimination round. However, four students, including myself, were picked and told that since our OA scores were very good, we would only have to give 1 technical round. Luckily, I was one of them.

The interviewer first helped me get comfortable. Then, they asked me to explain the first question from the OA and detail my thought process. I was then asked to optimize the solution, which I successfully did. Later, the interviewer made some changes to the question, which I was also able to solve.

Result

After the interview round, 15 students were selected. Fortunately, I was one of them. I will share my compensation when I receive my offer letter.

Interview Questions (1)

Q1
Count Pairs with Sum in Range
Data Structures & Algorithms

Given an array arr, find the maximum count of pairs (i, j) such that arr[i] + arr[j] = sum where i < j, and sum is within a specified range [x, y] (inclusive).

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!