Create KthLargest.java

You can solve this question by sorting the array but It Will Take O(nlogn) time 
however I have done it using min heap
Time Complexity: O(nlogk)
We should optimize our code as efficient as possible

Author: akashSky369

KthLargest.java

@@ -0,0 +1,14 @@
+//Find The kth Largest In The Array
+//Using Min Heap
+
+    public int findKthLargest(int[] nums, int k) {
+PriorityQueue<Integer> queue = new PriorityQueue<>();
+for (int e :nums){
+    queue.add(e);
+    if (queue.size()>k){
+        queue.poll();
+    }
+
+}
+return queue.peek();
+    }