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 | 317 Views, 19420 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 | 317 Views, 19420 Search Bots | 102 Words Subscribe to Feed Burner

Related Articles

  1. [Daily Problem] Move Zeros
  2. How to Play WAV music under DOS?
  3. [Daily Problem] Remove Consecutive Nodes that Sum to 0
  4. CVE-2015-8874 - cPanel EasyApache Vulnerabilities
  5. Algorithm Interview: Determine If Linked List is Palindrome
  6. Daily Interview Puzzle: Minimum Size Subarray Sum
  7. Daily Interview Problem: Reconstrunct Binary Tree from Preorder and Inorder Traversals
  8. Daily Interview Problem: Tree Serialization
  9. First and Last Indices of an Element in a Sorted Array
  10. [Daily Problem] Validate Balanced Parentheses

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="index, follow">