There are n dominoes in a line, and we place each domino vertically upright. In the beginning, we simultaneously push some of the dominoes either to the left or to the right. After each second, each domino that is falling to the left pushes the adja

pushDominoes.js

/**
 * Simulates the domino effect by computing the final state of a row of dominoes.
 * 
 * @param {string} dominoes - A string representing dominoes. 'L' falls left, 'R' falls right, '.' stays upright.
 * @return {string} - The final state of the dominoes after all forces are resolved.
 */
var pushDominoes = function(dominoes) {
    const n = dominoes.length;
    const forces = new Array(n).fill(0);

    // Calculate rightward forces (R).
    let force = 0;
    for (let i = 0; i < n; i++) {
        if (dominoes[i] === 'R') {
            force = n; // Strong force pushing right.
        } else if (dominoes[i] === 'L') {
            force = 0; // Leftward force cancels rightward force.
        } else {
            force = Math.max(force - 1, 0); // Gradual force reduction.
        }
        forces[i] += force;
    }

    // Calculate leftward forces (L).
    force = 0;
    for (let i = n - 1; i >= 0; i--) {
        if (dominoes[i] === 'L') {
            force = n; // Strong force pushing left.
        } else if (dominoes[i] === 'R') {
            force = 0; // Rightward force cancels leftward force.
        } else {
            force = Math.max(force - 1, 0); // Gradual force reduction.
        }
        forces[i] -= force; // Subtracting leftward forces from rightward forces.
    }

    // Construct the final state of the dominoes.
    return forces.map(f => (f > 0 ? 'R' : f < 0 ? 'L' : '.')).join('');
};