LeetCode 1967: Number of Strings That Appear as Substrings in Word Solution

Master LeetCode problem 1967 (Number of Strings That Appear as Substrings in Word), a easy challenge, with our optimized solutions in Java, C++, and Python. Explore detailed explanations, test your code in our interactive editor, and prepare for coding interviews.

1967. Number of Strings That Appear as Substrings in Word

Easy

Array String

Problem Explanation

Explanation:

To solve this problem, we iterate over each pattern and check if it is a substring of the given word. We can use the contains() method of the String class in Java and Python to check for substrings. For C++, we can use the find() method of std::string.

Algorithm:

Initialize a count variable to store the number of patterns that appear as substrings in the word.
Iterate over each pattern in the patterns array.
For each pattern, check if it is a substring of the word using the appropriate method based on the language.
If the pattern is a substring, increment the count.
Return the count as the final result.

Time Complexity:

The time complexity of this approach is O(N*M), where N is the number of patterns and M is the length of the word.

Space Complexity:

The space complexity is O(1) as we are using a constant amount of extra space.

Solution Code

class Solution {
    public int numOfStrings(String[] patterns, String word) {
        int count = 0;
        for (String pattern : patterns) {
            if (word.contains(pattern)) {
                count++;
            }
        }
        return count;
    }
}

Try It Yourself

Loading code editor...

Frequently Asked Questions

How to solve LeetCode 1967 (Number of Strings That Appear as Substrings in Word)?

This page provides optimized solutions for LeetCode problem 1967 (Number of Strings That Appear as Substrings in Word) in Java, C++, and Python, along with a detailed explanation and an interactive code editor to test your code.

What is the time complexity of LeetCode 1967 (Number of Strings That Appear as Substrings in Word)?

The time complexity for LeetCode 1967 (Number of Strings That Appear as Substrings in Word) varies by solution. Check the detailed explanation section for specific complexities in Java, C++, and Python implementations.

Can I run code for LeetCode 1967 on DevExCode?

Yes, DevExCode provides an interactive code editor where you can write, test, and run your code for LeetCode 1967 in Java, C++, or Python.

Back to LeetCode Solutions