Available question text
Find all start indices i where substring a occurs in s and there exists a start j where substring b occurs such that |i - j| ≤ k — i.e., combine substring-occurrence detection with a proximity check between the occurrence lists (s length up to 1e5).
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 3006. Find Beautiful Indices in the Given Array I
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source