CodingEasycod-g946

Subject ArraysLevel Entry–Mid~12 minCommon in Algorithms & data structures interviewsIndustries Software development

Question

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.

Learn the concepts

Vibe coding: describe the solution in plain language (or narrate it) and the coach grades your approach. Generating runnable code from your description is coming next.

Run or narrate your approach, then ask the coach.