# 838. Push Dominoes LeetCode Solution | Easy Approach Share:

Push Dominoes 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 adjacent domino on the left. Similarly, the dominoes falling to the right push their adjacent dominoes standing on the right.

When a vertical domino has dominoes falling on it from both sides, it stays still due to the balance of the forces.

For the purposes of this question, we will consider that a falling domino expends no additional force to a falling or already fallen domino.

You are given a string `dominoes` representing the initial state where:

• `dominoes[i] = 'L'`, if the `ith` domino has been pushed to the left,
• `dominoes[i] = 'R'`, if the `ith` domino has been pushed to the right, and
• `dominoes[i] = '.'`, if the `ith` domino has not been pushed.

Return a string representing the final state.

Example 1:

```Input: dominoes = "RR.L"
Output: "RR.L"
Explanation: The first domino expends no additional force on the second domino.
```

Example 2:

```Input: dominoes = ".L.R...LR..L.."
Output: "LL.RR.LLRRLL.."
```

Constraints:

• `n == dominoes.length`
• `1 <= n <= 105`
• `dominoes[i]` is either `'L'``'R'`, or `'.'`.

Given an array of non-negative integers `nums`, you are initially positioned at the first index of the array.

Each element in the array represents your maximum jump length at that position.

Your goal is to reach the last index in the minimum number of jumps.

You can assume that you can always reach the last index.

Example 1:

```Input: nums = [2,3,1,1,4]
Output: 2
Explanation: The minimum number of jumps to reach the last index is 2. Jump 1 step from index 0 to 1, then 3 steps to the last index.
```

Example 2:

```Input: nums = [2,3,0,1,4]
Output: 2
```

Constraints:

• `1 <= nums.length <= 104`
• `0 <= nums[i] <= 1000`

Time: O(n)
Space: O(n)

### C++

`` Will be updated Soon``

### Java

``````
Will be updated Soon``````

### Python

``````  Will be updated Soon
``````

#### Watch Tutorial

Checkout more Solutions here