Engineering Support Interview Questions

11,188 engineering support interview questions shared by candidates

There is an NxM grid containing a robot at (1, 1) and a destination at (N, M). Robot can move only up or right. Some locations can have obstacles. Find the number of unique paths from (1, 1) to (N, M). What is the time complexity of your algorithm?
avatar

Software Engineering Intern

Interviewed at Google

4.4
May 10, 2010

There is an NxM grid containing a robot at (1, 1) and a destination at (N, M). Robot can move only up or right. Some locations can have obstacles. Find the number of unique paths from (1, 1) to (N, M). What is the time complexity of your algorithm?

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.4
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 1 - 10 interview questions

Glassdoor has 11,188 interview questions and reports from Engineering support interviews. Prepare for your interview. Get hired. Love your job.