diff --git a/Arrays/cpp/CheckIfSorted.cpp b/Arrays/cpp/CheckIfSorted.cpp
new file mode 100644
index 0000000..3098345
--- /dev/null
+++ b/Arrays/cpp/CheckIfSorted.cpp
@@ -0,0 +1,23 @@
+#include <iostream>
+#include <cmath>
+using namespace std;
+
+bool isSorted(int arr[], int n)
+{
+	for(int i = 1; i < n; i++)
+	{
+	    if(arr[i] < arr[i - 1])
+	        return false;
+	}
+
+	return true;
+} 
+
+    
+int main() {
+	
+      int arr[] = {5, 12, 30, 2, 35}, n = 5;
+      
+      printf("%s", isSorted(arr, n)? "true": "false");
+    
+}
diff --git a/Arrays/cpp/LeadersInAnArray.cpp b/Arrays/cpp/LeadersInAnArray.cpp
new file mode 100644
index 0000000..1026ebb
--- /dev/null
+++ b/Arrays/cpp/LeadersInAnArray.cpp
@@ -0,0 +1,31 @@
+#include <iostream>
+#include <cmath>
+using namespace std;
+
+
+void leaders(int arr[], int n)
+{
+	int curr_ldr = arr[n - 1];
+
+	cout<<curr_ldr<<" ";
+
+	for(int i = n - 2; i >= 0; i--)
+	{
+		if(curr_ldr < arr[i])
+		{
+			curr_ldr = arr[i];
+
+			cout<<curr_ldr<<" ";
+		}
+	}
+}
+
+
+
+int main() {
+	
+      int arr[] = {7, 10, 4, 10, 6, 5, 2}, n = 7;
+
+      leaders(arr, n);
+    
+}
diff --git a/Arrays/cpp/LeftRotateByOne.cpp b/Arrays/cpp/LeftRotateByOne.cpp
new file mode 100644
index 0000000..197fc8c
--- /dev/null
+++ b/Arrays/cpp/LeftRotateByOne.cpp
@@ -0,0 +1,39 @@
+#include <iostream>
+#include <cmath>
+using namespace std;
+
+ void lRotateOne(int arr[], int n)
+{
+	int temp = arr[0];
+
+	for(int i = 1; i < n; i++)
+	{
+		arr[i - 1] = arr[i];
+	}
+
+	arr[n - 1] = temp;
+}
+    
+int main() {
+	
+      int arr[] = {1, 2, 3, 4, 5}, n = 5;
+
+      cout<<"Before Rotation"<<endl;
+
+       for(int i = 0; i < n; i++)
+       {
+       		cout<<arr[i]<<" ";
+       }
+
+       cout<<endl;
+
+       lRotateOne(arr, n);
+
+       cout<<"After Rotation"<<endl;
+
+       for(int i = 0; i < n; i++)
+       {
+       		cout<<arr[i]<<" ";
+       }
+    
+}
diff --git a/Arrays/cpp/MajorityElement.cpp b/Arrays/cpp/MajorityElement.cpp
new file mode 100644
index 0000000..8263315
--- /dev/null
+++ b/Arrays/cpp/MajorityElement.cpp
@@ -0,0 +1,43 @@
+#include <iostream>
+#include <cmath>
+using namespace std;
+
+
+int findMajority(int arr[], int n)
+{
+	int res = 0, count = 1;
+
+    	for(int i = 1; i < n; i++)
+    	{
+    		if(arr[res] == arr[i])
+    			count++;
+    		else 
+    			count --;
+
+    		if(count == 0)
+    		{
+    			res = i; count = 1;
+    		}
+    	}
+
+    	count = 0;
+
+    	for(int i = 0; i < n; i++)
+    		if(arr[res] == arr[i])
+    			count++;
+
+    	if(count <= n /2)
+    		res = -1;
+
+    	return res; 
+}
+
+
+
+int main() {
+	
+     int arr[] = {8, 8, 6, 6, 6, 4, 6}, n = 7;
+
+     cout<<findMajority(arr, n);
+    
+}