Sum of k largest
Given a list of integers and an integer k, return the sum of the k largest values. Values may repeat, and each occurrence counts on its own. If k is greater than the length of the list, sum every element; if k is zero or the list is empty, return 0. Negative numbers are allowed. Example: nums = [4, 1, 7, 3], k = 2 gives 11 because the two largest values are 7 and 4.
Implement
sum_of_k_largest(nums: list[int], k: int) → intExamples
in
[[4,1,7,3],2]out11What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 10 min
solution.py
InputExpectedGot
[[4,1,7,3],2]11not run yetsample