<pre class="shiki github-dark shaku"><code>// This is a JavaScript coding problem from BFE.dev /** * @param {string[][]} message * @return {string} */function decode(message) { const arr = message; let secretMessage = ""; let currentLocation = { row: -1, column: -1 } // Base condition while (true) { const nextDiagonallyDownLocation = getNextDiagonallyDownIndex(currentLocation.row, currentLocation.column); const nextDiagonallyUpLocation = getNextDiagonallyUpIndex(currentLocation.row, currentLocation.column); if (canMoveDiagonallyDown(arr, nextDiagonallyDownLocation)) { currentLocation = nextDiagonallyDownLocation; secretMessage = secretMessage + arr[nextDiagonallyDownLocation.row][nextDiagonallyDownLocation.column]; } else if (canMoveDiagonallyUp(arr, nextDiagonallyUpLocation)) { currentLocation = nextDiagonallyUpLocation; secretMessage = secretMessage + arr[nextDiagonallyUpLocation.row][nextDiagonallyUpLocation.column]; } else { break; } } return secretMessage;}function getNextDiagonallyDownIndex(row, column) { return { row: row + 1, column: column + 1 }}function getNextDiagonallyUpIndex(row, column) { return { row: row - 1, column: column + 1 }}function canMoveDiagonallyDown(arr, nextLocation) { const { row, column } = nextLocation; if (arr?.[row]?.[column]) { return true; } else { return false; }}function canMoveDiagonallyUp(arr, nextLocation) { const { row, column } = nextLocation; if (arr?.[row]?.[column]) { return true; } else { return false; }}</code></pre>