feat: add solution for kth largest element in an array in rust

Author: bujosa

src/medium/kth_largest_element_in_an_array.rs

@@ -0,0 +1,29 @@
+#![allow(dead_code)]
+use std::collections::BinaryHeap;
+
+pub fn find_kth_largest(nums: Vec<i32>, k: i32) -> i32 {
+    let mut max_heap = BinaryHeap::from(nums);
+    for _ in 0..k - 1 {
+        max_heap.pop();
+    }
+    *max_heap.peek().unwrap_or(&0)
+}
+
+#[cfg(test)]
+mod tests {
+    use super::*;
+
+    #[test]
+    fn test_1() {
+        let nums = vec![3, 2, 1, 5, 6, 4];
+        let k = 2;
+        assert_eq!(find_kth_largest(nums, k), 5);
+    }
+
+    #[test]
+    fn test_2() {
+        let nums = vec![3, 2, 3, 1, 2, 4, 5, 5, 6];
+        let k = 4;
+        assert_eq!(find_kth_largest(nums, k), 4);
+    }
+}