Code RoomMost frequent value
EasyPrep Room Coding #1509

Most frequent value

CodingAlgorithms & data structuresEntry–Mid~12 min

Given a non-empty list of integers nums, return the value that appears most often. If two or more values tie for the highest frequency, return the smallest such value. The list has at least one element.

Implement
most_frequent(nums: list[int]) → int
Examples
in[[1,3,1,3,2]]out1
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
[[1,3,1,3,2]]1not run yetsample