Skip to content
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 etl #132

Merged
merged 1 commit into from
Dec 7, 2024
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
8 changes: 8 additions & 0 deletions config.json
Original file line number Diff line number Diff line change
Expand Up @@ -98,6 +98,14 @@
"prerequisites": [],
"difficulty": 2
},
{
"slug": "etl",
"name": "ETL",
"uuid": "4b6d8618-7080-444d-b71f-36719ef2eb1c",
"practices": [],
"prerequisites": [],
"difficulty": 2
},
{
"slug": "gigasecond",
"name": "Gigasecond",
Expand Down
27 changes: 27 additions & 0 deletions exercises/practice/etl/.docs/instructions.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,27 @@
# Instructions

Your task is to change the data format of letters and their point values in the game.

Currently, letters are stored in groups based on their score, in a one-to-many mapping.

- 1 point: "A", "E", "I", "O", "U", "L", "N", "R", "S", "T",
- 2 points: "D", "G",
- 3 points: "B", "C", "M", "P",
- 4 points: "F", "H", "V", "W", "Y",
- 5 points: "K",
- 8 points: "J", "X",
- 10 points: "Q", "Z",

This needs to be changed to store each individual letter with its score in a one-to-one mapping.

- "a" is worth 1 point.
- "b" is worth 3 points.
- "c" is worth 3 points.
- "d" is worth 2 points.
- etc.

As part of this change, the team has also decided to change the letters to be lower-case rather than upper-case.

~~~~exercism/note
If you want to look at how the data was previously structured and how it needs to change, take a look at the examples in the test suite.
~~~~
16 changes: 16 additions & 0 deletions exercises/practice/etl/.docs/introduction.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,16 @@
# Introduction

You work for a company that makes an online multiplayer game called Lexiconia.

To play the game, each player is given 13 letters, which they must rearrange to create words.
Different letters have different point values, since it's easier to create words with some letters than others.

The game was originally launched in English, but it is very popular, and now the company wants to expand to other languages as well.

Different languages need to support different point values for letters.
The point values are determined by how often letters are used, compared to other letters in that language.

For example, the letter 'C' is quite common in English, and is only worth 3 points.
But in Norwegian it's a very rare letter, and is worth 10 points.

To make it easier to add new languages, your team needs to change the way letters and their point values are stored in the game.
19 changes: 19 additions & 0 deletions exercises/practice/etl/.meta/config.json
Original file line number Diff line number Diff line change
@@ -0,0 +1,19 @@
{
"authors": [
"BNAndras"
],
"files": {
"solution": [
"etl.ex"
],
"test": [
"t_etl.e"
],
"example": [
".meta/example.ex"
]
},
"blurb": "Change the data format for scoring a game to more easily add other languages.",
"source": "Based on an exercise by the JumpstartLab team for students at The Turing School of Software and Design.",
"source_url": "https://turing.edu"
}
19 changes: 19 additions & 0 deletions exercises/practice/etl/.meta/example.ex
Original file line number Diff line number Diff line change
@@ -0,0 +1,19 @@
include std/map.e
include std/text.e

public function transform(map legacy)
map results = map:new()
sequence pairs = map:pairs(legacy)

for i = 1 to length(pairs) do
atom score = pairs[i][1]
sequence letters = pairs[i][2]

for j = 1 to length(letters) do
atom letter = letters[j]
map:put(results, lower(letter), score)
end for
end for

return results
end function
22 changes: 22 additions & 0 deletions exercises/practice/etl/.meta/tests.toml
Original file line number Diff line number Diff line change
@@ -0,0 +1,22 @@
# 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.

[78a7a9f9-4490-4a47-8ee9-5a38bb47d28f]
description = "single letter"

[60dbd000-451d-44c7-bdbb-97c73ac1f497]
description = "single score with multiple letters"

[f5c5de0c-301f-4fdd-a0e5-df97d4214f54]
description = "multiple scores with multiple letters"

[5db8ea89-ecb4-4dcd-902f-2b418cc87b9d]
description = "multiple scores with differing numbers of letters"
3 changes: 3 additions & 0 deletions exercises/practice/etl/etl.ex
Original file line number Diff line number Diff line change
@@ -0,0 +1,3 @@
public function transform(map legacy)

end function
64 changes: 64 additions & 0 deletions exercises/practice/etl/t_etl.e
Original file line number Diff line number Diff line change
@@ -0,0 +1,64 @@
include std/map.e
include std/sort.e
include std/unittest.e

include etl.ex

procedure test_maps_equal(sequence message, map a, map b)
test_equal(message, sort(map:pairs(a)), sort(map:pairs(b)))
end procedure


set_test_verbosity(TEST_SHOW_ALL)

test_maps_equal("single letter",
transform(
map:new_from_kvpairs({
{ 1, { 'A' }}
})),
map:new_from_kvpairs({
{ 'a', 1 }
}))
test_maps_equal("single score with multiple letters",
transform(
map:new_from_kvpairs({
{ 1, { 'A', 'E', 'I', 'O', 'U' }}
})),
map:new_from_kvpairs({
{ 'a', 1 },
{ 'e', 1 },
{ 'i', 1 },
{ 'o', 1 },
{ 'u', 1 }
}))
test_maps_equal("multiple scores with multiple letters",
transform(
map:new_from_kvpairs({
{ 1, { 'A', 'E' } },
{ 2, { 'D', 'G' } }
})),
map:new_from_kvpairs({
{ 'a', 1 },
{ 'd', 2 },
{ 'e', 1 },
{ 'g', 2 }
}))
test_maps_equal("multiple scores with differing numbers of letters",
transform(
map:new_from_kvpairs({
{ 1, { 'A', 'E', 'I', 'O', 'U', 'L', 'N', 'R', 'S', 'T' }},
{ 2, { 'D', 'G' }},
{ 3, { 'B', 'C', 'M', 'P' }},
{ 4, { 'F', 'H', 'V', 'W', 'Y' }},
{ 5, { 'K' }},
{ 8, { 'J', 'X' }},
{ 10, { 'Q', 'Z' }}
})),
map:new_from_kvpairs({
{ 'a', 1 }, { 'b', 3 }, { 'c', 3 }, { 'd', 2 }, { 'e', 1 }, { 'f', 4 }, { 'g', 2 },
{ 'h', 4 }, { 'i', 1 }, { 'j', 8 }, { 'k', 5 }, { 'l', 1 }, { 'm', 3 }, { 'n', 1 },
{ 'o', 1 }, { 'p', 3 }, { 'q', 10 }, { 'r', 1 }, { 's', 1 }, { 't', 1 }, { 'u', 1 },
{ 'v', 4 }, { 'w', 4 }, { 'x', 8 }, { 'y', 4 }, { 'z', 10 }
}))

test_report()
Loading