KMP algorithm-LPS array

Beginner Level 📁/KMP algorithm/Solution.java

@@ -0,0 +1,35 @@
+class Solution{
+    public static void main(String args[]){
+        KMP obj = new KMP();
+        int a = obj.lps("ABCDABCDAACBDABCD");
+        System.out.println("The longest prefix suffix is : "+a);
+    }
+}
+
+class KMP{
+   int lps(String str){
+    int n = str.length();
+    int pre = 0;
+    int suf = 1;
+    char s[] = str.toCharArray();
+    int arr[] = new int[n];
+
+    while(suf<n){
+        if(s[pre]==s[suf]){
+            arr[suf] = pre+1;
+            pre++;
+            suf++;
+        }
+        else{
+            if(pre == 0){
+                arr[suf] = 0;
+                suf++;
+            }
+            else{
+                pre = arr[pre-1];
+            }
+        }
+    }
+    return arr[n-1];
+   }
+}

Beginner Level 📁/KMP algorithm/question.md

@@ -0,0 +1,3 @@
+//Question
+To find the longest prefix which is also the longest suffix for a given string as:
+"ABCDABCDAACBDABCD" using KMP algorithm.

Beginner Level 📁/data.json

@@ -7,6 +7,11 @@
   },
 
   // Add your details below as above mention
+
+  {
+    "name": "Samriddhi gupta",
+    "githubUsername": "sg6724"
+  },
 
   {
     "name": "Sharan Swaroop",