how to find the closest predecessor of a node in binary by doing inorder traversal.
Senior Software Development Engineer In Test Sdet Interview Questions
3,735 senior software development engineer in test sdet interview questions shared by candidates
Implement enqueue and dequeue using stacks.
permutation
Write a program that acts as an application scheduler that runs executables at given times.
Given a list of integers, return the longest contiguous subsequence that adds up to the largest value.
Given a linked list and a number k, find the k-th node from the end and return it. An example: List: A-B-C-D-E-F K K: 2 Return F:
All of the questions are fairly easy. Be prepared for communication skills and big oh analysis.
What would be your ideal job?
Write a program that takes in a string and removes any duplicate spaces (including leading and trailing spaces – there should be none when finished). This program should not have any embedded loops, and you can only traverse the string ONCE. Should definitely be faster than O(n^2).
What problems will you point out in any products of Microsoft if you're going to improve it?
Viewing 321 - 330 interview questions