Naga Vara Pradeep Yendluri

			int majorityElement(int nums[]){
			// Using Boyer-Moore Majority Algorithm
				int count = 0, candidate = 0;
				for(int num: nums){
					if(count == 0){
						candidate = num;
						count++;
					}
					else if(candidate == num){
						count++;
					}
					else{
						count--;
					}
				}
				return candidate;
			}