InterviewDB Question

Grammarly SWE Phone - Fibonacci Number

phone
Sign in to bookmark

Question Details

Problem Compute the nth Fibonacci number using recursion, memoization, or iterative DP. Likely LeetCode equivalent LC 509 - Fibonacci Number (>80% confident) Tags recursion, dynamic_programming, math

Full Details

🔒

Unlock all Grammarly questions

Full insider details, leaked discussions, and candidate experiences.

Get full access — $100 a year, unlimited access

About This Question

This is a reported interview question from a grammarly interview during the phone round.

It covers the following topics: Recursion, Coding, Phone, Dynamic Programming .

Topics

Recursion Coding Phone Dynamic Programming

More Grammarly Interview Questions

1p3a grammarly software engineer onsite interview experience InterviewDB All K Substrings - Generate All Substrings of Exactly Length K InterviewDB Grammarly SWE Phone - Duplicate and Missing Numbers InterviewDB Grammarly SWE Onsite - Merge Correction InterviewDB Grammarly SWE Phone - Minimum Time Difference
← All Grammarly questions Grammarly Software Engineer Questions → All Recursion Questions →