Hiring process8 levels
  1. 1 IQ Test
  2. 2 Additional Online Test (If Required)
  3. 3 Office Interview with Hiring Manager
  4. 4 Unpaid Test Task (Motivation Check)
  5. 5 Paid Test Task and Follow-Up Interview
  6. 6 Iterative Paid Test Tasks
  7. 7 Office Verification
  8. 8 Final Interview with the Founder

Problems > K-th Smallest in a Slice > Editorial

K-th Smallest in a Slice — Solution & Editorial

Back to the Problem

The intended structure is a persistent segment tree over value space (a wavelet tree or offline merge-sort-tree walk also works): version r minus version l−1 lets you descend to the k-th element in O(log V). At the provided test sizes, sorting each queried slice is acceptable.

Complexity: O((N + Q) log V) intended