three-fibonacci-sum

java

python3

python

javascript

typescript

csharp

golang

kotlin

swift

rust

ruby

dart

scala

elixir

erlang

racket

bash

mysql

mssql

postgresql

oraclesql

pythondata

Algorithms

You are given an integer <code>n</code>.

The Fibonacci sequence starts with 0 and 1, and each subsequent number is the sum of the previous two numbers. Its first few terms are <code>0, 1, 1, 2, 3, 5, 8, 13, ...</code>.

Return <code>true</code> if <code>n</code> can be expressed as the sum of three consecutive terms in the Fibonacci sequence, and <code>false</code> otherwise.

&nbsp;
Example 1:

<div class="example-block">
Input: n = 16

Output: true

Explanation:

The three consecutive terms 3, 5, and 8 have a sum of <code>3 + 5 + 8 = 16</code>.
</div>

Example 2:

<div class="example-block">
Input: n = 8

Output: false

Explanation:

Although <code>1 + 2 + 5 = 8</code>, these terms are not consecutive in the Fibonacci sequence. No three consecutive terms have a sum of 8.
</div>

Example 3:

<div class="example-block">
Input: n = 2

Output: true

Explanation:

The first three terms have a sum of <code>0 + 1 + 1 = 2</code>.
</div>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= n &lt;= 109</code></li>
</ul>

Weekly Contest 523

weekly-contest-523

threeFibonacciSum

Mid Level

Three Fibonacci Sum

Accepted

Wrong Answer

Memory Limit Exceeded

Output Limit Exceeded

Time Limit Exceeded

Runtime Error

Internal Error

Compile Error

Timeout

Restrictions Failed

cangjie

react

vanillajs

You are given an integer n.

The Fibonacci sequence starts with 0 and 1, and each subsequent number is the sum of the previous two numbers. Its first few terms are 0, 1, 1, 2, 3, 5, 8, 13, ....

Return true if n can be expressed as the sum of three consecutive terms in the Fibonacci sequence, and false otherwise.

 

Example 1:

Input: n = 16

Output: true

Explanation:

The three consecutive terms 3, 5, and 8 have a sum of 3 + 5 + 8 = 16.

Example 2:

Input: n = 8

Output: false

Explanation:

Although 1 + 2 + 5 = 8, these terms are not consecutive in the Fibonacci sequence. No three consecutive terms have a sum of 8.

Example 3:

Input: n = 2

Output: true

Explanation:

The first three terms have a sum of 0 + 1 + 1 = 2.

 

Constraints:

 * 1 <= n <= 109