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 email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready. To complete your preparation from learning a language to DS Algo and many more, please refer Complete Interview Preparation Course. In case you are prepared, test your skills using TCS, Wipro, Amazon and Microsoft Test Serieses.