Iterative solution to a task

iterative_squares.ts

export class G964 {
  public static decompose = (n: number) => {
    const decomposeWithIndex = (rest: number, index: number, currentResult = []) => {
      var repeat = true;

      var saved = [];
    
      while (repeat) {
        repeat = false;
    
        if (index < 0) {
          if (saved.length > 0) {
            const lastSaved = saved.pop();
            rest = lastSaved.rest;
            currentResult = lastSaved.currentResult;
            index = lastSaved.index;

            repeat = true;
            continue;
          }

          return null;
        }
        
        if (index * index > rest) {
          index = index - 1;
          repeat = true;
          continue;
        }
        
        
        if (index * index === rest) {
          return [index, ...currentResult];
        }

        // index * index < rest

        saved.push({
          rest,
          index: index - 1,
          currentResult,
        });

        rest = rest - index * index;
        currentResult = [index, ...currentResult];
        index = index - 1;
        repeat = true;
      }
    }
    
    return decomposeWithIndex(n * n, n - 1);
  }
}