From a96b65cbfad7f62f3db6b2eab105e4e25c0414c5 Mon Sep 17 00:00:00 2001 From: Jack Sangdahl Date: Fri, 27 Jun 2025 12:23:02 -0600 Subject: chore: remove old cpp and rust solutions --- other/kth_largest_element.cpp | 25 ------------------------- 1 file changed, 25 deletions(-) delete mode 100644 other/kth_largest_element.cpp (limited to 'other/kth_largest_element.cpp') diff --git a/other/kth_largest_element.cpp b/other/kth_largest_element.cpp deleted file mode 100644 index c9a60c2..0000000 --- a/other/kth_largest_element.cpp +++ /dev/null @@ -1,25 +0,0 @@ -// 215. Kth Largest Element in an Array -#include "leetcode.h" - -/* - * given an integer array 'nums' and an integer 'k', return the k'th largest - * element in the array. note that it is the k'th largest elemented in sorted - * order, not the k'th distinct element. can you solve without sorting? - */ - -class Solution { -public: - int findKthLargest(vector &nums, int k) { - priority_queue pq(nums.begin(), nums.end()); - for (int i = 1; i < k; i++) - pq.pop(); - return pq.top(); - } -}; - -int main() { - Solution obj; - vector nums = {3, 2, 1, 5, 6, 4}; - int k = 2; - cout << obj.findKthLargest(nums, k); -} -- cgit v1.2.3