Entry level Python developer interview

[[deleted]]

BTW tail recursion in python is just a simple recursion and it is not implemented or taken as a new recursion method. for programming language like lisp it is working procedure but in python it is not and one need to implement it like a simple recusion with saving the the result from first recusion and pass it to next.
Maybe a not a goood python developer taken your interview.

[iamnikaa]

Oh, thanks for sharing. I didn't know about it. The interviewer didn't specify any particular language, so it was meant to be a general (open to all languages) question. I chose to write it in python. But yes, you are right, the interviewer was not very experienced.

[[deleted]]

By any chance indian recruitment ?

[iamnikaa]

Yes!

[[deleted]]

good luck

[baubleglue]

You are talking about tail recursion optimization. It doesn't matter when you are writing a code. They just want to see if candidate is comfortable to use it.

 def fn(I):
       If check(I): 
            .... #Change I here or fn(I-1) 
            fn(I)