{"id":"k-distant-brute-force-complexity","text":"Worst-case time is O(n*k) when every element equals `key`, acceptable for the problem's n,k <= 1000 constraints.","truth_value":"IN","source":"entries/2026/06/06/find-all-k-distant-indices-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":"k-distant-brute-force-complexity","truth_value":"IN","reason":"premise"}]}}