maj ele

Shreya111111 · Shreya111111 · commit 25d05b0113d8 · 2023-07-28T01:45:25.000+05:30
diff --git a/Array/MajorityElement/MajorElement.java b/Array/MajorityElement/MajorElement.java
@@ -0,0 +1,15 @@
+class Solution {
+    public int majorityElement(int[] nums) {
+        int res = 0, count = 0;
+        for (int ele : nums) {
+            if (count == 0)
+                res = ele;
+            if (res == ele)
+                count++;
+            else
+                count--;
+        }
+        return res;
+
+    }
+}
diff --git a/Array/MajorityElement/MajorityElement.md b/Array/MajorityElement/MajorityElement.md
@@ -0,0 +1,22 @@
+Given an array nums of size n, return the majority element.
+
+The majority element is the element that appears more than ⌊n / 2⌋ times. You may assume that the majority element always exists in the array.
+
+ 
+```
+
+Example 1:
+
+Input: nums = [3,2,3]
+Output: 3
+Example 2:
+
+Input: nums = [2,2,1,1,1,2,2]
+Output: 2
+ 
+
+Constraints:
+
+n == nums.length
+1 <= n <= 5 * 104
+-109 <= nums[i] <= 109
