Fib Till N

easy

Unknown

Question Solve Solutions

Take as input a number n.<br>
 Print all terms of Fibonacci sequence smaller than equal to n where
 0th Fibonacci is 0 and 1st Fibonacci is 1. Here is a sample<br>
 0 1 1 2 3 5 8 13 21 34 55

Input Format

Integer

Output Format

Space separated integers

Constraints

  n <= 10 ^ 9

Notice

Try First, Check Solution later

1. You should first read the question and watch the question video.
2. Think of a solution approach, then try and submit the question on editor tab.
3. We strongly advise you to watch the solution video for prescribed approach.

Exit Point of a matrix

Related Questions

easy Is Prime easy Prime Till N easy Reverse Integer easy GCD easy Fibonacci easy Exit Point of a matrix easy Placing N Queen in a matrix easy Arranging Vowels And Consonants easy Addition Of Two Linked List easy Circular Linked List easy Sort The Absolute List easy Decimal Number From Binary Linked List easy Find the largest rectangle in a matrix easy Count Pairs Having Sum X easy Delete alternate nodes of linked list easy Sum Of Last K Nodes In A Linked List