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]