1967. Number of Strings That Appear as Substrings in Word || using python3 ||Leetcodeseries solution

#omnyevolutions #leetcodeseries
In this video we will see the solution of leecode problem number 1967. Number of strings that appear as substring in word using python3.
Given an array of strings patterns and a string word, return the number of strings in patterns that exist as a substring in word.
A substring is a contiguous sequence of characters within a string.
see the exaples and try to understand the question statement the solution is beginners friendly..

If you want more practice feel free to visit following playlists

Thanks for Watching:)