Скачать или смотреть LETTER COMBINATIONS OF A PHONE NUMBER (Leetcode) - Code & Whiteboard

A clean, simple, and efficient solution to Leetcode #17 Letter Combinations of a Phone Number. This one's super popular, so I tried to make it as clear as possible!

Time Complexity: ~O(N^3) where N is the number of digits in the input, and since most digits have 3 possible inputs, I used 3 as an estimate for the exponent. The total time it will take simply depends on how many digits are entered.
Space Complexity: ~O(N^3) for the same reason.

Let me know in the comment section below if you have any questions about the video, or have any other requests! :)
---------------------------------------------------------------------------------------------------------------------------------------------------------------
Let's connect on LinkedIn!
  / aleksmitrovic  

Follow me on Medium!
  / mitrovic.aleksandar  

Questions or suggestions for new videos? Email me!
[email protected]