Search
⌘K
Get Premium
Leetcode 3006. Find Beautiful Indices in the Given Array I
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).
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.