The AmazeWow assessment was of 30 questions including 2 coding questions.

**Time:** 1.5 hours

**1.** Evaluation of Postfix Expression

https://www.geeksforgeeks.org/stack-set-4-evaluation-postfix-expression/

**2.** Given n dices each with m faces, numbered from 1 to m, find the number of ways to get a given sum X. X is the summation of values on each face when all dice are thrown.

https://www.geeksforgeeks.org/number-of-ways-to-get-a-given-sum-with-n-number-of-m-faced-dices/

The other 28 MCQs were based on Data structures, OOPs, Computer fundamentals, etc.

This round was completely devoted to coding. I was asked to introduce myself and then 2 coding questions were asked.

**1.** Given a sorted array with possibly duplicate elements, the task is to find indexes of first and last occurrences of an element x in the given array.

https://www.geeksforgeeks.org/find-first-and-last-positions-of-an-element-in-a-sorted-array/

**2.** Given an N * N binary maze where a 0 denotes that the position can be visited and a 1 denotes that the position cannot be visited without a key, the task is to find whether it is possible to visit the bottom-right cell from the top-left cell with only one key along the way.

https://www.geeksforgeeks.org/maze-with-n-doors-and-1-key/

I was asked for the time and space complexity of each approach.

At the end of the round, I was asked if I had any questions. And it ended pretty well.

In this round, without even asking for an introduction, the interviewer asked me to code a problem.

**Ques: **Given an array of strings

String 1 : a/b=1.6

String 2 : b/c=2.3

String 3 : p/q=2.8

…

String n: y/m

Then return the value of a/c

There can be more such queries like f/a or anything.

I was asked to cover the corner cases and asked for the time and space complexity of the approach used.

At the end of the round, I was asked if I had any questions and it marked the end of the interview.

This round consisted of a coding problem and some fundamentals of computer networking.

**Ques:** The cost of a stock on each day is given in an array, find the max profit that you can make by buying and selling in those days. Given conditions –

(i) You can make any number of transactions.

(ii) For a particular day, you can either buy or sell a stock, but not both.

(iii) You cannot sell a stock before buying it. (Lol… Quite obvious )

https://www.geeksforgeeks.org/stock-buy-sell/

**Modification:** Modify the code for ‘k’ number of transactions instead of any number of transactions.

I was asked for time and space complexity for each.

Then, Several questions on computer fundamentals and networking were asked in a rapid-fire manner. I do not remember those all, but few of them are –

(i) If we have our services over several locations, how do we reduce the latency for retrieving data?

(ii) What are the types of cache?

(iii) Difference between thread and process.

(iv) Which one is light-weight among thread and process and why?

(v) What happens when we type a URL on our browser?

(vi) How servers handle a large amount of load?

(vii) Networks among systems are centralized or peer to peer?

I answered all the questions to the best of my knowledge. At the end of the round, I was asked if I had any questions.

After giving a brief introduction, I was asked about my projects during my internships.

#interview experiences #amazon #marketing #off-campus

15.30 GEEK