Convert the roman numbers to interger values
Senior Software Development Engineer In Test Sdet Interview Questions
3,734 senior software development engineer in test sdet interview questions shared by candidates
The most difficult / unexpected question I was asked was how to optimize an algorithm for removing duplicates from a sorted list beyond O(n). It turns out that the solution was still in O(n), but involved parallelism to improve run-time.
Question Graphs
Questions were mostly on data structure (binary search tree, linkedlist etc)
There was no unexpected question. There was a lot of expectation and probing in the area of end to end scenarios and integration test strategy for the testing questions.
Nothing specific.
How would you design a calculator for second graders?
I was asked to count from 1 to N among M people in a loop. People counted as N will be removed and keeping counting from 1 to N until only one people left. Output the position of the last people.
Find the loop in a linked list whose length is not specified
Start with a random linked list--a linked list with a second node pointer that can point to some random node in the list, or to nothing at all. Implement a method that will generate a deep copy of the list
Viewing 3691 - 3700 interview questions