Another may challenge done

problems/169/main.py

@@ -0,0 +1,14 @@
+class Solution:
+    def majorityElement(self, nums):
+        hm = dict()
+        for n in nums:
+            if n in hm:
+                hm[n] += 1
+            else:
+                hm[n] = 1
+            if hm[n] > len(nums) // 2:
+                return n
+
+s = Solution()
+print("Expected: 3")
+print("Got:", s.majorityElement([3, 2, 3]))

problems/169/problem.txt

@@ -0,0 +1,14 @@
+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.
+
+Example 1:
+
+Input: [3,2,3]
+Output: 3
+
+Example 2:
+
+Input: [2,2,1,1,1,2,2]
+Output: 2
+

problems/169/run.sh

@@ -0,0 +1,3 @@
+#!/bin/bash
+
+python3 main.py