Javascript Solution For LeetCode Problem: Majority Element
Solving Majority Element in Javascript. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.
Problem Description
Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times. You may assume that the array is non-empty and the majority element always exist in the array.
Examples
Example 1: Input: [3,2,3] Output: 3 Example 2: Input: [2,2,1,1,1,2,2] Output: 2
Note: You should have a better solution than O(N)
See the full details of the problem Majority Element at LeetCode
Originally posted at: @github.com/ignacio-chiazzo/Algorithms-Leetcode-Javascript
Comments
Leave a comment
You are not LoggedIn but you can comment as an anonymous user which requires manual approval. For better experience please Login.