Sunday, June 11, 2017

Hackerrank Solution

Problem Link: The Hurdle Race

Solution Link: Here

This is a very easy problem. You just need to find the maximum height and subtract from it 'k'. This result shows the minimum beverages you need. But if the maximum is less than k congratulations!!! you don't need any beverages.

1 comment:

CodeForces: Xenia and Ringroad(339B) Solution in Java for Beginners

  Xenia and Ringroad(339B) Problem Link: Since this is a beginner's problem, I suggest you try it out yourself first. Java programm...