We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
Mango Blast Pro You are given two N N matrices representing a field of mangoes say A and B. Each cell is one of three possible characters as follows. The two matrices are connected at cells (n-1,6-1) A(n-1, n-1) > B(n-1, 0) > B(0, n-1). Matrix B
there is no valid path between two touchpoints, then no mangoes can be collected & hence return 0. Input: First line contains an integer N which represents the size of the matrix. Its a square matr Next N lines carry a string which represent the row Ri in the matrix where iis (0,n-1). Len is N btw. Constraints : 0
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Mangoes
You are viewing a single comment's thread. Return to all comments →
Mango Blast Pro You are given two N N matrices representing a field of mangoes say A and B. Each cell is one of three possible characters as follows. The two matrices are connected at cells (n-1,6-1) A(n-1, n-1) > B(n-1, 0) > B(0, n-1). Matrix B there is no valid path between two touchpoints, then no mangoes can be collected & hence return 0. Input: First line contains an integer N which represents the size of the matrix. Its a square matr Next N lines carry a string which represent the row Ri in the matrix where iis (0,n-1). Len is N btw. Constraints : 0