Engineers Interview Questions

898,759 engineers 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?

Viewing 261 - 270 interview questions

Glassdoor has 898,759 interview questions and reports from Engineers interviews. Prepare for your interview. Get hired. Love your job.