leetcode new problems

leetcode/lc28/spaceOptimized.cpp

@@ -0,0 +1,11 @@
+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++){
+
+            }
+
+        }
+}