Available question text
Find the centre (the element at index (n−1)/2 of the sorted array) and return any k elements with the largest "strength", where strength = |x − centre| and ties are broken by the larger value — i.e., pick the top-k elements by distance from the centre.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1471. The k Strongest Values in an Array
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source