Convert the roman numbers to interger values
Senior Software Development Engineer In Test Sdet Interview Questions
3,735 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
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.
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.
Write a compiler subroutine for ensuring all brackets and parentheses are paired. If an unpaired bracket/parenthesis is found, report its line number.
No other question asked.
Search a string to see if it contains a given substring. The given substring can have a '*' - a wild card character which corresponds to skipping one or more characters in the string being searched. Asked qualifiers: Can there be a wildcard character in the string being searched? [yes] ascii? [unicode]
The questions I was asked are previously posed on this thread.
Time complexicity
Viewing 3621 - 3630 interview questions