Practice The k Strongest Values in an Array
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Problem Statement
Given an array of integers arr and an integer k. A value arr[i] is said to be stronger than a value arr[j] if |arr[i] - m| > |arr[j] - m| where m is the centre of the array. If |arr[i] - m| == |arr[j] - m|, then arr[i] is said to be stronger than arr[j] if arr[i] > arr[j]. Return a list of the strongest k values in the array. return the answer in any arbitrary order. The centre is the middle value in an ordered integer list. More formally, if the length of the list is n, the centre is the element in position ((n - 1) / 2) in the sorted list (0-indexed).
Source: The k Strongest Values in an Array on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
arr = [1,2,3,4,5], k = 2
[5,1]
# Example 2
arr = [1,1,3,5,5], k = 2
[5,5]
# Example 3
arr = [6,7,11,7,6,8], k = 5
[11,8,6,6,7]
Constraints
Related LeetCode Problems
Practice more problems similar to The k Strongest Values in an Array.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.