how to find the closest predecessor of a node in binary by doing inorder traversal.
Software Development Test Engineer Interview Questions
5,411 software development test engineer interview questions shared by candidates
Implement enqueue and dequeue using stacks.
Write an algorithm to pick the mayor of a town. There is a random number that is chosen and every nth person on the list is deleted until the mayor is chosen.
Code a solution to rotate bitmap by 90 degrees given a structure definition representing the bitmap and a function prototype for the function to do the rotation.
reverse an int
Write a program that acts as an application scheduler that runs executables at given times.
How to test a calculator?
The questions were easy on my understanding. If i have to rank the questions, then the most difficult among them was, to write a program to generate Roman numerals from the decimal numbers.
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:
Viewing 531 - 540 interview questions