Leetcode 3407. Substring Matching Pattern

Given string s and pattern p containing exactly one '*' that can match any (possibly empty) sequence, determine whether p can be turned into a substring of s by replacing '*' appropriately. Effectively, check if s contains a contiguous segment whose prefix and suffix match the parts of p before and after the '*' (with any middle content allowed).