Add solution #215

Author: JoshCrozier

README.md

@@ -93,6 +93,7 @@
 206|[Reverse Linked List](./0206-reverse-linked-list.js)|Easy|
 213|[House Robber II](./0213-house-robber-ii.js)|Medium|
 214|[Shortest Palindrome](./0214-shortest-palindrome.js)|Hard|
+215|[Kth Largest Element in an Array](./0215-kth-largest-element-in-an-array.js)|Medium|
 217|[Contains Duplicate](./0217-contains-duplicate.js)|Easy|
 219|[Contains Duplicate II](./0219-contains-duplicate-ii.js)|Easy|
 225|[Implement Stack using Queues](./0225-implement-stack-using-queues.js)|Easy|

solutions/0215-kth-largest-element-in-an-array.js

@@ -0,0 +1,18 @@
+/**
+ * 215. Kth Largest Element in an Array
+ * https://leetcode.com/problems/kth-largest-element-in-an-array/
+ * Difficulty: Medium
+ *
+ * Given an integer array nums and an integer k, return the kth largest element in the array.
+ *
+ * Note that it is the kth largest element in the sorted order, not the kth distinct element.
+ */
+
+/**
+ * @param {number[]} nums
+ * @param {number} k
+ * @return {number}
+ */
+var findKthLargest = function(nums, k) {
+  return nums.sort((a, b) => a - b)[nums.length - k];
+};