Hackerrank Solution: Counting Valleys
Gary is an avid hiker. He tracks his hikes meticulously, paying close attention to small details like topography. During his last hike he took exactly \(n\) steps. For every step he took, he noted if it was an uphill, \(U\), or a downhill, \(D\) step. Gary's hikes start and end at sea level and each step up or down represents a unit change in altitude. We define the following terms:
- A mountain is a sequence of consecutive steps above sea level, starting with a step up from sea level and ending with a step down to sea level.
- A valley is a sequence of consecutive steps below sea level, starting with a step down from sea level and ending with a step up to sea level.
Given Gary's sequence of up and down steps during his last hike, find and print the number of valleys he walked through.
For example, if Gary's path is \(s=[DDUUUUDD]\), he first enters a valley \(2\) units deep. Then he climbs out an up onto a mountain \(2\) units high. Finally, he returns to sea level and ends his hike.
Complete the countingValleys function in the editor below. It must return an integer that denotes the number of valleys Gary traversed.
countingValleys has the following parameters:
- \(n\): the number of steps Gary takes
- \(s\): a string describing his path
The first line contains an integer \(n\), the number of steps in Gary's hike. The second line contains a single string \(s\), of \(n\) characters that describe his path.
The trick for this problem is that we check if the previous step was still above sea-level and passes sea level with the current step. After that the implementation is just
def countingValleys(n, s): h = 0 c = 0 for p in s: a = (p == 'U') - (p == 'D') if a + h < 0 and h >= 0: c+= 1 h+= a return c
« Back to problem overview