• Skip to primary navigation
  • Skip to content
  • Skip to footer
zhicheng xie's demo blog
  • Quick-Start Guide

    Your Name

    I am an amazing person.

    • Somewhere

    Number of Strings That Appear as Substrings in Word

    less than 1 minute read

    <-E 1967> Number of Strings That Appear as Substrings in Word

    class Solution {
    public:
        int numOfStrings(vector<string>& patterns, string word) {
            int count = 0;
            for(int i=0; i < patterns.size(); i++) {
                if(word.find(patterns[i]) != string::npos)
                    count++;
            }
            return count;
        }
    };
    

    Tags: Algorithms, C++, Leetcode

    Updated: April 16, 2022

    Share on

    Twitter Facebook LinkedIn
    Previous Next

    You may also enjoy

    Decode Ways

    less than 1 minute read

    <-M 91> Decode Ways

    Word Break

    less than 1 minute read

    <-H 139> Word Break

    Distinct Subsequences

    less than 1 minute read

    <-H 115> Distinct Subsequences

    Edit Distance

    less than 1 minute read

    <-H 72> Edit Distance

    • Follow:
    • Feed
    © 2023 zhicheng xie's blog. Powered by Jekyll & Minimal Mistakes.