{"id":"rank-map-is-o-n-log-n","text":"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","truth_value":"IN","source":"entries/2026/06/06/rank-transform-of-an-array-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":[],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"rank-map-is-o-n-log-n","truth_value":"IN","reason":"premise"}]}}