Skip to content

Metternich11/sum-intervals

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

4 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Algo Rithms Challenge // sum of intervals

Cake and grief counseling will be available at the conclusion of the test.

1. Getting started

git clone https://github.com/Metternich11/sum-intervals.git

Fork this repo and then git clone your forked repo to your computer. Write your function in index.js Once you're happy with your solution, git push and submit a pull request at github.com/Metternich11/sum-intervals.

2. Challenge

// Write a function called sumIntervals that accepts an array of intervals and // returns the sum of all the interval lengths. Overlapping intervals // should only be counted once.

e.g. sumIntervals([[1,4], [3,5]]) ==> 4

2.2. Testing your solution

To test your solution, run npm i in the root directory and then run npm t to run the automated tests.

2.3. Submitting your solution

To submit your solution:

  1. If you're working on a forked repo, push your changes to your forked repo and submit a pull request to this repo.

the cake is a lie

the cake is a lie

the cake is a lie

the cake is a lie

the cake is a lie

About

No description, website, or topics provided.

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published