Java program to find majority element in an array? 

This solution will only work if the majority element occurs more than half the size of the input array. Otherwise, your choice of using a map was great.

I think the logic is wrong, what if we have 2-3, 3-4,4-2,5-1 ?

do you have online class for kids

My code: public class MajorityElement { public static void main(String args[]){ int[] arr = {3,1,2,3,3,4}; int ans = majority(arr); System.out.println(ans); } static int majority(int[] arr){ int count =0; for(int i=0;i

Why size/2 can't we use Max count here?

public class Program { static void Main(string[] args) { int[] nums = { 2, 3, 4, 5, 2, 3, 3, 3, 3, 5, 5, 5, 5, 5, 5, 5 }; Console.WriteLine(MajorityElement(nums)); } public static int MajorityElement(int[] nums) { int count = 0; Dictionary dict = new Dictionary(); //Logic for (int i = 0; i < nums.Length; i++) { if (dict.ContainsKey(nums[i])) { dict[nums[i]]++; } else { dict.Add(nums[i], 1); } } foreach (var x in dict) { if (x.Value > count) { count = x.Key; } } return count; } }

Hi

may i know your contact number for online class for 6th class kid

hi bro Can I get your number to contact you I want learn Java coding bro