(Java)

Problem 1: Given an array A[0 ... n-1], where each element of the array represents a vote in the election. Assume that each vote is given as integers representing the ID of the chosen candidate. Write the code determining who wins the election.

Problem 2: How do we find the number which appeared maximum number of times in an array?

I could be wrong but is this not the same question?