You're given an array of numbers, and you want to find 3 numbers that sum to 0 and output those 3 numbers. You can use each number multiple times. So if you're given the array [-1, 1, 2], you would output [-1, -1, 2] because -1 -1 +2=0
Engineering Consultant Interview Questions
56,348 engineering consultant interview questions shared by candidates
Given an array of length N containing numbers bounded between 1 and N with exactly one duplicate, determine what the duplicate number is in O(n) time without using more than constant memory (no making new arrays of N length).
1. find the dominator of an array with 1,000,000 element and complete within O(n) complexity 2. find the element P in an array which all the elements before P less than or equal to P and the elements after P larger than to equal to P.
Why should we hire you?
You have two arrays with N integers in them. Merge those arrays using a recursive algorithm so that the integers in the final array are sorted.
The question was asked in the personal interview. You are climbing a stair case. It takes n steps to reach to the top. Each time you can either climb 1 or 2 steps. Write a program which computes in how many distinct ways can you climb to the top.
Given a list of "threads", which contain 2 variables - starting and ending times - implement a function that will return all running threads at some time t. Optimize it. (faster than O(n) )
If you were a baker and I was to ask you to bake me a cake what would you do?
if we had a list of n nodes, what are the maximum number of edges there can be for a directed acyclic graph?
Can you think of an example of a scenario where you would want to use a tree with more degrees of branching than a binary tree?
Viewing 41 - 50 interview questions