Skip to content
Related Articles

Related Articles

Microsoft Interview Question for Internship

View Discussion
Improve Article
Save Article
Like Article
  • Difficulty Level : Hard
  • Last Updated : 09 Mar, 2016

Round 1- Coding round

You are given a matrix nxm filled with integers. There is a robot which has to travel from the cell (1,1) to cell (n,m) and the robot can move only one cell to the right or downwards. The robot requires strength to travel from one cell to another. He can only move forward if his strength is positive. When he moves to a cell , the cell value is added to his strength(value can be negative or positive). Calculate the minimum strength you have to give to the robot initially so that he can make it to the last cell.

If you like GeeksforGeeks and would like to contribute, you can also write an article and mail your article to See your article appearing on the GeeksforGeeks main page and help other Geeks.

My Personal Notes arrow_drop_up
Recommended Articles
Page :

Start Your Coding Journey Now!