Search
⌘K

Leetcode 2343. Query Kth Smallest Trimmed Number

Given equal-length digit strings, each query (k, trim) asks you to truncate every number to its rightmost trim digits and return the index of the k-th smallest trimmed value (ties broken by smaller original index). The challenge is to perform this comparison efficiently across multiple queries, e.g., via sorting or radix-sort on digit suffixes.


Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Comments

Your account is free and you can post anonymously if you choose.