Pergunta de entrevista da empresa NetApp
Coding Question Interview - 2: Given that you can take 1, 2 or 3 steps, how many different ways can traverse n steps.
Resposta da entrevista
Sigiloso
25 de jan. de 2019
This can solved with DP, you can come up with the answer if you already know what are the values for you penultimate steps, as you can reach a stair using either 1, 2 or 3 steps, so you can come up with a bottom-up approach, this solution is similar to the Fibonacci series DP problem.