Skip to content

Practice Add Minimum Number of Rungs

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Medium#1936
LeetCode Problem

Add Minimum Number of Rungs

Problem Statement

You are given a strictly increasing integer array rungs that represents the height of rungs on a ladder. You are currently on the floor at height 0, and you want to reach the last rung. You are also given an integer dist. You can only climb to the next highest rung if the distance between where you are currently at (the floor or on a rung) and the next rung is at most dist. You are able to insert rungs at any positive integer height if a rung is not already there. Return the minimum number of rungs that must be added to the ladder in order for you to climb to the last rung.

Source: Add Minimum Number of Rungs on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input
rungs = [1,3,5,10], dist = 2
Output
2

# Example 2

Input
rungs = [3,6,8,10], dist = 3
Output
0

# Example 3

Input
rungs = [3,4,6,7], dist = 2
Output
1

Constraints

1 <= rungs.length <= 10^5
1 <= rungs[i] <= 10^9
1 <= dist <= 10^9
rungs is strictly increasing.

Related LeetCode Problems

Practice more problems similar to Add Minimum Number of Rungs.

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.