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.
Sort and simple solution with good explanation
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.
great explanation
Wow this is the best explanation on the internet!
haha charade you are!!! fastest "JavaScript" submitter ;) I was wondering why you picked JS at the beginning.
good explanation though, thanks!