Twitter 面经

Leetcode 题

时间复杂度是关键： O(4^N)

""Given a string of phone digits and a catalog or directory containing valid names, print all the possible letter combinations that form names that exist in the directory.
A main use case is to convert phone numbers into easy-to-remember ones. For instance, “1 800 BLUBIRD" is much easier to remember than "1 800 2582473"

Keypad:

Input
String[] numberToLetters: ["0", "1", "abc", "def", &quo

您好！
本帖隐藏的内容需要积分高于 188 才可浏览
您当前积分为 0。
使用VIP即刻解锁阅读权限或查看其他获取积分的方式

游客，您好！
本帖隐藏的内容需要积分高于 188 才可浏览
您当前积分为 0。
VIP即刻解锁阅读权限 或 查看其他获取积分的方式
Unlock interview details and practice with AI
Curated Interview Questions from Top Companies

ongest length of word


String[] numberToLetters: ["0", "1", "abc", "def", "ghi", "jkl", "mno", "pqrs", "tuv", "wxyz"]

Output 2:
["bats", "cats"]

"""

请问这是leetcode 多少题啊？谢谢。