You have a list of numbers from 1-1000, each number only exists once and they are in random order. You randomly take one out. How do you know which is the missing number?
Engineer Software Interview Questions
511,875 engineer software interview questions shared by candidates
Questions about the basics of main subjects including DS, DAA, Java, C++, C, SQL etc.
For a given binary tree, assign the sibling pointer of each node. A sibling is always the node to its immediate right on the same level of the tree.
Smallest missing natural number in a linked list in linear time without a hash table.
Write a function that calculates the root of a given number.
Find Kth minimum node in a binary tree and suggest a complexity
Given an array of integers, find the sub array with the largest sum. (must be done in linear time)
Given two events, each with a start and end time, implement a boolean check to see if they overlap.
Optimize the algorithm suggested above
In an array you have all the numbers from 1 through n (not in order) with one number missing. Find that number. Now, you have two numbers missing. Find both the numbers. Notes: O(n) time solution, O(1) extra space. n may be very large, so beware of overflows!
Viewing 1081 - 1090 interview questions