Ho presentato la mia candidatura tramite segnalazione di un dipendente. Ho sostenuto un colloquio presso Amazon (Seattle, WA) nel mese di nov 2020
Colloquio
Started with a 3-round virtual assesment.
1. First was debugging. (For this just try flipping around equals signs and <,> and changing indeces. It's nothing to complicated).
2. Next was a 2 question long leetcode type assesment. I think I had a variation of 2 sum and something with Trees. It wasn't too difficult.
3. Like a workplace assesment. Thought it was weird.
After these rounds I got notified that I qualified for final round. Final round was ~10 minutes of behavioral then right into technical question. They gave me an incredibly hard math question that I had no idea how to solve. The engineer was nice and said I wasn't expected to solve it, but I had no clue what to do. Failed the interview, no offer.
Ho sostenuto un colloquio presso Amazon (Seattle, WA)
Colloquio
Standard LC mediums, nothing too crazy. Interviewer was pretty chill and was helpful in pointing me in the right direction when I needed as well. Only thing I would probably change was to study more on graph problems before hand.
Domande di colloquio [1]
Domanda 1
You are given an 0-indexed integer array weights, where weights[i] represents the weight of the i-th marble, and an integer k.
Your task is to divide the marbles into k bags such that:
No bag is empty.
Each bag must contain marbles from a contiguous range of indices. That is, if a bag includes marbles at indices i and j, then all marbles with indices between i and j (inclusive) must also be included in that same bag.
The cost of a bag that includes marbles from index i to j (inclusive) is defined as weights[i] + weights[j].
The total score of a distribution is the sum of the costs of all k bags.
Return the difference between the maximum and minimum possible scores among all valid distributions.
Ho sostenuto un colloquio presso Amazon (Tel Aviv)
Colloquio
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.
Domande di colloquio [1]
Domanda 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.
Le migliori aziende per "stipendio e benefit" vicino a te
