camperbot/bonfire-sum-all-odd-fibonacci-numbers

CamperBot

@camperbot

hint [3/7]

Hint: 1

To get the next number of the series, you need to add the current one to the previous and that will give you the next one.

rocketrocketrocketship

@rocketrocketrocketship

hint

CamperBot

@camperbot

hint [4/7]

Hint: 2

To check if a number is even all you have to check is if that number % 2 == 0.

rocketrocketrocketship

@rocketrocketrocketship

hint

CamperBot

@camperbot

hint [5/7]

Hint: 3

As you get the next odd one, don't forget to add it to a global variable that can be returned at the end. result += currNumber; Will do the trick.

rocketrocketrocketship

@rocketrocketrocketship

hint

CamperBot

@camperbot

hint [6/7]

Spoiler Alert!

Solution ahead!

rocketrocketrocketship

@rocketrocketrocketship

hint

CamperBot

@camperbot

hint [7/7]

Code Solution:

function sumFibs(num) {
    var prevNumber = 0;
    var currNumber = 1;
    var result = 0;
    while (currNumber <= num) {
        if (currNumber % 2 !== 0) {
            result += currNumber;
        }

        currNumber += prevNumber;
        prevNumber = currNumber - prevNumber;
    }

    return result;
}

Code Explanation:

Create a variable to keep record of the current and previous numbers along with the result that will be returned.
Use a while loop to make sure we do not go over the number given as parameter.
We use the modulo operand to check if the current number is odd or even. If even add it to the result.
Complete the Fibonacci circle by rotating getting the next number and swapping values after.
Return the result.

Credits:

If you found this page useful, you can give thanks by copying and pasting this on the main chat: Thanks @Rafase282 @d3ddd

Sviatoslav Novosiadlyi

@snovos

hint

CamperBot

@camperbot

hint [1/8]

## :construction: After this are possible spoiler hints.

Make sure you've tried to hard to solve it yourself before proceeding. :construction:

ziming

@ziming

hint

CamperBot

@camperbot

hint [1/8]

## :construction: After this are possible spoiler hints.

Make sure you've tried to hard to solve it yourself before proceeding. :construction:

ziming

@ziming

hint

CamperBot

@camperbot

hint [2/8]

# Explanation:

You will need to gather all the Fibonacci numbers and then check for the odd ones. Once you get the odd ones then you will add them all. The last number should be the number given as a parameter if it actually happens to be an off Fibonacci number.

ziming

@ziming

hint

CamperBot

@camperbot

hint [3/8]

Hint: 1

To get the next number of the series, you need to add the current one to the previous and that will give you the next one.

ziming

@ziming

hint

CamperBot

@camperbot

hint [4/8]

Hint: 2

To check if a number is even all you have to check is if that number % 2 == 0.

ziming

@ziming

hint

CamperBot

@camperbot

hint [5/8]

Hint: 3

As you get the next odd one, don't forget to add it to a global variable that can be returned at the end. result += currNumber; Will do the trick.

ziming

@ziming

hint

CamperBot

@camperbot

hint [6/8]

Spoiler Alert!

Solution ahead!

ziming

@ziming

hint

CamperBot

@camperbot

hint [7/8]

Code Solution #1:

function sumFibs(num) {
    var prevNumber = 0;
    var currNumber = 1;
    var result = 0;
    while (currNumber <= num) {
        if (currNumber % 2 !== 0) {
            result += currNumber;
        }

        currNumber += prevNumber;
        prevNumber = currNumber - prevNumber;
    }

    return result;
}

Code Explanation:

Create a variable to keep record of the current and previous numbers along with the result that will be returned.
Use a while loop to make sure we do not go over the number given as parameter.
We use the modulo operand to check if the current number is odd or even. If even add it to the result.
Complete the Fibonacci circle by rotating getting the next number and swapping values after.
Return the result.

ziming

@ziming

hint

CamperBot

@camperbot

hint [8/8]

Code Solution #2:

function sumFibs(num) {
  // create an array of fib numbers till num
  var arrFib = [1];
  for (var i = 1; i <=num;) {
      arrFib.push(i);
      i = arrFib[arrFib.length - 1] + arrFib[arrFib.length - 2];
  }

  // return the sum of odd numbers from the array
  var res = arrFib.reduce(function(prev, curr) { 
      if (curr%2 !== 0) return prev + curr;
      else return prev;
    });

  return res;
}

Code Explanation:

See comments

Credits:

If you found this page useful, you can give thanks by copying and pasting this on the main chat: Thanks @Rafase282 @d3ddd for your help with Bonfire: Sum All Odd Fibonacci Numbers

ziming

@ziming

hint

CamperBot

@camperbot

These hints depend on people like you! Please add to this :point_right: Bonfire's Wiki Hints Page

TakaakiFuruse

@TakaakiFuruse

hint

CamperBot

@camperbot

hint [1/8]

## :construction: After this are possible spoiler hints.

Make sure you've tried to hard to solve it yourself before proceeding. :construction:

TakaakiFuruse

@TakaakiFuruse

hint

CamperBot

@camperbot

hint [2/8]

# Explanation:

TakaakiFuruse

@TakaakiFuruse

hint

CamperBot

@camperbot

hint [3/8]

Hint: 1

To get the next number of the series, you need to add the current one to the previous and that will give you the next one.

TakaakiFuruse

@TakaakiFuruse

hint

CamperBot

@camperbot

hint [4/8]

Hint: 2

To check if a number is even all you have to check is if that number % 2 == 0.

TakaakiFuruse

@TakaakiFuruse

hint

CamperBot

@camperbot

hint [5/8]

Hint: 3

As you get the next odd one, don't forget to add it to a global variable that can be returned at the end. result += currNumber; Will do the trick.

Ghost

@ghost~563399e616b6c7089cb8e11d

hint

CamperBot

@camperbot

hint [1/8]

## :construction: After this are possible spoiler hints.

Make sure you've tried to hard to solve it yourself before proceeding. :construction:

Ghost

@ghost~563399e616b6c7089cb8e11d

hint

CamperBot

@camperbot

hint [2/8]

# Explanation:

Ghost

@ghost~563399e616b6c7089cb8e11d

hint

CamperBot

@camperbot

hint [3/8]

Hint: 1

To get the next number of the series, you need to add the current one to the previous and that will give you the next one.

Ghost

@ghost~563399e616b6c7089cb8e11d

hint

CamperBot

@camperbot

hint [4/8]

Hint: 2

To check if a number is even all you have to check is if that number % 2 == 0.

Ghost

@ghost~563399e616b6c7089cb8e11d

hint

CamperBot

@camperbot

hint [5/8]

Hint: 3

As you get the next odd one, don't forget to add it to a global variable that can be returned at the end. result += currNumber; Will do the trick.

Ghost

@ghost~563399e616b6c7089cb8e11d

hint

Where communities thrive

People

Repo info

Activity

Hint: 1

Hint: 2

Hint: 3

Spoiler Alert!

Code Solution:

Code Explanation:

Credits:

## :construction: After this are possible spoiler hints.

## :construction: After this are possible spoiler hints.

# Explanation:

Hint: 1

Hint: 2

Hint: 3

Spoiler Alert!

Code Solution #1:

Code Explanation:

Code Solution #2:

Code Explanation:

Credits:

## :construction: After this are possible spoiler hints.

# Explanation:

Hint: 1

Hint: 2

Hint: 3

## :construction: After this are possible spoiler hints.

# Explanation:

Hint: 1

Hint: 2

Hint: 3