169. Majority Element
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.length1 <= n <= 5 * 104-109 <= nums[i] <= 109
O(1) space?Asked at top 20 of 22 companies
Google
TCS
Infosys
IBMTopics
Loading editor…
1class Solution:
2 def majorityElement(self, nums: List[int]) -> int:
3
Starter codePython 3Spaces: 4
Loading editor…
1class Solution:
2 def majorityElement(self, nums: List[int]) -> int:
3
Starter codePython 3Spaces: 4
Examples
Input
[3,2,3]
Input
[2,2,1,1,1,2,2]
Your code is saved on this device.Solution