Problem 434. Return the Fibonacci Sequence

• Created by Matt Fig
• Appears in 2 groups

×

By solving this problem, you will make progress in the following group(s)

Sequences & Series I

• 14 Problems
• 87 Finishers

Basics - Fibonacci

• 8 Problems
• 357 Finishers

Like (9)

Difficulty:

(1153)

Rate

• Solve Later   
• Add To GroupÂ

Write a code which returns the Fibonacci Sequence such that the largest value in the sequence is less than the input integer N. For example,

>> fib_seq(34)

ans =

       1  1  2  3  5  8  13  21

>> fib_seq(35)

ans =

       1  1  2  3  5  8  13  21  34

Solve

Solution Stats

31.61% Correct | 68.39% Incorrect

• 4505 Solutions
• 1290 Solvers

Last Solution submitted on May 10, 2025

Last 200 Solutions

Solution Comments

Problem Recent Solvers1290

Suggested Problems

• Trimming Spaces

  2462 Solvers

• Arrange Vector in descending order

  12172 Solvers

• Back to basics 22 - Rotate a matrix

  920 Solvers

• Matrix indexing with two vectors of indices

  739 Solvers

• Make a vector of prime numbers

  804 Solvers

More from this Author6

• What are the odds?

  27 Solvers

• Circle and Quadratic

  14 Solvers

• Mechanics 1

  30 Solvers

• Spiraling out of control....

  11 Solvers

• Find the repeating decimal pattern!

  14 Solvers