A Hackerrank Challenge:
Given an NxN matrix, slice it and find the minimum sliceweight.
A slice consists of all the elements that are below,below right, or below left of the element above it. TheMin Slice Weight is the minimum sum of all elements in theslice.
Example: given input
1 2 3
4 5 6
7 8 9
The slices would be 1 4 7 1; 1 4 8; 1 5 7; 1 5 8; 1 5 9; 2 4 7;2 4 8; 2 5 8; 2 5 9;2 6 8; 2 6 9 ….etc.
KEEP IN MIND THAT THE MATRIX IS NOT 3 X 3, BUT N X
OR
PayPal Gateway not configured
OR
PayPal Gateway not configured