Ich habe mich über eine Hochschule oder Universität beworben. Der Vorgang dauerte 1 Tag. Vorstellungsgespräch absolviert im Apr. 2025 bei Amazon
Vorstellungsgespräch
The interview experience was ok and i was asked to type the code in editor they provided and deeply asked about the each word in the code about time complexity and space complexity.
Fragen im Vorstellungsgespräch [1]
Frage 1
find the k th largest element in an array optimal solution
Vorstellungsgespräch absolviert bei Amazon (Tel Aviv-Yafo)
Vorstellungsgespräch
Applied online and received an Online Assessment. It consisted of two LeetCode-style coding problems with a time limit . The process was straightforward and fully automated with no human interaction at this stage.
Fragen im Vorstellungsgespräch [1]
Frage 1
Solve a coding problem involving array manipulation under a timed online assessment
There were 2 rounds- one DSA round and one HR round.
In the first round they asked me a DP + trees question which was of medium to hard difficulty.
In the second round the interviewer asked me about my resume, my projects, some computer fundamental questions.
Ich habe mich über eine Hochschule oder Universität beworben. Vorstellungsgespräch absolviert im Mai 2026 bei Amazon
Vorstellungsgespräch
This was an On Campus opportunity. First was the Online Assessment, which consisted of 2 questions, solved both. Then they scheduled two rounds of mandatory interviews, both focusing on DSA, Problem Solving, Behavioral Questions and GenAI Fluency,
Fragen im Vorstellungsgespräch [6]
Frage 1
The first question was standard Longest Common Subsequence, interviewers expected me to first explain the brute force solution and then move on to the optimal approach.
"Tell me a time when you worked on a problem which was difficult for you".
"How do you use GenAI in your day to day work?"
"Tell me about a project where you've used GenAI"
Given an array, you can do a merge operation where you merge (or sum) two adjacent equal numbers, remove both the numbers, and replace with the new merged number. For example, [3 1 1] becomes [3 2]. Now you can operate infinite number of times, and you need to return the smallest final array after doing all the possible operations optimally, e.g. for [1 1 1 1] the answer will be [4] and not [1 2 1].
