From 3b15178d547e8d9044aa720d4d82f3261564e7ba Mon Sep 17 00:00:00 2001
From: Mansi Mishra <34184275+mansim3006@users.noreply.github.com>
Date: Wed, 28 Oct 2020 23:56:27 +0530
Subject: [PATCH 1/2] Create MajorElement.java

Major Element in an array
---
 .../tutorials/leetcode/MajorElement.java      | 55 +++++++++++++++++++
 1 file changed, 55 insertions(+)
 create mode 100644 LeetCode/Java/src/main/java/org/redquark/tutorials/leetcode/MajorElement.java

diff --git a/LeetCode/Java/src/main/java/org/redquark/tutorials/leetcode/MajorElement.java b/LeetCode/Java/src/main/java/org/redquark/tutorials/leetcode/MajorElement.java
new file mode 100644
index 0000000..35cf122
--- /dev/null
+++ b/LeetCode/Java/src/main/java/org/redquark/tutorials/leetcode/MajorElement.java
@@ -0,0 +1,55 @@
+/******************************************************************************
+A leetcode Problem
+Major Element-> element having more than n/2 occurrene in an array
+
+This problem is mostly asked in Big Tech Companies like Google, Amazon
+*******************************************************************************/
+import java.util.Scanner;
+
+public class Main
+{
+	public static void main(String[] args) {
+		Scanner sc=new Scanner(System.in);
+		int n=sc.nextInt();
+		int[] arr=new int[n];
+		for(int i=0; i<n; i++) {
+		    arr[i]=sc.nextInt();
+		}
+		int maxElement=arr[0];   //initially let major element
+		int counter=1;
+		
+		//check for possible major element
+		for(int i=1; i<n; i++) {
+            if(arr[i]==maxElement) {
+                counter++;
+            } else if(counter>0) {
+                counter--;
+            } else {
+                counter=1;
+                maxElement=arr[i];
+            } 
+		}
+		int maxOccur=0;
+		if(counter>0) {
+		    for(int element:arr) {
+		        if(element==maxElement) 
+		            maxOccur++;
+		    }
+		}
+		if(maxOccur>n/2) {
+		    System.out.println("Major Element is: "+maxElement);
+		}else {
+		    System.out.println(" No Major Element is");
+		}
+	}
+}
+
+//Input-1: 6
+//         2 2 2 4 5 2 
+//Output-1: Major Element is: 2
+
+//Input-2: 9
+//         4 4 4 4 5 2 4 4 5 
+//Output-2: Major Element is: 4
+
+//Time Complexity: O(n)

From efa378584b1fbdedf52e970b12bf00b5fb3660d7 Mon Sep 17 00:00:00 2001
From: Mansi Mishra <34184275+mansim3006@users.noreply.github.com>
Date: Thu, 29 Oct 2020 00:15:28 +0530
Subject: [PATCH 2/2] Update MajorElement.java

---
 .../main/java/org/redquark/tutorials/leetcode/MajorElement.java | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/LeetCode/Java/src/main/java/org/redquark/tutorials/leetcode/MajorElement.java b/LeetCode/Java/src/main/java/org/redquark/tutorials/leetcode/MajorElement.java
index 35cf122..d570054 100644
--- a/LeetCode/Java/src/main/java/org/redquark/tutorials/leetcode/MajorElement.java
+++ b/LeetCode/Java/src/main/java/org/redquark/tutorials/leetcode/MajorElement.java
@@ -6,7 +6,7 @@
 *******************************************************************************/
 import java.util.Scanner;
 
-public class Main
+public class MajorElement
 {
 	public static void main(String[] args) {
 		Scanner sc=new Scanner(System.in);