To the Top
File:  root - text - article - 2020 - 02 - top-k-frequent-words.txt
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 314 Views, 19197 Search Bots | 102 Words

Subscribe to Feed Burner | Browse | Archive
Hi, here's your problem today. This problem was recently asked by AirBNB:

Given a non-empty list of words, return the k most frequent words. The output should be sorted from highest to lowest frequency, and if two words have the same frequency, the word with lower alphabetical order comes first. Input will contain only lower-case letters.

Example:
Input: ["daily", "interview", "pro", "pro", "for", "daily", "pro", "problems"], k = 2
Output: ["pro", "daily"]


class Solution(object):
def topKFrequent(self, words, k):
# Fill this in.

words = ["daily", "interview", "pro", "pro", "for", "daily", "pro", "problems"]
k = 2
print(Solution().topKFrequent(words, k))
# ['pro', 'daily']
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Cateogry: Computing | 314 Views, 19197 Search Bots | 102 Words Subscribe to Feed Burner

Related Articles

  1. Number of Ways to Climb Stairs
  2. CVE-2015-8874 - cPanel EasyApache Vulnerabilities
  3. Absolute Path
  4. Daily Interview Puzzle: Minimum Size Subarray Sum
  5. PHP Unit Tests on VPS Server
  6. [Daily Problem] Witness of The Tall People
  7. Daily Interview Problem: Get all Values at a Certain Height in a Binary Tree
  8. Daily Interview Problem: Min Range Needed to Sort
  9. Algorithm Interview: Lowest Common Ancestor of 2 Nodes in Binary Tree
  10. Daily Interview Problem: Full Binary Tree

Comments (0)

    Be the first one to comment this page !


Page Edited: May 11 2024 14:36:49 | RSS Subscription
How to Cook a Perfect Steak? | <meta name="robots" content="noindex, follow" />