let oddSum = 1
let nextNum = 0
while (nextNum < num) {
nextNum = num1 + num2;
num1 = num2;
num2 = nextNum;
if (nextNum >= num) {
break;
} else if (nextNum % 2 === 0) {
} else {
oddSum += nextNum;
}
}
return oddSum;
}
// Tried for almost an hour doing this with a for loop/array before simplifying it.
/**
* Test Suite
*/
describe('sumOddFibonacciNumbers()', () => {
it('returns sum of all odd Fibonnci numbers', () => {
// arrange
const num = 10;
// act
const result = sumOddFibonacciNumbers(num);
// log
console.log("result 1: ", result);
// assert
expect(result).toBe(10);
});
it('returns sum of all odd Fibonnci numbers 2nd example', () => {
// arrange
const num = 1000;
// act
const result = sumOddFibonacciNumbers(num);
// log
console.log("result 2: ", result);
// assert
expect(result).toBe(1785);
});
});
function sumOddFibonacciNumbers(num) {
// write code here.
let num1 = 0
let num2 = 1