Where communities thrive


  • Join over 1.5M+ people
  • Join over 100K+ communities
  • Free without limits
  • Create your own community
People
Activity
    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:

    type hint for next hint :pencil: [Contribute at the FCC Wiki]

    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.

    type hint for next hint :pencil: [Contribute at the FCC Wiki]

    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.

    type hint for next hint :pencil: [Contribute at the FCC Wiki]

    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.

    type hint for next hint :pencil: [Contribute at the FCC Wiki]

    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.

    type hint for next hint :pencil: [Contribute at the FCC Wiki]

    ziming
    @ziming
    hint
    CamperBot
    @camperbot

    hint [6/8]

    Spoiler Alert!

    687474703a2f2f7777772e796f75726472756d2e636f6d2f796f75726472756d2f696d616765732f323030372f31302f31302f7265645f7761726e696e675f7369676e5f322e676966.gif

    Solution ahead!

    type hint for next hint :pencil: [Contribute at the FCC Wiki]

    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.

    type hint for next hint :pencil: [Contribute at the FCC Wiki]

    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

    NOTE: Please add your username only if you have added any relevant main contents to the wiki page. (Please don't remove any existing usernames.)

    type hint for next hint :pencil: [Contribute at the FCC Wiki]

    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:

    type hint for next hint :pencil: [Contribute at the FCC Wiki]

    TakaakiFuruse
    @TakaakiFuruse
    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.

    type hint for next hint :pencil: [Contribute at the FCC Wiki]

    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.

    type hint for next hint :pencil: [Contribute at the FCC Wiki]

    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.

    type hint for next hint :pencil: [Contribute at the FCC Wiki]

    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.

    type hint for next hint :pencil: [Contribute at the FCC Wiki]

    Himad Mouhtar
    @hmouhtar
    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:

    type hint for next hint :pencil: [Contribute at the FCC Wiki]

    Himad Mouhtar
    @hmouhtar
    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.

    type hint for next hint :pencil: [Contribute at the FCC Wiki]

    Himad Mouhtar
    @hmouhtar
    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.

    type hint for next hint :pencil: [Contribute at the FCC Wiki]

    Himad Mouhtar
    @hmouhtar
    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.

    type hint for next hint :pencil: [Contribute at the FCC Wiki]

    Himad Mouhtar
    @hmouhtar
    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.

    type hint for next hint :pencil: [Contribute at the FCC Wiki]

    Himad Mouhtar
    @hmouhtar
    hint
    CamperBot
    @camperbot

    hint [6/8]

    Spoiler Alert!

    687474703a2f2f7777772e796f75726472756d2e636f6d2f796f75726472756d2f696d616765732f323030372f31302f31302f7265645f7761726e696e675f7369676e5f322e676966.gif

    Solution ahead!

    type hint for next hint :pencil: [Contribute at the FCC Wiki]

    Himad Mouhtar
    @hmouhtar
    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.

    type hint for next hint :pencil: [Contribute at the FCC Wiki]

    Neil Marlowe
    @nmarlowe
    hint
    CamperBot
    @camperbot

    hint [1/1]

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

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

    type hint for next hint :pencil: [Contribute at the FCC Wiki]

    Neil Marlowe
    @nmarlowe
    hint
    CamperBot
    @camperbot
    These hints depend on people like you! Please add to this :point_right: Bonfire's Wiki Hints Page
    Neil Marlowe
    @nmarlowe
    hint
    CamperBot
    @camperbot

    hint [1/1]

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

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

    type hint for next hint :pencil: [Contribute at the FCC Wiki]

    Neil Marlowe
    @nmarlowe
    hint
    CamperBot
    @camperbot
    These hints depend on people like you! Please add to this :point_right: Bonfire's Wiki Hints Page
    Neil Marlowe
    @nmarlowe
    hint