MCPcopy Create free account
hub / github.com/betomoedano/JavaScript-Coding-Interview-Questions / tandemBicycle

Function tandemBicycle

arrays/tandem-bicycle.js:21–29  ·  view source on GitHub ↗
(redShirtSpeeds, blueShirtSpeeds, fastest)

Source from the content-addressed store, hash-verified

19// 9 + 6 + 5 + 3 + 2 = 25
20
21function tandemBicycle(redShirtSpeeds, blueShirtSpeeds, fastest) {
22 redShirtSpeeds.sort((a, b) => b - a);
23 if (fastest) {
24 blueShirtSpeeds.sort((a, b) => a - b);
25 return sumSpeeds(blueShirtSpeeds, redShirtSpeeds);
26 }
27 blueShirtSpeeds.sort((a, b) => b - a);
28 return sumSpeeds(blueShirtSpeeds, redShirtSpeeds);
29}
30
31function sumSpeeds(red, blue) {
32 let sum = 0;

Callers 1

tandem-bicycle.jsFile · 0.70

Calls 1

sumSpeedsFunction · 0.85

Tested by

no test coverage detected