Coding: Values of Alphabet

EasyPython00:00

Practice interviewer

In session

5 left

00:00

Your question is Coding: Values of Alphabet. Start with the requirements on the right.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

You need to log in / sign up to run or submit.

Problem

Illumina sequencing workflows may score many candidate reads or genomic signals and retain only a fixed number of the highest-scoring values. Given an integer array and a positive integer k, return the largest possible sum obtained by selecting exactly k elements.

Each array position may be selected at most once, but the selected elements do not need to be contiguous. Values may be negative, and the original order is irrelevant.

Formal Specification

Implement max_sum_k(nums, k).

Input: nums, a list of n integers, and k, an integer.
Output: An integer equal to the maximum sum of any k elements from nums.
You must select exactly k elements.

Constraints

1 <= k <= len(nums)
1 <= len(nums) <= 10^5
-10^9 <= nums[i] <= 10^9
The result fits within Python's integer range

Function Signature

def max_sum_k(nums, k):

Your solutionPython 3

You need to log in / sign up to run or submit.

Run your code to see test output