Implement a function that returns the nth Fibonacci number using recursion.

Medium Difficulty

Medium questions delve deeper, challenging you to apply your knowledge to common scenarios. They test your ability to think on your feet and adapt your basic skills to real-world contexts.

Coding question

Coding questions assess your programming abilities and thought process. Showcase your problem-solving approach, coding style, knowledge of data structures, and ability to write clean, efficient, and maintainable code.

Here's a Hint

Remember that recursive Fibonacci has exponential time complexity. Consider how you might optimize with memoization.