LeetCode 2343 - Query Kth Smallest Trimmed Number
LeetCode Problem 2343 Difficulty: 🟡 Medium Topics: Array, String, Divide and Conquer, Sorting, Heap (Priority Queue), Radix Sort, Quickselect Solution Problem Understanding This problem provides a list of numbers represented as strings, all of equal length. The task is to answer multiple queries, where each query asks for the index of the k-th smallest number after trimming every number in the list to its last trimi digits. Importantly, if two...