Top K Frequent Elements with Value Tie-Breaking

pinduoduo

Problem: Top K Frequent Elements

Given an integer array nums and an integer k, return the k distinct elements that occur most frequently.

Sort the returned elements using these rules:

...

Example

Unlock to view complete problem details

and practice with sample input/output

Was this article helpful?

View Test Cases & Run Code requires membership

Standard Input
Execution Result: