https://dmytros.blog/tags/majority-element/ Recent content in Majority Element on Dmytro's Blog https://dmytros.blog/images/papermod-cover.png https://dmytros.blog/images/papermod-cover.png Hugo en Fri, 24 Jul 2026 09:38:49 +0300 https://dmytros.blog/posts/leetcode-majority-element/ Fri, 24 Jul 2026 09:38:49 +0300 https://dmytros.blog/posts/leetcode-majority-element/ <h3 id="the-problem">The problem</h3> <p>Given an array <code>nums</code> of size <code>n</code>, return <em>the majority element</em>.</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><strong>Example 1:</strong></p> <pre tabindex="0"><code>Input: nums = [3,2,3] Output: 3 </code></pre><p><strong>Example 2:</strong></p> <pre tabindex="0"><code>Input: nums = [2,2,1,1,1,2,2] Output: 2 </code></pre><p><strong>Constraints:</strong></p> <ul> <li> <p><code>n == nums.length</code></p> </li> <li> <p><code>1 &lt;= n &lt;= 5 * 10^4</code></p> </li> <li> <p><code>-10^9 &lt;= nums[i] &lt;= 10^9</code></p> </li> <li> <p>The input is generated such that a majority element will exist in the array.</p>