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.


Interview Questions at Enosis(Part 3)

In Part 2 , I have discussed 3 coding problems out of 6. Here we will talk about the next 3 coding problems. Problem 4: Write a function...