Solution in KOTLIN with a single pass, O(n), through the array:
O(n)
fun majorityElement(elements: Array<Int>): Int? { val freq = mutableMapOf<Int, Int>() val majorityCount = elements.count() / 2 var majorityElement: Int? = null elements.forEach { element -> val count = freq.getOrDefault(element, 0) + 1 if(count > majorityCount) { majorityElement = element return@forEach } freq[element] = count } return majorityElement }
Are you sure you want to hide this comment? It will become hidden in your post, but will still be visible via the comment's permalink.
Hide child comments as well
Confirm
For further actions, you may consider blocking this person and/or reporting abuse
We're a place where coders share, stay up-to-date and grow their careers.
Solution in KOTLIN with a single pass,
O(n)
, through the array: