Merge branch 'Spectrum-CETB:main' into main

coding_freshmen/C/heySwayam/pattern_finder.c

@@ -0,0 +1,39 @@
+#include <stdio.h>
+#include <string.h>
+void search(char pat[100], char txt[100])
+{
+    int pat_len = strlen(pat);
+    int txt_len = strlen(txt);
+    int sum, n = 0;
+    for (int i = 0; i < txt_len; i++)
+    {
+        if (txt[i] == pat[0])
+        {
+            sum = 0;
+            for (int j = 0; j < (pat_len - 1); j++)
+            {
+                if (txt[i + j + 1] == pat[j + 1])
+                {
+                    sum++;
+                }
+            }
+
+            if (sum == 2)
+            {
+                n++;
+                printf("Pattern found at index %d\n",i);
+            }
+        }
+    }
+}
+int main()
+{
+    char pat[100];
+    char txt[100];
+    printf("Enter the pattern\n");
+    gets(pat);
+    printf("Enter the text\n");
+    gets(txt);
+    search(pat, txt);
+    return 0;
+}

coding_freshmen/C/heySwayam/pattern_finder.md

@@ -0,0 +1,21 @@
+# <Title of the Problem>
+Pattern Finder
+
+# Problem Explanation 🚀
+Given a text txt[0. . .n-1] and a pattern pat[0. . .m-1].
+
+Write a function search(char pat[], char txt[]) that prints all occurrences of pat[] in txt[]..
+
+# Your logic 🤯
+* Approach: Created two arrays to hold the two strings and compared the array one by one and get the index
+* Own test cases if any
+* Code Structure and Libraries used
+
+# Time Complexity and Space Complexity
+```cpp
+Example 
+
+Time Complexity -> O(n^2)
+Space Complexity -> O(1)
+
+```