You are given a $0$ indexed string s, string a, string b, and an integer k.

An index i is called beautiful if:

• $0 \leq i \leq$ s.length $-$ a.length

• The substring of s starting at index i with length a.length is equal to a

• There exists at least one index j such that:

  • $0 \leq j \leq$ s.length $-$ b.length

  • The substring of s starting at index j with length b.length is equal to b

  • $|j - i| \leq k$

Return an array containing all beautiful indices sorted in ascending order.

Constraints:

• $1 \leq k \leq$ s.length $\leq 10^5$

• $1 \leq$ a.length, b.length $\leq 10$

• s, a, and b contain only lowercase English letters.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.