How should I practice Retain Top K Values?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Microsoft phone screen problems in FastPrep.

Is Retain Top K Values associated with Microsoft?

FastPrep tags this as a Microsoft phone screen coding practice problem when the problem catalog has that company and stage context.

Problem · Array

Retain Top K Values

Learn this problem

● Easy

MicrosoftFULLTIMEPHONE SCREEN

See Microsoft hiring insights

Problem statement

Given an integer array nums and an integer k, remove every value except the k largest elements. The relative order of the retained elements must be the same as in the original array.

If there are ties at the cutoff value, keep the earliest tied elements until exactly k elements have been retained.

Function

retainTopKValues(nums: int[], k: int) → int[]

Examples

Example 1

nums = [5,1,3,5,2]k = 3return = [5,3,5]

The three largest elements are 5, 5, and 3. They are returned in their original order.

Example 2

nums = [4,4,4,2]k = 2return = [4,4]

When equal values cross the cutoff, keep the earliest occurrences needed to return exactly k elements.

Constraints

1 <= nums.length <= 10⁴
-10⁴ <= nums[i] <= 10⁴
0 <= k <= nums.length
The return value must contain exactly k elements.
The relative order of retained elements must match their order in the original array.
When multiple elements share the cutoff value, keep the earliest-occurring tied elements until exactly k elements have been retained.