Since this was a testing interview and not full out development he had some testing terms I had never heard of these include: Equivalence Class Testing Pair Wise Combinatorial Testing Failure Mode Analysis the only one I heard of was: White Box vs Black Box testing The coding portion was not difficult the question was this Write a function that takes two lists of strings and return a list of Strings with all of the intersections of the strings ex: List1 = {"a","a","a", "b", "d"} List2 = {"a", "a", "c", "d"} expectedReturn={"a","a","d"} Also he asked what tests cases I would use to validate the function also he wanted to know the run time analysis of the function
Development Engineer Interview Questions
37,103 development engineer interview questions shared by candidates
i) Given a value v, in a BST find the next value in order.
How would you implement integer division if your language did not offer it.
Find k largest/smallest number in a series of numbers. What data-structures will you use? Code it on white board.
* Merge two sorted linked list. The merged list should also be sorted. * Compact a string. i.e remove spaces * traverse a link list containing char* as data. test cases for the same. * reverse a string. test cases for the same. * remove all the given characters from a string.
The infamous "clock hands" question--how many times do the hour and minute hands of a clock overlap in a 24 hour period?
Implementing a dictionary of quick searching words
given two linked lists with a digit in each node, add the two linked lists together. the result must be a linked list with one digit in each node. use only one iteration of the two input lists.
What is a stack?
Pancakes, size varies, and are put in a stack with random order. You have one operation called Flip(int[] pancakes, int k) to flip all pancakes from the top one to kth pancake, write a sort(int[] pancakes]) method
Viewing 81 - 90 interview questions