diff --git a/medium/day_8/solution.cpp b/medium/day_8/solution.cpp
index 4f32122..669069f 100644
--- a/medium/day_8/solution.cpp
+++ b/medium/day_8/solution.cpp
@@ -1 +1,53 @@
-//Write your code here
\ No newline at end of file
+//Write your code here
+#include <bits/stdc++.h>
+using namespace std;
+string getsequence(string str, int idx1, int idx2) // this function returns the repeating sequence of string starting with str[i]
+{
+
+    string temp = ""; // temp shows the repeating sequence
+    while (idx2 < str.length())
+    {
+        if (str[idx1] == str[idx2])
+        {
+            temp += str[idx1];
+            idx1++;
+            idx2++;
+        }
+        else
+            break;
+    }
+    return temp;
+}
+int main()
+{
+    string str;
+    string AnsStr;
+    cin >> str; // input the string
+    if(str.length() == 1)
+    {
+        cout<<-1<<endl;
+        exit(0);
+    }
+    int i=0;
+    int MaxLength=INT_MIN;
+    while(i<str.length())//iterate over the string
+    {
+        int j=i;
+        while(j<str.length())//j represents all the indices where str[i] occurs except the first occurence
+        {
+            j=str.find(str[i],j+1);
+            if(j==-1) break; // if there is no more occurence of str[i] is left then we break the loop
+            string temp = getsequence(str,i,j);//get the sequence of string which is repeating
+            int len=temp.length();
+            if(len > MaxLength)  //if length of current repeating sequence is greater than previously stored length
+            {               // then update max length 
+                AnsStr=temp;//store max repeating sequence in AnsStr
+                MaxLength=len;
+            }
+        }
+        i++;
+    }
+    
+    cout<<AnsStr<<endl;
+    return 0;
+}
\ No newline at end of file
diff --git a/medium/day_8/solution.exe b/medium/day_8/solution.exe
new file mode 100644
index 0000000..cb17401
Binary files /dev/null and b/medium/day_8/solution.exe differ