Status: IN
Worst-case time is O(n*k) when every element equals `key`, acceptable for the problem's n,k <= 1000 constraints.
Source: entries/2026/06/06/find-all-k-distant-indices-in-an-array-solution.md
JSON