Add Minimum Number of Rungs

Given a strictly increasing array of rung heights and a maximum climb distance dist from starting height 0, determine the minimum number of integer-height rungs to insert so every step between consecutive positions (including from 0) is at most dist. The core task is to examine each gap and add the fewest rungs needed to split any gap larger than dist into steps ≤ dist.