Code RoomMajority element
EasyPrep Room Coding #1586

Majority element

CodingAlgorithms & data structuresEntry–Mid~15 min

Return the element that appears more than n/2 times in the array (guaranteed to exist).

Implement
majority_element(nums: list[int]) → int
Examples
in[[3,2,3]]out3
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 15 min
InputExpectedGot
[[3,2,3]]3not run yetsample