D. J.:

- Added leetcode problem and solution for 169 Majority Element

Author: nobodyPerfecZ

README.md

@@ -3,15 +3,17 @@
 This repository contains awesome LeetCode problems and solutions written in Python to prepare for coding interviews.
 
 ## Leetcode Problems & Solutions 💻
+
 - [26 Remove Duplicates from Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array/description/)
 - [27 Remove Element](https://leetcode.com/problems/remove-element/description/)
 - [80 Remove Duplicates from Sorted Array II](https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii/description/)
 - [88 Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array/description/)
-
+- [169 Majority Element](https://leetcode.com/problems/majority-element/description/)
 
 ## Development 🔧
+
 Contributions are welcome!
 
 Please fork the repository and submit a pull request.
 
-Make sure to follow the coding standards and write tests for any new leetcode problem or bug fix.
+Make sure to follow the coding standards and write tests for any new leetcode problem or bug fix.

awesome_python_leetcode/_169_majority_element.py

@@ -0,0 +1,18 @@
+from typing import List
+
+
+class Solution:
+    def majorityElement(self, nums: List[int]) -> int:
+        """
+        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.
+        """
+        counts = {}
+        for num in nums:
+            if num not in counts:
+                counts[num] = 1
+            else:
+                counts[num] += 1
+        return max(counts, key=lambda k: counts[k])

tests/test_169_majority_element.py

@@ -0,0 +1,17 @@
+from typing import List
+
+import pytest
+
+from awesome_python_leetcode._169_majority_element import Solution
+
+
+@pytest.mark.parametrize(
+    argnames=["nums", "expected"],
+    argvalues=[
+        ([3, 2, 3], 3),
+        ([2, 2, 1, 1, 1, 2, 2], 2),
+    ],
+)
+def test_func(nums: List[int], expected: int):
+    majority_element = Solution().majorityElement(nums)
+    assert majority_element == expected