Added The Hurdle Race challenge + reformat

.gitignore

@@ -0,0 +1,2 @@
+.idea/
+

Practice/Algorithms/Implementation/ClimbingTheLeaderboard/Solution.java

@@ -33,12 +33,12 @@ public static void main(String[] args) {
         Scanner in = new Scanner(System.in);
         int n = in.nextInt();
         int[] scores = new int[n];
-        for(int scores_i = 0; scores_i < n; scores_i++){
+        for (int scores_i = 0; scores_i < n; scores_i++) {
             scores[scores_i] = in.nextInt();
         }
         int m = in.nextInt();
         int[] alice = new int[m];
-        for(int alice_i = 0; alice_i < m; alice_i++){
+        for (int alice_i = 0; alice_i < m; alice_i++) {
             alice[alice_i] = in.nextInt();
         }
         int[] result = climbingLeaderboard(scores, alice);

Practice/Algorithms/Implementation/TheHurdleRace/Solution.java

@@ -0,0 +1,32 @@
+package Practice.Algorithms.Implementation.TheHurdleRace;
+
+import java.util.Scanner;
+
+public class Solution {
+
+    private static int hurdleRace(int k, int[] height) {
+        int r = 0;
+        for (int h : height) {
+            if (k <= h) {
+                int diff = h - k;
+                k += diff;
+                r += diff;
+            }
+        }
+        return r;
+    }
+
+    public static void main(String[] args) {
+        Scanner in = new Scanner(System.in);
+        int n = in.nextInt();
+        int k = in.nextInt();
+        int[] height = new int[n];
+        for (int height_i = 0; height_i < n; height_i++) {
+            height[height_i] = in.nextInt();
+        }
+        int result = hurdleRace(k, height);
+        System.out.println(result);
+        in.close();
+    }
+
+}

Practice/DataStructures/Arrays/ArraysDS/Solution.java

@@ -1,6 +1,6 @@
 package Practice.DataStructures.Arrays.ArraysDS;
 
-import java.util.*;
+import java.util.Scanner;
 
 public class Solution {
 

Practice/DataStructures/Trees/TreeHeightOfABinaryTree/Solution.java

@@ -1,6 +1,6 @@
 package Practice.DataStructures.Trees.TreeHeightOfABinaryTree;
 
-import java.util.*;
+import java.util.Scanner;
 
 public class Solution {
 

readme.md

@@ -45,6 +45,7 @@ Challenge| Problem Statement | Solution | Testcases
 [Migratory Birds](https://www.hackerrank.com/challenges/migratory-birds) | [PDF](/Practice/Algorithms/Implementation/MigratoryBirds/ProblemStatement.pdf) | [Java](/Practice/Algorithms/Implementation/MigratoryBirds/Solution.java) | [zip](/Practice/Algorithms/Implementation/MigratoryBirds/testcases.zip)
 [Picking Numbers](https://www.hackerrank.com/challenges/picking-numbers) | [PDF](/Practice/Algorithms/Implementation/PickingNumbers/ProblemStatement.pdf) | [Java](/Practice/Algorithms/Implementation/PickingNumbers/Solution.java) | [zip](/Practice/Algorithms/Implementation/PickingNumbers/testcases.zip)
 [Sock Merchant](https://www.hackerrank.com/challenges/sock-merchant) | [PDF](/Practice/Algorithms/Implementation/SockMerchant/ProblemStatement.pdf) | [Java](/Practice/Algorithms/Implementation/SockMerchant/Solution.java) | [zip](/Practice/Algorithms/Implementation/SockMerchant/testcases.zip)
+[The Hurdle Race](https://www.hackerrank.com/challenges/the-hurdle-race) | [PDF](/Practice/Algorithms/Implementation/TheHurdleRace/ProblemStatement.pdf) | [Java](/Practice/Algorithms/Implementation/TheHurdleRace/Solution.java) | [zip](/Practice/Algorithms/Implementation/TheHurdleRace/testcases.zip)
 
 #### Warmup
 Challenge| Problem Statement | Solution | Testcases