{"id":"kth-distinct-linear-time","text":"`kth_distinct` is O(n) time and O(n) space: one pass to build the Counter, one pass to scan for the kth unique element.","truth_value":"IN","source":"entries/2026/06/06/kth-distinct-string-in-an-array-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":[],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"kth-distinct-linear-time","truth_value":"IN","reason":"premise"}]}}