Query Kth Smallest Trimmed Number at DE Shaw

Problem Description

You are given a **0-indexed** array of strings `nums`, where each string is of **equal length** and consists of only digits. You are also given a **0-indexed** 2D integer array `queries` where `queries[i] = [ki, trimi]`. For each `queries[i]`, you need to: * **Trim** each number in `nums` to its...

Topics