Engineering Coordinator Interview Questions

45,088 engineering coordinator interview questions shared by candidates

* You are given 2 eggs. * You have access to a 100-storey building. * Eggs can be very hard or very fragile means it may break if dropped from the first floor or may not even break if dropped from 100 th floor.Both eggs are identical. * You need to figure out the highest floor of a 100-storey building an egg can be dropped without breaking. * Now the question is how many drops you need to make. You are allowed to break 2 eggs in the process
avatar

Engineering

Interviewed at Cisco

4.1
Jan 4, 2012

* You are given 2 eggs. * You have access to a 100-storey building. * Eggs can be very hard or very fragile means it may break if dropped from the first floor or may not even break if dropped from 100 th floor.Both eggs are identical. * You need to figure out the highest floor of a 100-storey building an egg can be dropped without breaking. * Now the question is how many drops you need to make. You are allowed to break 2 eggs in the process

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
avatar

Software Engineering Intern

Interviewed at Meta

3.6
Aug 6, 2015

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

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).
avatar

Software Engineering Intern

Interviewed at Microsoft

4
Oct 28, 2015

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.
avatar

Software Engineering

Interviewed at Block

3.3
Sep 19, 2012

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.

Viewing 31 - 40 interview questions

See Interview Questions for Similar Jobs

Glassdoor has 45,088 interview questions and reports from Engineering coordinator interviews. Prepare for your interview. Get hired. Love your job.