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.
Software Development Engineer In De Test Interview Questions
6,448 software development engineer in de test interview questions shared by candidates
Question Graphs
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.
All questions were technical or problem solving. I never expected any of them to be difficult or unexpected.
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.
Given a keyboard, how would you test it?
Nothing was tough.. You had to just make sure that you answered the question to the point.
Find the loop in a linked list whose length is not specified
Write a compiler subroutine for ensuring all brackets and parentheses are paired. If an unpaired bracket/parenthesis is found, report its line number.
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 6271 - 6280 interview questions