-
-
Notifications
You must be signed in to change notification settings - Fork 6
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
Add largest-series-product
exercise
#8
Merged
Merged
Changes from all commits
Commits
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 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
26 changes: 26 additions & 0 deletions
26
exercises/practice/largest-series-product/.docs/instructions.md
This file contains 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,26 @@ | ||
# Instructions | ||
|
||
Your task is to look for patterns in the long sequence of digits in the encrypted signal. | ||
|
||
The technique you're going to use here is called the largest series product. | ||
|
||
Let's define a few terms, first. | ||
|
||
- **input**: the sequence of digits that you need to analyze | ||
- **series**: a sequence of adjacent digits (those that are next to each other) that is contained within the input | ||
- **span**: how many digits long each series is | ||
- **product**: what you get when you multiply numbers together | ||
|
||
Let's work through an example, with the input `"63915"`. | ||
|
||
- To form a series, take adjacent digits in the original input. | ||
- If you are working with a span of `3`, there will be three possible series: | ||
- `"639"` | ||
- `"391"` | ||
- `"915"` | ||
- Then we need to calculate the product of each series: | ||
- The product of the series `"639"` is 162 (`6 × 3 × 9 = 162`) | ||
- The product of the series `"391"` is 27 (`3 × 9 × 1 = 27`) | ||
- The product of the series `"915"` is 45 (`9 × 1 × 5 = 45`) | ||
- 162 is bigger than both 27 and 45, so the largest series product of `"63915"` is from the series `"639"`. | ||
So the answer is **162**. |
5 changes: 5 additions & 0 deletions
5
exercises/practice/largest-series-product/.docs/introduction.md
This file contains 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,5 @@ | ||
# Introduction | ||
|
||
You work for a government agency that has intercepted a series of encrypted communication signals from a group of bank robbers. | ||
The signals contain a long sequence of digits. | ||
Your team needs to use various digital signal processing techniques to analyze the signals and identify any patterns that may indicate the planning of a heist. |
19 changes: 19 additions & 0 deletions
19
exercises/practice/largest-series-product/.meta/config.json
This file contains 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 @@ | ||
{ | ||
"authors": [ | ||
"erikschierboom" | ||
], | ||
"files": { | ||
"solution": [ | ||
"largest-series-product.ua" | ||
], | ||
"test": [ | ||
"tests.ua" | ||
], | ||
"example": [ | ||
".meta/example.ua" | ||
] | ||
}, | ||
"blurb": "Given a string of digits, calculate the largest product for a contiguous substring of digits of length n.", | ||
"source": "A variation on Problem 8 at Project Euler", | ||
"source_url": "https://projecteuler.net/problem=8" | ||
} |
This file contains 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,3 @@ | ||
Validate ← |2.2 ⍤ "span must be smaller than string length" ◡(≤⧻) ⍤ "span must not be negative" ≥0 , | ||
Digits ← |1 ⍣(∵⋕) (⍤ "invalid character in digits") | ||
LargestProduct ← |2 /↥ ≡/× ⍣(◫) [1] : Digits Validate | ||
60 changes: 60 additions & 0 deletions
60
exercises/practice/largest-series-product/.meta/tests.toml
This file contains 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,60 @@ | ||
# This is an auto-generated file. | ||
# | ||
# Regenerating this file via `configlet sync` will: | ||
# - Recreate every `description` key/value pair | ||
# - Recreate every `reimplements` key/value pair, where they exist in problem-specifications | ||
# - Remove any `include = true` key/value pair (an omitted `include` key implies inclusion) | ||
# - Preserve any other key/value pair | ||
# | ||
# As user-added comments (using the # character) will be removed when this file | ||
# is regenerated, comments can be added via a `comment` key. | ||
|
||
[7c82f8b7-e347-48ee-8a22-f672323324d4] | ||
description = "finds the largest product if span equals length" | ||
|
||
[88523f65-21ba-4458-a76a-b4aaf6e4cb5e] | ||
description = "can find the largest product of 2 with numbers in order" | ||
|
||
[f1376b48-1157-419d-92c2-1d7e36a70b8a] | ||
description = "can find the largest product of 2" | ||
|
||
[46356a67-7e02-489e-8fea-321c2fa7b4a4] | ||
description = "can find the largest product of 3 with numbers in order" | ||
|
||
[a2dcb54b-2b8f-4993-92dd-5ce56dece64a] | ||
description = "can find the largest product of 3" | ||
|
||
[673210a3-33cd-4708-940b-c482d7a88f9d] | ||
description = "can find the largest product of 5 with numbers in order" | ||
|
||
[02acd5a6-3bbf-46df-8282-8b313a80a7c9] | ||
description = "can get the largest product of a big number" | ||
|
||
[76dcc407-21e9-424c-a98e-609f269622b5] | ||
description = "reports zero if the only digits are zero" | ||
|
||
[6ef0df9f-52d4-4a5d-b210-f6fae5f20e19] | ||
description = "reports zero if all spans include zero" | ||
|
||
[5d81aaf7-4f67-4125-bf33-11493cc7eab7] | ||
description = "rejects span longer than string length" | ||
|
||
[06bc8b90-0c51-4c54-ac22-3ec3893a079e] | ||
description = "reports 1 for empty string and empty product (0 span)" | ||
|
||
[3ec0d92e-f2e2-4090-a380-70afee02f4c0] | ||
description = "reports 1 for nonempty string and empty product (0 span)" | ||
|
||
[6d96c691-4374-4404-80ee-2ea8f3613dd4] | ||
description = "rejects empty string and nonzero span" | ||
|
||
[7a38f2d6-3c35-45f6-8d6f-12e6e32d4d74] | ||
description = "rejects invalid character in digits" | ||
|
||
[5fe3c0e5-a945-49f2-b584-f0814b4dd1ef] | ||
description = "rejects negative span" | ||
include = false | ||
|
||
[c859f34a-9bfe-4897-9c2f-6d7f8598e7f0] | ||
description = "rejects negative span" | ||
reimplements = "5fe3c0e5-a945-49f2-b584-f0814b4dd1ef" |
1 change: 1 addition & 0 deletions
1
exercises/practice/largest-series-product/largest-series-product.ua
This file contains 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 @@ | ||
LargestProduct ← |2 ⍤"Please implement the LargestProduct function" ⊙⊙ |
This file contains 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,17 @@ | ||
~ "largest-series-product.ua" ~ LargestProduct | ||
|
||
⍤⤙≍ 18 LargestProduct "29" 2 # finds the largest product if span equals length | ||
⍤⤙≍ 72 LargestProduct "0123456789" 2 # can find the largest product of 2 with numbers in order | ||
⍤⤙≍ 48 LargestProduct "576802143" 2 # can find the largest product of 2 | ||
⍤⤙≍ 504 LargestProduct "0123456789" 3 # can find the largest product of 3 with numbers in order | ||
⍤⤙≍ 270 LargestProduct "1027839564" 3 # can find the largest product of 3 | ||
⍤⤙≍ 15120 LargestProduct "0123456789" 5 # can find the largest product of 5 with numbers in order | ||
⍤⤙≍ 23520 LargestProduct "73167176531330624919225119674426574742355349194934" 6 # can get the largest product of a big number | ||
⍤⤙≍ 0 LargestProduct "0000" 2 # reports zero if the only digits are zero | ||
⍤⤙≍ 0 LargestProduct "99099" 3 # reports zero if all spans include zero | ||
⍤⤙≍ "span must be smaller than string length" ⍣(LargestProduct "123" 4) # rejects span longer than string length | ||
⍤⤙≍ 1 LargestProduct "" 0 # reports 1 for empty string and empty product (0-span) | ||
⍤⤙≍ 1 LargestProduct "123" 0 # reports 1 for nonempty string and empty product (0 span) | ||
⍤⤙≍ "span must be smaller than string length" ⍣(LargestProduct "" 1) # rejects empty string and nonzero span # rejects empty string and nonzero span | ||
⍤⤙≍ "invalid character in digits" ⍣(LargestProduct "1234a5" 2) # rejects invalid character in digits | ||
⍤⤙≍ "span must not be negative" ⍣(LargestProduct "12345" ¯1) # rejects negative span |
Oops, something went wrong.
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.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
I must admit that being able to write this few characters and have it work makes me feel a little bit giddy :)
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Yes, I feel you. This lets me feel like I am in the matrix