# FAQ: Technical Interview Problems: Dynamic Programming - Fibonacci With Memoization

This community-built FAQ covers the “Fibonacci With Memoization” exercise from the lesson “Technical Interview Problems: Dynamic Programming”.

Paths and Courses
This exercise can be found in the following Codecademy content:

## FAQs on the exercise Fibonacci With Memoization

There are currently no frequently asked questions associated with this exercise – that’s where you come in! You can contribute to this section by offering your own questions, answers, or clarifications on this exercise. Ask or answer a question by clicking reply () below.

If you’ve had an “aha” moment about the concepts, formatting, syntax, or anything else with this exercise, consider sharing those insights! Teaching others and answering their questions is one of the best ways to learn and stay sharp.

## Join the Discussion. Help a fellow learner on their journey.

Agree with a comment or answer? Like () to up-vote the contribution!

Found a bug? Report it!

Have a question about your account or billing? Reach out to our customer support team!

None of the above? Find out where to ask other questions here!

This wording:
It can be calculated iteratively but summing the two previous numbers, or the `n`th Fibonacci number can be calculated recursively:”
is confusing.
“It” appears to refer to the Fibonacci Series, but refers to the `n`th number. The “but” seems to be a typo. Overall, the order of the words seems to be messed up. It should read:

Calculating the `n`th number
The `n`th Fibonacci number can be calculated iteratively by summing the two previous numbers, or can be calculated recursively:”
"
This has confused me for the rest of the lesson. I had to plot the code solution in paper to understand what was happening.