dsa-competitive-programming/leetcode/lc28/spaceOptimized.cpp

class Solution{
    public : 
        int strStr(string haystack, string needle){
            if(needle.empty()) return 0;
            int n = haystack.length(), m = needle.length();
            for(int i =0;i<=n-m; i++){

            }

        }
}