doing simple dynamic programming for finding squares using previous computation

non-recursive.ts

// begin

const findAllSquares = (n: number) :Array<[number,number]> => {

  let squares : Array<[number,number]> = [[0,0], [1,1]];

  let diff = 1;
  for(let i = 2; i <= n; i++){
    const prev = squares[squares.length-1][1];
    diff = diff + 2;
    squares.push([i, prev + diff]);
  }

  return squares;
}


console.log(
  findAllSquares(15)
)



// end