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?
Programmer Trainee Interview Questions
712,980 programmer trainee 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.
The first Jedi question was this: given an unsorted array of numbers, like [1, 3, 5, 4, 2], write a function that takes an integer and returns true if there's any pair of numbers in that array that can be summed up to the input integer.
Implement a method to determine whether a string is a palindrome.
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.
Viewing 1231 - 1240 interview questions