Can you please explain the given example test case how it arrives to max 13?
Example test case explanation
hi shubham hint video for the same question is provided in the course
algorithm is
Take input N, M, K, S.
Take input 2 - D matrix of size N x M.
Put a loop on the array starting from 0 - 0 index to (N - 1) - (M - 1).
check if the Strength is lower than the threshold viz, K, print "No" and return.
otherwise,
if character is '*', add 5 to the strength.
else if, character is '.' , subtract 2 from the strength.
else, if character is '#', break.
If you are not in the last column, decrement strength by 1.
After the loop, print 'Yes' and strength separated by a new line.
Thanks. It’s done. It is written maximum strength in the problem and not strength.