docs: mark done problem 215

Author: bujosa

src/readme.md

@@ -76,7 +76,7 @@
   - [x] [199. Binary tree right side view](../src/medium/binary_tree_right_side_view.rs) -> [Problem Description](../src/medium/readme.md#199-binary-tree-right-side-view)
   - [x] [208. Implement trie (prefix tree)](../src/medium/implement_trie_prefix_tree.rs) -> [Problem Description](../src/medium/readme.md#208-implement-trie-prefix-tree)
   - [x] [211. Design add and search words data structure](../src/medium/design_add_and_search_words_data_structure.rs) -> [Problem Description](../src/medium/readme.md#211-design-add-and-search-words-data-structure)
-  - [ ] [215. Kth largest element in an array](../src/medium/kth_largest_element_in_an_array.rs) -> [Problem Description](../src/medium/readme.md#215-kth-largest-element-in-an-array)
+  - [x] [215. Kth largest element in an array](../src/medium/kth_largest_element_in_an_array.rs) -> [Problem Description](../src/medium/readme.md#215-kth-largest-element-in-an-array)
   - [x] [230. Kth smallest element in a BST](../src/medium/kth_smallest_element_in_a_bst.rs) -> [Problem Description](../src/medium/readme.md#230-kth-smallest-element-in-a-bst)
   - [x] [235. Lowest common ancestor of a binary search tree](../src/medium/lowest_common_ancestor_of_a_binary_search_tree.rs) -> [Problem Description](../src/medium/readme.md#235-lowest-common-ancestor-of-a-binary-search-tree)
   - [x] [238. Product of array except self](../src/medium/product_of_array_except_self.rs) -> [Problem Description](../src/medium/readme.md#238-product-of-array-except-self)

theory/categories/6.heap_priority_queue/readme.md

@@ -66,12 +66,12 @@ A priority queue can be implemented using a heap.
 - [x] [Kth Largest Element in a Stream](https://leetcode.com/problems/kth-largest-element-in-a-stream/) | Easy | [Solution](../../../src/easy/kth_largest_element_in_a_stream.rs) | [Problem Description](../../../src/easy/readme.md#703-kth-largest-element-in-a-stream)
 - [x] [Last Stone Weight](https://leetcode.com/problems/last-stone-weight/) | Easy | [Solution](../../../src/easy/last_stone_weight.rs) | [Problem Description](../../../src/easy/readme.md#1046-last-stone-weight)
 - [x] [K Closest Points to Origin](https://leetcode.com/problems/k-closest-points-to-origin/) | Medium | [Solution](../../../src/medium/k_closest_points_to_origin.rs) | [Problem Description](../../../src/medium/readme.md#973-k-closest-points-to-origin)
-- [ ] [Kth Largest Element in an Array](https://leetcode.com/problems/kth-largest-element-in-an-array/) | Medium | [Solution](../../../src/medium/kth_largest_element_in_an_array.rs) | [Problem Description](../../../src/medium/readme.md#215-kth-largest-element-in-an-array)
+- [x] [Kth Largest Element in an Array](https://leetcode.com/problems/kth-largest-element-in-an-array/) | Medium | [Solution](../../../src/medium/kth_largest_element_in_an_array.rs) | [Problem Description](../../../src/medium/readme.md#215-kth-largest-element-in-an-array)
 - [ ] [Task Scheduler](https://leetcode.com/problems/task-scheduler/) | Medium | [Solution](../../../src/medium/task_scheduler.rs) | [Problem Description](../../../src/medium/readme.md#621-task-scheduler)
 - [ ] [Find Median from Data Stream](https://leetcode.com/problems/find-median-from-data-stream/) | Hard | [Solution](../../../src/hard/find_median_from_data_stream.rs) | [Problem Description](../../../src/hard/readme.md#295-find-median-from-data-stream)
 
 Category: `Heap / Priority Queue`
 Created on: 2023-11-02 21:12
-Last modified on: 2023-11-03 02:30
+Last modified on: 2023-11-03 19:02
 Status: In Progress
 Author: [David Bujosa](https://github.com/bujosa)