LeetCode Tutorial 17. Letter Combinations of a Phone Number

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

GoodTecher LeetCode Tutorial 17. Letter Combinations of a Phone Number

LeetCode Tutorial by GoodTecher. The tutorial provides a step-by-step demonstration on how to solve coding problems.

Complete Playlist for the GoodTecher LeetCode Tutorial:

GoodTecher Website:

GoodTecher Channel on YouTube:

GoodTecher Github:

GoodTecher Facebook

GoodTecher Twitter

Рекомендации по теме

Комментарии

Great video bro! You did a really good job with the sketch board walkthrough and its very easy to see what is happening with recursion. Keep this up!

mohammadakhtar

Perfect explanation, i watched complete video. Perfect description of hashmap and its uses. Good one and once again thanks for your work.

chinmayanand

Keep up the great work.. These are extremely helpful

shabbirsaifee

Keep making videos dear, it helps a lot. Thank you for your efforts.

chinmayanand

I like the solution very much. It helped a lot. IMO, we can move number to characters map as static member of class and no need to pass it again to method letterCombinationsHelper. Keep adding new stuff.

RajeshDwivediLucknow

using sb.length() as a counter is brilliant.

Regisrozario

I am a bit confused as to why the `digits.length == sb.length` check works. If we have a input string of "000", `sb.length` will never be == `digits.length`

ihopethiscommentisntabusiv

I am struggling with understanding how this line :

is getting each character in the digit and then adding that to the next character. say we have a digit "23" as given in your example. sb.length is *2* .
So, the for loop gets all the values at key 2 in the map which are *'a', 'b', and 'c' *. so, the next line
adds the character 'a' to the string builder and then recursively calls the helper again but sb. length now is *1* so, on a second call, the maps get the key 1 and not 3. Am confused. Could someone explain how each character in key 2 is added to each character in key 3 given a digit "23" from the code? I am so so confused looking at the code.

lawrencejustin

what is the time and space complexity>

SudeeptaSood

you didn't clearly describe the enhanced for loop, first sb.length 2, charAt 2 is a then a is added to ch, then sb length is 1, charAt 1 is digit 3, it will combine with a and make ad. it is making no sense, As a beginner I m very confused. i am following ur channel bt nw I am stuck. plz make clear

abdullahalnoman

LeetCode Tutorial 17. Letter Combinations of a Phone Number

Letter Combinations of a Phone Number - Backtracking - Leetcode 17

Letter Combinations of a Phone Number - Leetcode 17

Meta Coding Interview Question - Letter Combinations of a Phone Number - Leetcode 17

LeetCode Letter Combinations of a Phone Number Solution Explained - Java

LeetCode Tutorial 17. Letter Combinations of a Phone Number

Leetcode 17. Letter Combinations of a Phone Number in Python | Python Leetcode | Python Tutorial

Facebook Interview Question! | Letter Combinations of a Phone Number - Leetcode 17

17. Letter Combinations of a Phone Number Python LeetCode Solution #python #leetcode #coding

Letter Combinations of a Phone Number - Leetcode 17 - Recursive Backtracking (Python)

Leetcode 17 - Letter Combinations of a Phone Number (JAVA Solution Explained!)

Letter Combinations of a Phone Number - Leetcode 17 - Java

LeetCode in C# | 17. Letter Combinations of a Phone Number

Meta Coding Interview Question - LeetCode 17 - Letter Combinations of a Phone Number

Leetcode 17 Letter Combinations of a Phone Number

Leetcode - 17 Letter Combinations of a Phone Number (Medium) in Java,Python

[Java] Leetcode 17. Letter Combinations of a Phone Number [Backtracking #1]

Python Programming Practice: LeetCode #17 -- Letter Combinations of a Phone Number

Leetcode - Letter Combinations of a Phone Number (Python)

LeetCode 17. Letter Combinations of a Phone Number Explanation and Solution

Letter Combinations of a Phone Number Python Solution - LeetCode #17

Letter Combinations of a Phone Number | Live Coding with Explanation | Leetcode - 17

LeetCode 17 - Letter Combinations of a Phone Number

LeetCode #17. Letter Combinations of a Phone Number - Backtracking Solution

Leetcode 17. Letter Combinations of a Phone Number (iterative + recursive)