We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
minus = 0
count = 0
for i in range (0,steps):
if (minus == 0) and (path[i] == "D"):
count += 1
minus -= 1
elif path[i] =="U":
minus += 1
elif path[i] == "D":
minus -= 1
return count
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Counting Valleys
You are viewing a single comment's thread. Return to all comments →
minus = 0 count = 0 for i in range (0,steps): if (minus == 0) and (path[i] == "D"): count += 1 minus -= 1 elif path[i] =="U": minus += 1 elif path[i] == "D": minus -= 1