Minimum Strength to reach Destination

Problem Statement

Minimum Strength to reach Destination Problem Description You are given a matrix mat of size m x n . Each cell of a matrix contains strength. A robot needs a positive strength to travel from the top left corner of the matrix to the bottom right corner. At any point in its journey, its strength cannot drop to 0 or less. The cells can contain either 0, positive or negative strength. Positive strength increases the robot's strength by cell value, negative strength decreases the robot's strength by cell value, and no change in strength if the cell value is 0. You are required to calculate the minimum initial strength required by the robot to travel from the source (i.e. the top left corner) to reach the destination (i.e. the bottom right corner) and print the same. Note: A robot can only move one cell at a time, either down or right, i.e. to cell (i+1,j) or cell (i,j+1) and it cannot move outside the matrix. mat[0][0] + mat[m-1][n-1] = 0 Input Format: The input consists of two lines: The f