Letter Combinations of a Phone Number - LeetCode 17 - Backtracking

preview_player
Показать описание
Letter Combinations of a Phone Number - Recursion python - LeetCode python

In this video i will show how to solve the Problem ' Letter Combinations of a Phone Number ' using the recursive Approach.
Recursion is a programming technique that involves defining a function that calls itself with a modified input in order to solve a problem.

This question is asked a lot during coding interview for multiples companies like Google, Amazon, Facebook...

If you find this video helpful, support me with subscribe, like and comment.
Thanks

Intro : (0:00)
Reading The Problem : (0:38)
Recursive Solution Explained : (0:53)
Code Explanation : (3:30)
Complexity Analysis : (4:41)
Рекомендации по теме
Комментарии
Автор

Thanks for your video! Just one thing, in the worse case scenario we would have four letters for digits 7 and 9, so the time comlexity would be O(4^n)

MohSo