-
-
Notifications
You must be signed in to change notification settings - Fork 5.8k
Project Euler problem 19 #1577
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Open
pomkarnath98
wants to merge
20
commits into
TheAlgorithms:master
from
pomkarnath98:project-euler-problem-19
Open
Project Euler problem 19 #1577
Changes from all commits
Commits
Show all changes
20 commits
Select commit
Hold shift + click to select a range
b7309f0
📦 NEW: Added solution for ProjectEuler-007
omkarnathparida d3a3b33
🐛 FIX: Spelling mistake fixes
omkarnathparida e9b5a6a
👌 IMPROVE: changed variable name from `inc` to `candidateValue` and t...
omkarnathparida e99c722
👌 IMPROVE: Modified the code
omkarnathparida 5ac898f
Merge branch 'TheAlgorithms:master' into master
pomkarnath98 0f9f1ba
👌 IMPROVE: Added test case for ProjectEuler Problem001
omkarnathparida 3caad5c
Merge branch 'TheAlgorithms:master' into master
pomkarnath98 b7584fd
Merge branch 'TheAlgorithms:master' into master
pomkarnath98 6693f9c
Merge branch 'TheAlgorithms:master' into master
pomkarnath98 0830570
Merge branch 'TheAlgorithms:master' into master
pomkarnath98 4d7149c
Merge branch 'TheAlgorithms:master' into master
pomkarnath98 53e3938
👌 IMPROVE: Added test cases for Project Euler Problem 4
omkarnathparida 96224e7
👌 IMPROVE: auto prettier fixes
omkarnathparida ae8ac3a
📦 NEW: Added solutuon and testcases for `Project Euler` problem 19
omkarnathparida b996553
👌 IMPROVE: Updated prettier changes
omkarnathparida 5d1f546
🐛 FIX: indentation fixes
omkarnathparida 4962de4
👌 IMPROVE: Prettier modifications
omkarnathparida 4d4555c
Updated Documentation in README.md
c3b3bd5
👌 IMPROVE: Prettier modifications
omkarnathparida 26773b3
Merge branch 'project-euler-problem-19' of https://github.com/pomkarn...
omkarnathparida File filter
Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
There are no files selected for viewing
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
|
|
@@ -16,7 +16,7 @@ function BinaryCountSetBits(a) { | |
|
|
||
| let count = 0 | ||
| while (a) { | ||
| a &= (a - 1) | ||
| a &= a - 1 | ||
| count++ | ||
| } | ||
|
|
||
|
|
||
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
|
|
@@ -35,6 +35,6 @@ export const isAutomorphic = (n) => { | |
| n = Math.floor(n / 10) | ||
| n_sq = Math.floor(n_sq / 10) | ||
| } | ||
|
|
||
| return true | ||
| } | ||
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -1,8 +1,8 @@ | ||
| // https://projecteuler.net/problem=6 | ||
|
|
||
| export const squareDifference = (num = 100) => { | ||
| let sumOfSquares = (num)*(num+1)*(2*num+1)/6 | ||
| let sums = (num*(num+1))/2 | ||
| let sumOfSquares = (num * (num + 1) * (2 * num + 1)) / 6 | ||
| let sums = (num * (num + 1)) / 2 | ||
|
|
||
| return sums ** 2 - sumOfSquares // difference of square of the total sum and sum of squares | ||
| } |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,19 @@ | ||
| // https://projecteuler.net/problem=19 | ||
|
|
||
| export const countSundays = (startYear = 1901, endYear = 2000) => { | ||
| let n = 0 | ||
| let dayOfWeek = 2 | ||
| const months = [31, 0, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31] | ||
|
|
||
| for (let year = startYear; year <= endYear; year++) { | ||
| months[1] = 28 + ((year % 4 === 0 && year % 100 !== 0) || year % 400 === 0) | ||
|
|
||
| for (const month of months) { | ||
| dayOfWeek += month % 7 | ||
| if (dayOfWeek % 7 === 0) { | ||
| n++ | ||
| } | ||
| } | ||
| } | ||
| return n | ||
| } |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,11 @@ | ||
| import { largestPalindromic } from '../Problem004.js' | ||
|
|
||
| describe('Largest Palindromic Number', () => { | ||
| test('if digit is 2', () => { | ||
| expect(largestPalindromic(2)).toBe(9009) | ||
| }) | ||
| // Project Euler Condition Check | ||
| test('if digit is 3', () => { | ||
| expect(largestPalindromic(3)).toBe(906609) | ||
| }) | ||
| }) |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,11 @@ | ||
| import { countSundays } from '../Problem019.js' | ||
|
|
||
| describe('Count Sundays', () => { | ||
| test('when start year is 1801 and end year is 1900', () => { | ||
| expect(countSundays(1801, 1900)).toBe(172) | ||
| }) | ||
| // Project Euler Condition Check | ||
| test('when start year is 1901 and end year is 2000', () => { | ||
| expect(countSundays()).toBe(171) | ||
| }) | ||
| }) |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -1,29 +1,29 @@ | ||
| import { binaryEquivalent } from "../BinaryEquivalent"; | ||
| import { binaryEquivalent } from '../BinaryEquivalent' | ||
|
|
||
| const tests = [ | ||
| { | ||
| test: 2, | ||
| expectedValue: "10" | ||
| }, | ||
| { | ||
| test: 0, | ||
| expectedValue: "0" | ||
| }, | ||
| { | ||
| test: 543, | ||
| expectedValue: "1000011111" | ||
| }, | ||
| { | ||
| test: 4697621023, | ||
| expectedValue: "100011000000000000000001000011111" | ||
| } | ||
| { | ||
| test: 2, | ||
| expectedValue: '10' | ||
| }, | ||
| { | ||
| test: 0, | ||
| expectedValue: '0' | ||
| }, | ||
| { | ||
| test: 543, | ||
| expectedValue: '1000011111' | ||
| }, | ||
| { | ||
| test: 4697621023, | ||
| expectedValue: '100011000000000000000001000011111' | ||
| } | ||
| ] | ||
|
|
||
| describe("Binary Equivalent", () => { | ||
| test.each(tests)( | ||
| "of $test should be $expectedValue", | ||
| ({test, expectedValue}) => { | ||
| expect(binaryEquivalent(test)).toBe(expectedValue); | ||
| } | ||
| ) | ||
| describe('Binary Equivalent', () => { | ||
| test.each(tests)( | ||
| 'of $test should be $expectedValue', | ||
| ({ test, expectedValue}) => { | ||
| expect(binaryEquivalent(test)).toBe(expectedValue) | ||
| } | ||
| ) | ||
| }) |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
|
|
@@ -36,4 +36,4 @@ export function interpolationSearch(arr, key) { | |
| } | ||
|
|
||
| return -1 | ||
| } | ||
| } | ||
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.