Code RoomMajority element
EasyPrep Room Coding #1519

Majority element

CodingAlgorithms & data structuresEntry–Mid~12 min

Given a non-empty list nums, return True if any single value occupies strictly more than half of the positions (a strict majority element), otherwise False. For example [3, 3, 4, 2, 3] has 3 appearing 3 of 5 times (>2.5), so return True. The list has at least one element.

Implement
has_majority(nums: list[int]) → bool
Examples
in[[3,3,4,2,3]]outtrue
What a strong answer looks like

State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.

0:00 of about 12 min
InputExpectedGot
[[3,3,4,2,3]]truenot run yetsample