Solve problem '169) majority element'

Author: ozantopal

problems/169-majority-element/README.md

@@ -0,0 +1,25 @@
+Given an array `nums` of size `n`, return _the majority element_.
+
+The majority element is the element that appears more than `⌊n / 2⌋` times. You may assume that the majority element always exists in the array.
+
+**Example 1:**
+
+```
+Input: nums = [3,2,3]
+Output: 3
+```
+
+**Example 2:**
+
+```
+Input: nums = [2,2,1,1,1,2,2]
+Output: 2
+```
+
+**Constraints:**
+
+- `n == nums.length`
+- `1 <= n <= 5 * 104`
+- `-2^31 <= nums[i] <= 2^31 - 1`
+
+**Follow-up:** Could you solve the problem in linear time and in `O(1)` space?

problems/169-majority-element/main.go

@@ -0,0 +1,19 @@
+package main
+
+import "fmt"
+
+func main() {
+	fmt.Println(majorityElement([]int{3, 2, 3}))
+	fmt.Println(majorityElement([]int{2, 2, 1, 1, 1, 2, 2}))
+}
+
+func majorityElement(nums []int) int {
+	m := make(map[int]int)
+	for _, v := range nums {
+		m[v]++
+		if m[v] > len(nums)/2 {
+			return v
+		}
+	}
+	return 0
+}