Skip to content

Commit

Permalink
Make linter happy
Browse files Browse the repository at this point in the history
  • Loading branch information
LivInTheLookingGlass committed Jul 1, 2024
1 parent cd6a9c5 commit 9435d43
Show file tree
Hide file tree
Showing 3 changed files with 11 additions and 11 deletions.
4 changes: 2 additions & 2 deletions javascript/p0000_template.js
Original file line number Diff line number Diff line change
@@ -1,10 +1,10 @@
/**
* Project Euler Template
*
*
* This template is used to format Project Euler solution scripts. This paragraph
* should be replaced by a description of how I approached the problem, as well as
* critque.
*
*
* This paragraph should be replaced by the problem description, excluding images.
**/

Expand Down
8 changes: 4 additions & 4 deletions javascript/p0001.js
Original file line number Diff line number Diff line change
@@ -1,13 +1,13 @@
/**

Check failure on line 1 in javascript/p0001.js

View workflow job for this annotation

GitHub Actions / javascript-lint

Missing JSDoc @return for function
* Project Euler Problem 1
*
*
* Did this the old fashioned way, because this was before I figured out the closed form solution
*
*
* Problem:
*
*
* If we list all the natural numbers below 10 that are multiples of 3 or 5, we
* get 3, 5, 6 and 9. The sum of these multiples is 23.
*
*
* Find the sum of all the multiples of 3 or 5 below 1000.
*/
exports.p0001 = function() {
Expand Down
10 changes: 5 additions & 5 deletions javascript/p0002.js
Original file line number Diff line number Diff line change
@@ -1,15 +1,15 @@
/**

Check failure on line 1 in javascript/p0002.js

View workflow job for this annotation

GitHub Actions / javascript-lint

Missing JSDoc @return for function
* Project Euler Problem 2
*
*
* Moved the fibonacci optimization to javascript
*
*
* Problem:
*
*
* Each new term in the Fibonacci sequence is generated by adding the previous two
* terms. By starting with 1 and 2, the first 10 terms will be:
*
*
* 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ...
*
*
* By considering the terms in the Fibonacci sequence whose values do not exceed
* four million, find the sum of the even-valued terms.
**/
Expand Down

0 comments on commit 9435d43

Please sign in to comment.