Available question text
Given an integer array and k, count indices i such that the element at i is "k-big" — i.e., there are at least k elements greater than nums[i] on both its left and its right. Solving this efficiently requires prefix/suffix order-statistics (coordinate compression + Fenwick/segment tree or balanced BST) to compute those counts in O(n log n).
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 2519. Count the Number of K-Big Indices
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source