Me postulé en línea. El proceso tomó 4 semanas. Acudí a una entrevista en Amazon en ene 2022
Entrevista
ONLINE ASSESSMENT PART 1
This was a Hacker Rank Coding Assessment with 2 questions and a time limit of (I believe) 70 mins. The first question was pretty easy. So easy that when I finished I thought I misunderstood the question and when I ran it I was failing test cases so I thought I did misunderstand it. I couldn't figure it out so I moved on to the 2nd question. The 2nd question was also really easy but that was because I got the brute force solution and I was getting "Time Limit Exceeded." So, I went back to the first question and after reading it again I felt like I understood it correctly the first time and when I went through my code again I realized I had put an "==" instead of ">=" so I fixed this. After that all test cases passed. I went back to part 2 and figured out how to not get time limit exceeded. It was a math question and from a strictly math standpoint I knew how to solve it but I couldn't figure out how to code it and I was running short on time. So, in the code I actually commented how you would solve it mathematically and that you should take the same approach when solving it programmatically but I didn't know how to. Yes, I literally wrote "I am not sure how to code this."
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.
Preguntas de entrevista [1]
Pregunta 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.
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.
Preguntas de entrevista [1]
Pregunta 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.
Las mejores empresas en cuanto a "Remuneración y prestaciones" cerca de ti
