Amazon Software Developer Engineer In Tests Interview Questions. 84 Interview .. Only programming questions were asked even for SDET interviews. SDET Interview Questions. Page: 1 2 3 . amazon-interview-questions. of 1 vote . Question is code getHeavy when number of balls are not determined. So, this is a short post on my experience with Amazon’s interview process. Most of the time questions revolve around “How will you handle.
|Published (Last):||12 November 2009|
|PDF File Size:||3.55 Mb|
|ePub File Size:||1.1 Mb|
|Price:||Free* [*Free Regsitration Required]|
Amazon web services are widely used accross the world. Return the shortest journey. Write all the possible questiond returned from a calculator pad where a start number move in a L direction in any directions moves ie.
Start from 2, move 2 down, 1 leftit will be 7 ie. Start from 2 move 2 down, 1 rightit quuestions be 9 ie. Start from 7 move 1 left, 2 upit will be 2 ie. Start from 7 move 1 up, 2 leftit will be 6.
Given a string s, break s such that every substring of the partition can be found in the dictionary. Return the minimum break needed.
The resultant string should be a combination of the strings given in the array. The given array of characters may contain repeated elements. Got Sp00ked by MS simple question. Eight Ball problem, questoons Minimum steps to determine the heaviest one. Anyone know the answer is 2 in case of 8 balls. Question is code getHeavy when number of balls are not determined.
Write second most repeating word in a string eg aaa bbb ccc aaa bbb aaa answer – bbb. Given an unsorted array, sort it in such a way that the first element is the svet value, the second element is the smallest, the third element is the second largest element and so on.
Do you think Questkons f is a good idea for real engineering? Given a choice, what other ‘order of’ measure would you propose to use? If qusstions were to sort 10 elements, what sorting method would you have used? If you were to sort 1 trillion unicode characters, what sorting method you would have used?
No library functions allowed.
As you guys know, C did not have,and does not have anything called class. Thus, here is the problem for you. Given you have C, and you need to implement class like behaviour, how you would do it? Specifically, implement the following in C: A Simple Hello class questkons hello function printing “Hello, World”.
A new operator which enables creating this constructor less class.
A delete operator that deletes the pointer. How would you do it? If you did not use it, please take a look around. You do not have to write one. BUT, you have to do something similar.
Given a file name not a pathand an initial directory, you have to list all the file paths, which matches the file name, case should not be considered. Also allow regex match. Again, the problem is non trivial. It was expected to ask the right questions. Word count of the file. Line count of the file.
The problem is non trivial for 3 reasons. It was expected to ask about the non triviality. None actually understands how garbage collection works, albeit people ask this in the interviews.
Nonetheless, we are going to ask you something very similar. Here is the problem.
Take an array of bytes, perhaps 1MB in size. Implement these two operations:. Now, here is your problem. If it is not possible, you need to compact defragment memory.
Amazon Interview Questions
So, you need to implicitly write a:. Solve this whole problem. Time allocated was 1 hour. Face to face, panel with 2 interviewers. Imagine there are brick boulders, all of integer size. Their sizes are stored in an array. The figure looks something like this: You have to answer how much water the boulders are holding questionss.
Write code, imagine you have a general purpose tree.
Amazon SDET Interview Experience #1 – InterviewBit | Blog
Now, explain which one would be faster, and why? Explain from the design and the code you have written. As you know, every OS comes up with this tiny queshions called the calculator. Now, wdet is our problem. If we try to implement the function. I have to write if upon if upon if upon if to do for all operators.
Moreover, some operators are not even binary! Take example the abs or say the negate! With the if mode, we can not even add operators as we wish to without changing code! But that is a sin. So, what do we do? That is question 1.
In question 2, as a software tester, how do you propose to test and automate the above? Writing more if than the developer is not allowed. We all know databases are very very slow. In fact they are so slow that very serious amaxon who wants to do volumes of read operation and search operations write their own implementation.
In this question, you would be asked to do the same, for a very limited operation – select. Every item stored has this field called timestamp. Now, here is the problem queestions need sdst solve:. Imagine you have millions of data rows. How to store it in HDD, and how to load, entirely your problem. None is going to insert anything on existing data – only read. Write an algorithm that solves this problem, and a data structure that works as storage for the data.
Implement the following using it: If else if else condition. Almost everyone can do the above. Now, prove that it works. Also tell which class of grammar the string belongs to.
Showcase why your algorithm is a language recogniser for the same. You are given 20 interviwe to solve in 20 minutes. If you successfully solve the question, you would receive 2 marks. If you failed to solve the question, and you do not try it let questikns untouchedyou would receive 0 marks.
If you solve it wrong i. With the story, here are the qmazon Given the question paper is multiple choice, between 4 choices a,b,c,d do a bias analysis e. Obviously, you can get a maximum 40, and a minimum Now, put yourself in the position of the examiner, and try to ensure it is almost impossible to increase payoff by random selection qestions the questions. Try to negate the bias. That is question 3.
Amazon SDET Interview Experience #1
In all 3 cases write an algorithm. Face to face interview, time allocated was 60 minutes. Given two sorted lists or arrays and a number k, create an algorithm to fetch the least k numbers of the two lists.