Complete sum all odd Fibonacci numbers algorithm

Author: ahcode0919

src/fcc-intermediate-algorithms/fcc-intermediate-algorithms.md

@@ -15,6 +15,7 @@ From the Freecodecamp Javascript Certification Intermediate Algorithms module
 - [Missing Letters](#missing-letters)
 - [Sorted Union](#sorted-union)
 - [Convert HTML Entities](#convert-html-entities)
+- [Sum All Odd Fibonacci Numbers](#sum-all-odd-ficonacci-numbers)
 
 #### Sum All Numbers In a Range
 
@@ -252,3 +253,30 @@ export function convertHTML(str) {
     return newString.join('');
 }
 ```
+
+#### Sum All Odd Fibonacci Numbers
+
+Given a positive integer num, return the sum of all odd Fibonacci numbers that are less than or equal to num.
+
+The first two numbers in the Fibonacci sequence are 1 and 1. Every additional number in the sequence is the sum of the two previous numbers. The first six numbers of the Fibonacci sequence are 1, 1, 2, 3, 5 and 8.
+
+For example, `sumFibs(10)` should return 10 because all odd Fibonacci numbers less than or equal to 10 are 1, 1, 3, and 5.
+
+```javascript
+export function sumFibs(num) {
+    const getFibonacciNumbers = (upperBound) => {
+        let numbers = [1, 1];
+        if (upperBound == 0) {
+            throw 'Fibonacci progression upper bound must be >= 1';
+        }
+        const total = () => numbers[numbers.length - 2] + numbers[numbers.length - 1];
+        while (total() <= upperBound) {
+            numbers.push(total());
+        }
+        return numbers;
+    }
+
+    let numbers = getFibonacciNumbers(num).filter((num) => num % 2 !== 0);
+    return numbers.reduce((acc, num) => acc + num);
+}
+```

src/fcc-intermediate-algorithms/sum_all_odd_fibonacci_numbers.js

@@ -0,0 +1,16 @@
+export function sumFibs(num) {
+    const getFibonacciNumbers = (upperBound) => {
+        let numbers = [1, 1];
+        if (upperBound == 0) {
+            throw 'Fibonacci progression upper bound must be >= 1';
+        }
+        const total = () => numbers[numbers.length - 2] + numbers[numbers.length - 1];
+        while (total() <= upperBound) {
+            numbers.push(total());
+        }
+        return numbers;
+    }
+
+    let numbers = getFibonacciNumbers(num).filter((num) => num % 2 !== 0);
+    return numbers.reduce((acc, num) => acc + num);
+}

tests/fcc-intermediate-algorithms/sum_all_odd_fibonacci_numbers.test.js

@@ -0,0 +1,8 @@
+import { sumFibs } from "../../src/fcc-intermediate-algorithms/sum_all_odd_fibonacci_numbers";
+
+test('should sum all odd Fibonacci numbers', () => {
+    expect(() => sumFibs(0)).toThrow('Fibonacci progression upper bound must be >= 1');
+    expect(sumFibs(1)).toBe(2);
+    expect(sumFibs(2)).toBe(2);
+    expect(sumFibs(10)).toBe(10);
+});