Maximum occuring element

Beginner Level 📁/MaxOccuringElement/MaxOccuringElement.c++

@@ -0,0 +1,34 @@
+#include <iostream>
+#include <vector>
+#include <algorithm>
+
+using namespace std;
+
+class Solution{
+    public:
+    int maxOccurElement(vector<int>& nums){
+        sort(nums.begin(),nums.end());
+        int n=nums.size();
+        int freq=1, ans=nums[0];
+        for(int i=1;i<n;i++){
+            if(nums[i]==nums[i-1]){
+                freq++;
+            }else{
+                freq=1;
+                ans=nums[i];
+            }
+            if(freq>n/2){
+                ans=nums[i];
+                return ans;
+            }
+        }return ans;
+    }
+};
+
+int main(){
+    Solution obj;
+    vector <int> nums={5,4,3,3,5,5,5};
+    int result= obj.maxOccurElement(nums);
+    cout<<"The required Element is:"<< result<< endl;
+    return 0;
+}

Beginner Level 📁/MaxOccuringElement/question.md

@@ -0,0 +1,7 @@
+## Maximum occuring element in a given array
+
+The maximum occuring element is the element that appears more than [n/2] times. You may assume that the majority element always exists in the array.
+
+Example:
+Input: nums=[5,4,3,3,5,5,5]
+Output: 5