@appgurueu Sir you are correct when there are just two digits in the provided string, but if we analyze the scenario of three digits, we notice that we need to backtrack for the second digit string.

@appgurueu Sir you are correct when there are just two digits in the provided string, but if we analyze the scenario of three digits, we notice that we need to backtrack for the second digit string.

I wrote the following solution which got accepted in Go:

funcletterCombinations(digitsstring) []string {ifdigits=="" {return []string{}    }letters:= [8]string{"abc","def","ghi","jkl","mno","pqrs","tuv","wxyz"}res:= []string{""}for_,digit:=rangedigits {nextRes:= []string{}for_,letter:=rangeletters[digit-'2'] {for_,str:=rangeres {nextRes=append(nextRes,str+string(letter))            }        }res=nextRes    }returnres}

this problem does not inherently require recursion or backtracking? As said, it's just the cartesian product$\{a, b, c\} \times \{d, e, f\} \times \{g, h, i\}$ f.E. for$123$.

Okay Sir,

I guess your solution is iterative and mine is recursive
My backtracking approach for this solution is
we need to backtrack for node no 3's

https://www.interviewbit.com/blog/letter-combinations-of-a-phone-number/

Backtracking is a class of algorithm for finding solutions to some computational problems, notably constraint satisfaction problems, that incrementally builds candidates to the solutions, and abandons a candidate as soon as it determines that the candidate cannot possibly be completed to a valid solution.

- fromhttps://en.wikipedia.org/wiki/Backtracking

I don't see how this definition is met - no "candidates" are "abandoned" (if I'm missing something, please explain). All I see is a simple combinatorial algorithm. LeetCode and InterviewBit are probably getting their terminology wrong.@raklaptudirm your opinion? Should this go under "Backtracking" or just "Recursion"?

In the Lua repo I prefer to categorize algorithms not by the applied "strategy", but rather strictly by the problem they solve.

Please review@raklaptudirm

I guess recursive would be best.

I guess recursive would be best.

Okay I will update

Done@appgurueu@raklaptudirm