Every company has a different way of interviewing its candidates. From new startups to giants like Google, Microsoft, and Amazon, more and more companies today are opting for coding interviews.
Coding Interviews were pioneered by Microsoft to assess potential employees and were then adopted and developed by other companies such as Google and Amazon. As opposed to traditional job interviews, where you may be asked about your education and previous experience, coding interviews are meant to test your technical knowledge, coding ability, and creativity by asking you to solve coding problems in face to face interviews, usually on a whiteboard.
Preparing yourself for a coding interview is a bit different than preparing for a traditional job interview. Your best strategy would be to training yourself to solve as many coding problems as possible. There are a lot of websites where you can find problems to practice with, but if you’re wondering what are the most asked questions during Amazon coding interviews, this article is right for you. Read on to find out what are the most asked Amazon coding interview questions
1. K largest elements in an array.
Arrays are one of the most asked topics during coding interviews. For this type of problem you’d be asked to write a program that can print the largest elements in an array. For example, if the given array is [98, 4, 65, 1, 40, 13, 11] and k=2, then your program should print 98 and 65, the two largest elements in the array.
2. Find a triple a, b, c such that a2 + b2 = c2
This problem, or variations of it, can be solved through hashing. If you’re taking an Amazon coding interview, you should be practicing Hashing a lot, since this is another topic that is frequently asked.
3. Binary tree traversal questions
For example, you may be asked, given a Binary Tree, to write a program that prints Left view of it, or to convert it to a Doubly linked Lis (DLL) In-Place.
4. Rotten Oranges
The so-called Rotten Oranges problem is often given to candidates at Amazon. Given a matrix of dimension m * n, where each cell in the matrix can have values 0 (empty cell), 1 (the cell has fresh oranges), or 2 (the cell has rotten oranges), the task is to determine the minimum time required so that all the oranges become rotten. A rotten orange at index [i, j] can rot other oranges at indexes [i-1, j], [i, j-1], [i+1, j], [i, j+1] (up, down, left and right).
This is a well-known problem and several types of solutions are possible: for example, you could use Dynamic Programming or a BFS approach. You should practice different types of approach, so you could be asked to use one in particular.
5. The Stock Span Problem
The stock span problem is a financial problem where you have a series of n daily price quotes for a stock, and you need to calculate the span of stock’s price for all n days.
For this problem there are several solutions possible: you could use stacks or a different kind of approach. Once again we suggest practicing at least a couple of possible solutions.
For each Amazon coding interview question we described you can easily find solutions on the internet so that you can practice every problem and every type of possible solution. You’ll find out that any problem has possible variations, so be flexible and practice as much as different problems as you can.