Tap here to switch tabs
Problem
Submissions

Problem: Number of Strings That Appear as Substrings in Word

Number of Strings That Appear as Substrings in Word gives an array of patterns and a string, then asks how many patterns occur as contiguous substrings of the word.

Statement

Given an array of strings patterns and a string word, return the number of strings in patterns that exist as a substring within word.

A substring is a contiguous sequence of characters within a string.

Constraints:

  • 1≤1 \leq patterns.length ≤100\leq 100

  • 1≤1 \leq patterns[i].length ≤100\leq 100

  • 1≤1 \leq word.length ≤100\leq 100

  • patterns[i] and word consist of lowercase English letters.

⋮
Tap here to switch tabs
Problem
Submissions

Problem: Number of Strings That Appear as Substrings in Word

Number of Strings That Appear as Substrings in Word gives an array of patterns and a string, then asks how many patterns occur as contiguous substrings of the word.

Statement

Given an array of strings patterns and a string word, return the number of strings in patterns that exist as a substring within word.

A substring is a contiguous sequence of characters within a string.

Constraints:

  • 1≤1 \leq patterns.length ≤100\leq 100

  • 1≤1 \leq patterns[i].length ≤100\leq 100

  • 1≤1 \leq word.length ≤100\leq 100

  • patterns[i] and word consist of lowercase English letters.