freeCodeCamp/sum-all-odd-fibonacci-numbers.english.md at b13e23037ccf563858473fcd284641ef9d66b8bd

gaspersic/freeCodeCamp

Fork 0

Files

.github

api-server

client

config

curriculum

challenges

_meta

arabic

chinese

english

01-responsive-web-design

02-javascript-algorithms-and-data-structures

basic-algorithm-scripting

basic-data-structures

basic-javascript

debugging

es6

functional-programming

intermediate-algorithm-scripting

arguments-optional.english.md

binary-agents.english.md

convert-html-entities.english.md

diff-two-arrays.english.md

dna-pairing.english.md

drop-it.english.md

everything-be-true.english.md

make-a-person.english.md

map-the-debris.english.md

missing-letters.english.md

pig-latin.english.md

search-and-replace.english.md

seek-and-destroy.english.md

smallest-common-multiple.english.md

sorted-union.english.md

spinal-tap-case.english.md

steamroller.english.md

sum-all-numbers-in-a-range.english.md

sum-all-odd-fibonacci-numbers.english.md

sum-all-primes.english.md

wherefore-art-thou.english.md

javascript-algorithms-and-data-structures-projects

object-oriented-programming

regular-expressions

03-front-end-libraries

04-data-visualization

06-information-security-and-quality-assurance

08-coding-interview-prep

09-certificates

portuguese

russian

spanish

adddir.js

translatemd.js

formattingConversion

math-challenges

requiresTests

schema

.babelrc

.editorconfig

.eslintignore

.eslintrc

.npmignore

.prettierrc

.travis.yml

CHANGELOG.md

LICENSE.md

addAssertsToTapTest.js

challengeTitles.js

commitizen.config.js

commitlint.config.js

create-challenge-bundle.js

getChallenges.js

gulpfile.js

index.js

lib.js

md-translation.js

mongoIds.js

package-entry.js

package-lock.json

package.json

repack.js

test-challenges.js

unpack.js

unpacked.css

unpacked.js

unpackedChallenge.js

utils.js

docs

news

tools

.editorconfig

.eslintignore

.eslintrc

.gitattributes

.gitignore

.node-inspectorrc

.prettierrc

.snyk

.travis.yml

.vcmrc

CODE_OF_CONDUCT.md

CONTRIBUTING.md

LICENSE.md

README.md

docker-compose-shared.yml

docker-compose.yml

lerna.json

netlify.toml

package-lock.json

package.json

sample.env

Bouncey a859035023 fix(challenge-md): Fix quotes that failed in the transform

2018-10-08 11:38:26 +05:30

2.3 KiB

Raw Blame History

id, title, isRequired, challengeType

id	title	isRequired	challengeType
a5229172f011153519423690	Sum All Odd Fibonacci Numbers	true	5

Description

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. Remember to use Read-Search-Ask if you get stuck. Try to pair program. Write your own code.

Instructions

Tests

tests:
  - text: <code>sumFibs(1)</code> should return a number.
    testString: 'assert(typeof sumFibs(1) === "number", "<code>sumFibs(1)</code> should return a number.");'
  - text: <code>sumFibs(1000)</code> should return 1785.
    testString: 'assert(sumFibs(1000) === 1785, "<code>sumFibs(1000)</code> should return 1785.");'
  - text: <code>sumFibs(4000000)</code> should return 4613732.
    testString: 'assert(sumFibs(4000000) === 4613732, "<code>sumFibs(4000000)</code> should return 4613732.");'
  - text: <code>sumFibs(4)</code> should return 5.
    testString: 'assert(sumFibs(4) === 5, "<code>sumFibs(4)</code> should return 5.");'
  - text: <code>sumFibs(75024)</code> should return 60696.
    testString: 'assert(sumFibs(75024) === 60696, "<code>sumFibs(75024)</code> should return 60696.");'
  - text: <code>sumFibs(75025)</code> should return 135721.
    testString: 'assert(sumFibs(75025) === 135721, "<code>sumFibs(75025)</code> should return 135721.");'

Challenge Seed

function sumFibs(num) {
  return num;
}

sumFibs(4);

Solution

function sumFibs(num) {
  var a = 1;
  var b = 1;
  var s = 0;
  while (a <= num) {
    if (a % 2 !== 0) {
      s += a;
    }
    a = [b, b=b+a][0];
  }
  return s;
}

2.3 KiB Raw Blame History