LeetCode #6: Zigzag Conversion

function convert(s, numRows) {
 // If there's only one row, the string is already in the "zigzag" format, so we can return it as is.
  if(numRows ===1 ) return s;

    // create an array of strings, where each element will represent a row in the zigzag pattern
    // the size of the array is equal to the number of rows
    const rows = new Array(numRows).fill('');
    console.log(rows)

    // variable to keep track of current row we are adding characters to
    let currentRow = 0;

    // boolean flag to determine direction
    let goingDown = false;

    for(const char of s){
      console.log(rows)
        rows[currentRow] += char;

        // check if we have reached the top or bootom row
        // if we are at top row or bottom row (numRows -1)
        // we need to reverse our direction
        if(currentRow === 0 || currentRow === numRows-1){
            goingDown = !goingDown;
        }

        // move to the next row based on the direction
        // if going down increment currentRow
        // if goind up  decrement currentRow

        currentRow += goingDown ? 1 : -1
    }

    // finally join the strings in the rows together to form the final result
    return rows.join('')

}