BrainFrys

Unleash Your Coding Journey With Brain Frying Power

Plunge into the electrifying realm of BrainFrys, where you dominate programming, science, and uncharted territories with pulse pounding interactive challenges and a fierce community of coding trailblazers.

Ignite Your Epic Coding Quest with Brainfrys, Unleash the Next Generation Coding Master Within
Python Fibonacci
def fibonacci(n):
    # Return Fibonacci sequence up to n
    result = []
    a, b = 0, 1
    while a < n:
        result.append(a)
        a, b = b, a + b
    return result

fib_sequence = fibonacci(100)
print(fib_sequence)
All tests passed
Learn Python
Master AI

Meet Maayavi Your AI Coding Assistant

Stuck on a coding problem? Maayavi provides personalized guidance to help you overcome challenges.

Smart Code Analysis

Identify bugs and suggest optimizations for your code in real-time

Concept Explanations

Get clear, concise explanations of complex programming concepts

Code Generation

Generate code snippets based on your requirements and project needs

Maayavi AI Assistant

Powered by CodeGemma 2B

Maayavi AI

Hi there! I'm Maayavi, your AI coding assistant. How can I help you today?

YouJust now

I'm having trouble with my recursive function. It keeps causing a stack overflow error.

Maayavi AI

Let's look at your recursive function. Stack overflow errors usually happen when your recursion doesn't have a proper base case to terminate. Can you share your code?

YouJust now

Here's my recursive function to calculate Fibonacci numbers:

function fibonacci(n) {
return fibonacci(n-1) + fibonacci(n-2);
}
Maayavi AI

I see the issue! Your recursive function is missing a base case, so it will recurse infinitely. Here's the fix:

function fibonacci(n) {
return fibonacci(n-1) + fibonacci(n-2);
}
function fibonacci(n) {
// Add base cases
if (n <= 0) return 0;
if (n === 1) return 1;
// Recursive case
return fibonacci(n-1) + fibonacci(n-2);
}
YouJust now

Thanks! That makes sense. I forgot to add the termination condition. But won't this still be very slow for large values of n?

Maayavi AI

You're absolutely right! The current implementation has exponential time complexity O(2^n). For better performance, you can use memoization to avoid recalculating the same values:

function fibonacci(n, memo = {}) {
// Check if we've already calculated this value
if (memo[n] !== undefined) return memo[n];
// Base cases
if (n <= 0) return 0;
if (n === 1) return 1;
// Store and return result
memo[n] = fibonacci(n-1, memo) + fibonacci(n-2, memo);
return memo[n];
}
Powered by CodeGemma
Your code stays private
Fast Performance