Ｎθ Input `n` as a number ζ Input `A` ⬤ All characters must match θ Input `n` κ Current index ⊕ Incremented ⌊⟦ ⟧ Minimum Ｅ Map over implicit range ζ Input `A` ✂ ¹ Sliced from κ Outer index ⁻ Minus λ Inner value ⁻κλ To outer index minus inner value ⁺ Plus θ Input `n` ⊙ Any string satisfies λ Current string Ｌ Length ⁼ Equals θ Input `n` ∧ Logical And λ Current string № Contained in η Input `B` Implicitly print 

Ｎθ Input `n` as a number ζ Input `A` ⬤ All characters must match ⁰ Literal zero κ Current index ⁻ Minus θ Input `n` ⊖ Decremented ⌈⟦ ⟧ Maximum κ Current index ζ Input `A` Ｌ Length ⁻ Minus θ Input `n` ⌊⟦ ⟧ Minimum …· Inclusive range ⊙ Any value satisfies ζ Input `A` ✂ Sliced from λ Current value to λ Current value ⁺ Plus θ Input `n` № Contained in η Input `B` Implicitly print 

Loop over the starting index of all substrings of length n in input B.

Loop over all matches of each substring in input A.

Check that each index in input A was recorded at least once.

Ｎθ Input `n` as a number ζ Input `B` ⬤ All characters must match θ Input `n` κ Current index ⊕ Incremented ⌊⟦ ⟧ Minimum Ｅ Map over implicit range ζ Input `B` ✂ ¹ Sliced from κ Outer index ⁻ Minus λ Inner value ⁻κλ To outer index minus inner value ⁺ Plus θ Input `n` ⊙ Any string satisfies λ Current string Ｌ Length ⁼ Equals θ Input `n` ∧ Logical And λ Current string № Contained in η Input `A` Implicitly print 

Ｎθ Input `n` as a number ζ Input `B` ⬤ All characters must match ⁰ Literal zero κ Current index ⁻ Minus θ Input `n` ⊖ Decremented ⌈⟦ ⟧ Maximum κ Current index ζ Input `B` Ｌ Length ⁻ Minus θ Input `n` ⌊⟦ ⟧ Minimum …· Inclusive range ⊙ Any value satisfies ζ Input `B` ✂ Sliced from λ Current value to λ Current value ⁺ Plus θ Input `n` № Contained in η Input `A` Implicitly print 

Loop over the starting index of all substrings of length n in input A.

Loop over all matches of each substring in input B.

Check that each index in input B was recorded at least once.