diff --git a/bubblesort.cpp b/bubblesort.cpp
new file mode 100644
index 0000000..cc7eb35
--- /dev/null
+++ b/bubblesort.cpp
@@ -0,0 +1,31 @@
+//Bubble Sort code by niyalimukherjee
+#include <bits/stdc++.h>
+using namespace std;
+int main()
+{
+    int n;
+    cin>>n;
+    int arr[n];
+    for(int i=0;i<n;i++)
+    {
+        cin>>arr[i];
+    }
+    int c=1;
+    while(c<n)
+    {
+        for(int i=0;i<n-c;i++)
+        {
+            if(arr[i]>arr[i+1])
+            {
+                int temp=arr[i];
+                arr[i]=arr[i+1];
+                arr[i+1]=temp;
+            }
+        }
+        c++;
+    }
+    for(int i=0;i<n;i++)
+    {
+        cout<<arr[i];
+    }
+}
diff --git a/groovingmonkeyproblem.cpp b/groovingmonkeyproblem.cpp
new file mode 100644
index 0000000..f1e11b8
--- /dev/null
+++ b/groovingmonkeyproblem.cpp
@@ -0,0 +1,27 @@
+//C++ implementation of groovingmonkeyproblem by niyalimukherjee 
+#include"bits/stdc++.h"
+using namespace std;
+int main()
+{
+    int t,N;
+    cin>>t;
+    cin>>N;
+    int monkeys[N];
+    for(int i=0;i<N;i++)
+    {
+        cin>>monkeys[i];
+    }
+    int b[N];
+    int c=0;
+    
+    for(int i=0;i<N;i++)
+    {
+        b[(i+1)%N]=monkeys[i];
+        c++;
+        if(b[i]==monkeys[i])
+        break;
+    }
+    cout<<c<<endl;
+    
+}
+