given n pairs of numbers and one extra number in an array (size of array is 2n + 1) how can you know in O(n) with one iteration over the array which number did not come in pair
Entwickler Interview Questions
467,328 entwickler interview questions shared by candidates
They will ask you technical problems but it's not that difficult you only need to be confident and honest with your answers
4. What is the format of the floating point number? What does the following code do? Does it terminate? Float f,g; f=0; do{ g=f++; } While ((f-g)!=0);
Stream of numbers, design a class to return median
Find the nearest palindrome for a given integer
I was asked 3-4 coding snippets and questions related to static, pass by reference/value, pointers, heap and stack memory allocations. function calls, data types. Implement a function body for a multiplier without any multiplication operation (also to improve my solution in terms of performance)
white board: find the first non-recurring character in a string. i.e. input "abbcdcaea" would return "d"
white board: swap the values of two pointers without a temp variable
pipe A can fill a cistern in t1 time, B can fill it t2 time. How much time can be taken if both pipes are opened.
If there are 256 players in a lawn tennis knockout tournament,how many minimum number of matches should be played to reach the finals?
Viewing 1691 - 1700 interview questions