Recca Chao 的 gitHub page

推廣網站開發,包含 Laravel 和 Kotlin 後端撰寫、自動化測試、讀書心得等。Taiwan Kotlin User Group 管理員。

View on GitHub

Hi, here’s your problem today. This problem was recently asked by AirBNB:

Implement auto-completion. Given a large set of words (for instance 1,000,000 words) and then a single word prefix, find all words that it can complete to.

class Solution:
  def build(self):
    # Fill this in.
  def autocomplete(self, word):
    # Fill this in.

s = Solution()['dog', 'dark', 'cat', 'door', 'dodge'])
# ['dog', 'door', 'dodge']

Can you solve this optimally (in linear time with regards to the result set)?