Add: Kth Largest Element in an Array

Author: openset

internal/leetcode/problems_status.go

@@ -49,6 +49,7 @@ var problemStatus = map[int]bool{
 	101:  true,
 	104:  true,
 	108:  true,
+	110:  true,
 	118:  true,
 	119:  true,
 	121:  true,
@@ -79,6 +80,7 @@ var problemStatus = map[int]bool{
 	202:  true,
 	204:  true,
 	206:  true,
+	215:  true,
 	217:  true,
 	219:  true,
 	231:  true,
@@ -89,6 +91,7 @@ var problemStatus = map[int]bool{
 	258:  true,
 	268:  true,
 	283:  true,
+	290:  true,
 	303:  true,
 	326:  true,
 	342:  true,
@@ -217,4 +220,5 @@ var problemStatus = map[int]bool{
 	1154: true,
 	1163: true,
 	1185: true,
+	1221: true,
 }

problems/kth-largest-element-in-an-array/kth_largest_element_in_an_array.go

@@ -1 +1,8 @@
-package kth_largest_element_in_an_array
+package problem_215
+
+import "sort"
+
+func findKthLargest(nums []int, k int) int {
+	sort.Ints(nums)
+	return nums[len(nums)-k]
+}

problems/kth-largest-element-in-an-array/kth_largest_element_in_an_array_test.go

@@ -1 +1,29 @@
-package kth_largest_element_in_an_array
+package problem_215
+
+import "testing"
+
+type caseType struct {
+	input    []int
+	k        int
+	expected int
+}
+
+func TestFindKthLargest(t *testing.T) {
+	tests := [...]caseType{
+		{
+			input:    []int{3, 2, 1, 5, 6, 4},
+			k:        2,
+			expected: 5,
+		}, {
+			input:    []int{3, 2, 3, 1, 2, 4, 5, 5, 6},
+			k:        4,
+			expected: 4,
+		},
+	}
+	for _, tc := range tests {
+		output := findKthLargest(tc.input, tc.k)
+		if output != tc.expected {
+			t.Fatalf("input: %v, output: %v, expected: %v", tc.input, output, tc.expected)
+		}
+	}
+}