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).