K most frequent elements
Given an integer array a and an integer k, return the k most frequent elements, returned as a list sorted in ascending order by value. It is guaranteed the answer is unique (no ties at the frequency cutoff). 1 <= k <= number of distinct values.
Implement
top_k_frequent(a: list[int], k: int) → list[int]Examples
in
[[1,1,1,2,2,3],2]out[1,2]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 25 min
solution.py
InputExpectedGot
[[1,1,1,2,2,3],2][1,2]not run yetsample