c developer interview questions shared by candidates
Sequence of numbers in random order and 1 of them is missing how to find that out...
N(N+1)/2 - sum of the input = missing number
It isn't stated that sequence starts from 1. The sequence could be 8,9,5,6!
If the sequence is guaranteed to contain only positive integers, it can be done like so: Read in the sequence, noting the MIN and MAX numbers. The sum IF it started from 1 would be MAX(MAX-1)/2. The sum of the 'missing' numbers (from 1 up to where the sequence actually starts) is (MIN-1)*MIN/2. The missing number is given by taking the difference between the two: X = [MAX*(MAX-1) - (MIN-1)*MIN]/2.
If you were designing a multi-threaded program to crunch numbers and do highly cpu intensive processing would you expect a single threaded program to do better or one using 50 threads and why?
Q: Check if a number is a power of 2. Q: Write code for pair-sum(a version of subset sum where the sum of two number is equal to the expected sum, rather than optimization problem, it is decision problem) problem. How to solve it in O(n lg n) and O(n) time. Q: What is the difference of pointer and reference in C++. When to use those ?
See Interview Questions for Similar Jobs
- Human Resource
- Registered Nurse
- Sales Associate
- Dental Assistant
- Graphic Designer
- Truck Driver