Round 1 (Online Assessment Test)

The online test consists of 2 coding questions to be completed in 60 minutes. The questions were of medium difficulty level and I was able to solve both of them in under 45 minutes.

Here’s the first question:

(I think it is available on the premium version of leetcode) Count the Number of K-Big Indices

You are given a 0-indexed integer array nums and a positive integer k. We call an index i k-big if the following conditions are satisfied:

->There exist at least k different indices idx1 such that idx1 < i and nums[idx1] < nums[i].

->There exist at least k different indices idx2 such that idx2 > i and nums[idx2] < nums[i].

Return the number of k-big indices.

Example:

Input: nums = [2,3,6,5,2,3], k = 2

Output: 2

The second question was a medium level question based on strings. I don’t exactly remember the question.

I had to complete a 15 minute survey after the completion of my Online Assessment. It was more like a personality test.

I gave the Online Assessment in September and did not get any mails regarding my selection or rejection for two months. I thought I had been rejected. But then I received a mail in mid-November regarding my interview schedule. I had 10 days for my interview preparation and the mail clearly stated that I’ll be asked two coding questions.

Amazon Interview Experience 2m-Internship

There were two rounds of my selection process.

Similar Reads

Round 1 (Online Assessment Test):

The online test consists of 2 coding questions to be completed in 60 minutes. The questions were of medium difficulty level and I was able to solve both of them in under 45 minutes....

Round 2 (Technical Interview):

My interviewer introduced themselves and asked me to introduce myself and then asked me the kind of difficulties I faced during working on my MERN-stack project that I had mentioned in my resume. He then jumped into the coding questions. I was provided an online IDE by amazon itself and I had to code my solutions and dry run them over there itself. Both the questions are available on Leetcode....

Contact Us