Given a set of N numbers, assume that you have the set of numbers from 1 to N+1, with the exception of one number. How do you determine what number that is? What is the complexity of your solution?
Programador De Entrada Interview Questions
711,029 programador de entrada interview questions shared by candidates
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
Write a method which return how many palindromes are in a word. Eg: barbarabar has 7 (b,a,r,barab,a,r)
algorithm question, competition programming
If you had 100 floors and 2 eggs, what is the most efficient way to determine what floor is the maximum height you can drop an egg and not crack it?
The infamous "clock hands" question--how many times do the hour and minute hands of a clock overlap in a 24 hour period?
* 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.
What a fibonacci function which return N th position number both in recursive and loop, also give the explanation on both implementation on their time efficiency.
Java is pass by value or pass by ref?
Print 11,41,102, 196,325...
Viewing 541 - 550 interview questions