In a given sorted array of integers remove all the duplicates.
Test Development Engineer Interview Questions
5,598 test development engineer interview questions shared by candidates
Consider a stack of N number of cards which are piled up and in facing down. Each card has a unique number from the range 1 to N. The card is stacked in such a way that it exhibits the following behavior: Take the first card and put it under the stack without revealing. Now the next card on the top will have the number 1 on it. Next take 2 cards one after the other and put is under the stack without revealing. Yes you guessed it right - the next card on the top will reveal a value of 2. This goes on. Eg. for such a series : 9,1,8,5,2,4,7,6,3,10 [for N=10] Write a program to generate such a series for a given N number of cards so that this behavior can be exercised.
1. In an array provide pairs of numbers that add to a particular value 2. In fibonacci series provide sum of all even numbers
A programming involving hashset, 2 questions where I had to list out test scenarios, one more question involving how to improve API's that are over and under used.
2. Find top 100 maximum number from a continuous input stream.
Asked to implement a function that takes an integer and returns whether or not the number had an odd or even number of 1 bits.
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
* 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.
Implement clearbit(int n, int p) function, p is the position of the bit to be cleared. Example : n is 13, p is 0. Binary representation of n : 1101. You need to clear the pth postion, means 0th position bit needs to be cleared.
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.
Viewing 11 - 20 interview questions