From d1a6ba5be6b2948e9314eb042f1b692d16e62719 Mon Sep 17 00:00:00 2001
From: Vanshita Shah <vanshi1405shah@gmail.com>
Date: Tue, 16 Aug 2022 23:55:54 +0530
Subject: [PATCH] find all elements that appear more than  n/3  times.

---
 majorityElement2.cpp | 45 ++++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 45 insertions(+)
 create mode 100644 majorityElement2.cpp

diff --git a/majorityElement2.cpp b/majorityElement2.cpp
new file mode 100644
index 0000000..0db732b
--- /dev/null
+++ b/majorityElement2.cpp
@@ -0,0 +1,45 @@
+#include<iostream>
+#include<stdio.h>
+using namespace std;
+#include<unordered_map>
+#include<vector>
+class Solution {
+public:
+    vector<int> majorityElement(vector<int>& nums) {
+    
+        // int maxfre=0;
+        // int maxnum=0;
+        vector<int> n1;
+        unordered_map<int,int> m;
+        for(int i=0;i<nums.size();i++)
+        {
+            m[nums[i]]++;
+            // maxfre=max(maxfre,m[nums[i]]);
+        }
+        for(auto i :m)
+        {
+            if(i.second>nums.size()/3)
+            {
+                n1.push_back(i.first);
+            }
+        }
+        return n1;
+    }
+};
+int main()
+{
+   vector<int>num;
+   num.push_back(1);
+   num.push_back(2);
+//    num.push_back(3);
+//    num.push_back(3);
+//    num.push_back(3);
+   Solution s;
+    vector<int> a=s.majorityElement(num);
+    for(int i=0;i<a.size();i++)
+    {
+        cout<<a[i]<<endl;
+    }
+    
+    return 0;
+}