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

  • samuel47
     + 0 comments

    Solution in Java:

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