169

leetcode/169. Majority Element/README.md

@@ -1,26 +1,38 @@
 # [169. Majority Element (Easy)](https://leetcode.com/problems/majority-element/)
 
-<p>Given an array of size <i>n</i>, find the majority element. The majority element is the element that appears <b>more than</b> <code>⌊ n/2 ⌋</code> times.</p>
+<p>Given an array <code>nums</code> of size <code>n</code>, return <em>the majority element</em>.</p>
 
-<p>You may assume that the array is non-empty and the majority element always exist in the array.</p>
+<p>The majority element is the element that appears more than <code>⌊n / 2⌋</code> times. You may assume that the majority element always exists in the array.</p>
 
+<p>&nbsp;</p>
 <p><strong>Example 1:</strong></p>
-
-<pre><strong>Input:</strong> [3,2,3]
-<strong>Output:</strong> 3</pre>
-
-<p><strong>Example 2:</strong></p>
-
-<pre><strong>Input:</strong> [2,2,1,1,1,2,2]
+<pre><strong>Input:</strong> nums = [3,2,3]
+<strong>Output:</strong> 3
+</pre><p><strong>Example 2:</strong></p>
+<pre><strong>Input:</strong> nums = [2,2,1,1,1,2,2]
 <strong>Output:</strong> 2
 </pre>
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
 
+<ul>
+	<li><code>n == nums.length</code></li>
+	<li><code>1 &lt;= n &lt;= 5 * 10<sup>4</sup></code></li>
+	<li><code>-2<sup>31</sup> &lt;= nums[i] &lt;= 2<sup>31</sup> - 1</code></li>
+</ul>
+
+<p>&nbsp;</p>
+<strong>Follow-up:</strong> Could you solve the problem in linear time and in <code>O(1)</code> space?
 
 **Companies**:  
-[Amazon](https://leetcode.com/company/amazon), [Google](https://leetcode.com/company/google), [Microsoft](https://leetcode.com/company/microsoft), [Facebook](https://leetcode.com/company/facebook)
+[Microsoft](https://leetcode.com/company/microsoft), [Apple](https://leetcode.com/company/apple), [Facebook](https://leetcode.com/company/facebook), [Amazon](https://leetcode.com/company/amazon), [Google](https://leetcode.com/company/google), [Adobe](https://leetcode.com/company/adobe), [Rubrik](https://leetcode.com/company/rubrik)
 
 **Related Topics**:  
-[Array](https://leetcode.com/tag/array/), [Divide and Conquer](https://leetcode.com/tag/divide-and-conquer/), [Bit Manipulation](https://leetcode.com/tag/bit-manipulation/)
+[Array](https://leetcode.com/tag/array/), [Hash Table](https://leetcode.com/tag/hash-table/), [Divide and Conquer](https://leetcode.com/tag/divide-and-conquer/), [Sorting](https://leetcode.com/tag/sorting/), [Counting](https://leetcode.com/tag/counting/)
+
+**Similar Questions**:
+* [Majority Element II (Medium)](https://leetcode.com/problems/majority-element-ii/)
+* [Check If a Number Is Majority Element in a Sorted Array (Easy)](https://leetcode.com/problems/check-if-a-number-is-majority-element-in-a-sorted-array/)
 
 ## Solution 1.