René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"Code","url":"https://leetcodejavascript.com/solutions/minimum-cost-to-make-at-least-one-valid-path-in-a-grid","name":"#1368 - Minimum Cost to Make at Least One Valid Path in a Grid - LeetCode JavaScript Solutions","description":"Given an m x n grid. Each cell of the grid has a sign pointing to the next cell you should visit if you are currently in this cell. The sign...","programmingLanguage":"JavaScript","codeRepository":"https://github.com/JoshCrozier/leetcode-javascript","codeSampleType":"JavaScript","text":"/**\n * @param {number[][]} grid\n * @return {number}\n */\nvar minCost = function(grid) {\n  const queue = [[0, 0]];\n  const directions = [[0, 1, 1], [0, -1, 2], [1, 0, 3], [-1, 0, 4]];\n  const bfs = grid.map(r => r.map(_ => Infinity));\n  bfs[0][0] = 0;\n\n  while (queue.length > 0) {\n    const [x, y] = queue.shift();\n    for (const [dx, dy, value] of directions) {\n      const [cX, cY] = [x + dx, y + dy];\n      if (grid[cX]?.[cY]) {\n        const updatedValue = bfs[x][y] + (grid[x][y] !== value);\n        if (updatedValue < bfs[cX][cY]) {\n          bfs[cX][cY] = updatedValue;\n          queue.push([cX, cY]);\n        }\n      }\n    }\n  }\n\n  return bfs.at(-1).at(-1);\n};","keywords":"LeetCode 1368, #1368 - Minimum Cost to Make at Least One Valid Path in a Grid, Hard, JavaScript solution","learningResourceType":"Code","isAccessibleForFree":true,"educationalLevel":"intermediate","interactivityType":"mixed"}