Solve Complex Problems in JavaScript with Dynamic Programming

function createGrid() {
  let newGrid = []
  for (let row = 0; row < items.length; row++) {
    newGrid[row] = []
    for (let col = 0; col < constraint.length; col++) {
      newGrid[row][col] = 0
    }
  }
  return newGrid
}

vs

function createGrid(items, constraint) {
  return items.map(item => constraint.map(() => 0))
}

I am doubtful about the statement : Dynamic programming only works when each sub-problem doesn't depend on other sub-problems. In the example shown above, in case of tent, food, why do we take values from above cell , then ?

@namrata1695, I don't have a specific answer to your question but another example of dynamic programming might help clarify Tyler's opinion: https://www.geeksforgeeks.org/travelling-salesman-problem-using-dynamic-programming/