LeetCode 17 - Letter Combinations of a Phone Number

preview_player
Показать описание

Рекомендации по теме
Комментарии
Автор

Great video Ryan! I'm trying to wrap my head around time complexity analysis and wondering if the time complexity can be represented as O(k*n)? K would be the length of the largest letter array which would be 9: ['w', 'x', 'y', 'z'] or 7: ['p', 'q', 'r', 's'] if the digits = '2579'. Just because k is a variable and can be one of two lengths; 3 or 4.

uuid
Автор

Wow this is the best explanation on the internet!

eaatsy
Автор

Sort and simple solution with good explanation

sanjeetlove
Автор

haha charade you are!!! fastest "JavaScript" submitter ;) I was wondering why you picked JS at the beginning.

good explanation though, thanks!

amember