---
title: "Discussion on \"Solving Fibonacci Number\" | Hashnode"
description: "Discussion on \"Solving Fibonacci Number\". To see the question, click here.\nNaive Approach\nThe idea is to use a recursive approach to compute the Fibonacci sequence. If n is 0 or 1, return n directly, as these are the base cases for the Fibonacci sequence. For any other value of n, recursivel..."
url: "https://hashnode.com/posts/solving-fibonacci-number/6693c4e2a5ffb34f27eb731b"
---

[Feed](https://hashnode.com/feed) /

Discussion

# [Solving Fibonacci Number](https://vineethchivukula.hashnode.dev/solving-fibonacci-number?utm_source=hashnode&utm_medium=feed)

To see the question, click here. Naive Approach The idea is to use a recursive approach to compute the Fibonacci sequence. If n is 0 or 1, return n directly, as these are the base cases for the Fibonacci sequence. For any other value of n, recursivel...

Jul 14, 2024 · 4 min read · vineethchivukula.hashnode.dev  
Read the article

-   [#fibonacci](https://hashnode.com/tag/fibonacci)
-   [#dynamic-programming](https://hashnode.com/tag/dynamic-programming)
-   [#dsa](https://hashnode.com/tag/dsa)

## Written by

[Vineeth Chivukula](https://hashnode.com/@vineethchivukula)

@vineethchivukula · Andhra Pradesh, India

  
[View profile](https://hashnode.com/@vineethchivukula)

Developer && Video editor

There's this guy who's mad about editing and programming. It's his jam, you know?

## Responses

Markdown supported · ⌘↵ to post

No responses yet.
