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

|

1444 Discussions

|

  • sachinmore108
     + 0 comments

    int biggestHurdle = height.Max();

    return biggestHurdle > k ? biggestHurdle - k : 0;

  • davidsawyer
     + 0 comments
    scala
    def hurdleRace(k: Int, height: Array[Int]): Int = {
  height.foldLeft(0)({case (acc, n) => max(n-k, acc)})
}

  • muhammadnabilas2
     + 0 comments

    Rust:

    (height.iter().max().unwrap() - k).max(0)

  • 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;