Home Roadmap Courses Problems Dashboard Pricing

Home Roadmap Courses Problems Dashboard Pricing

Loading editor…

Problem 139

Top K Frequent Words

MediumHeap

Return the k most frequent strings in words. If frequencies tie, the lexicographically smaller word ranks higher. Return them from most frequent to least.

Examples

Example 1

Input: words = ["i","love","leetcode","i","love","coding"], k = 2

Output: ["i","love"]

Constraints

1 ≤ words.length ≤ 500

Target ComplexityNot required

O(n log n) Time · O(n) Space

Companies (4)

AmazonGoogleUberBloomberg

Node 22.08.0

Loading editor…

Test casesRun to compare output

Inputwords = ["i","love","leetcode","i","love","coding"], k = 2

Expected["i","love"]

Output—