function sumOddFibonacciNumbers(num) {
// write code here.
let fibs = [1, 1];
let count = 0;
let fibNums;
while (num > count) {
fibNums = fibs[count] + fibs[count + 1];
if (fibNums <= num) {
fibs.push(fibNums);
}
count++;
}
return fibs.filter(n => n % 2 !== 0).reduce((a,b) => a + b);
}
/**
* 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);
});
});