Status: IN
The ranking solution's time complexity is O(n log n) dominated by `sorted()`; the dict construction is O(k) and lookup per element is O(1) amortized
Source: entries/2026/06/06/rank-transform-of-an-array-solution.md
JSON