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.
  1. Prepare
  2. Algorithms
  3. Implementation
  4. The Hurdle Race
  5. Discussions

The Hurdle Race

Sort by

recency

|

1441 Discussions

|

  • vneditorsoffici1
     + 0 comments

    int result = Collections.max(height) - k; return result > 0 ? result : 0;

  • samuel47
     + 0 comments

    Solution in Java:

        int result = Collections.max(height) - k;
    return result > 0 ? result : 0;

  • trupti29
     + 0 comments

    def hurdleRace(k, height): max1 = max(height) if max1-k < 0: return 0 else: return max1-k

  • spriyamalar
     + 0 comments
        int max = height.stream().max(Integer::compare).get();
    return max > k ? max-k : 0;

  • yashdeora98294
     + 0 comments

    Here is problem solution in python, Java, C++, C and Javascript - https://programmingoneonone.com/hackerrank-the-hurdle-race-problem-solution.html