Skip to content

Commit

Permalink
Add high-scores exercise
Browse files Browse the repository at this point in the history
  • Loading branch information
ErikSchierboom committed Oct 5, 2024
1 parent c47d46f commit b667f92
Show file tree
Hide file tree
Showing 7 changed files with 147 additions and 0 deletions.
8 changes: 8 additions & 0 deletions config.json
Original file line number Diff line number Diff line change
Expand Up @@ -680,6 +680,14 @@
"practices": [],
"prerequisites": [],
"difficulty": 1
},
{
"slug": "high-scores",
"name": "High Scores",
"uuid": "f238872e-385b-42b9-9e4d-1725c23c2cd3",
"practices": [],
"prerequisites": [],
"difficulty": 1
}
]
},
Expand Down
6 changes: 6 additions & 0 deletions exercises/practice/high-scores/.docs/instructions.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,6 @@
# Instructions

Manage a game player's High Score list.

Your task is to build a high-score component of the classic Frogger game, one of the highest selling and most addictive games of all time, and a classic of the arcade era.
Your task is to write methods that return the highest score from the list, the last added score and the three highest scores.
18 changes: 18 additions & 0 deletions exercises/practice/high-scores/.meta/config.json
Original file line number Diff line number Diff line change
@@ -0,0 +1,18 @@
{
"authors": [
"erikschierboom"
],
"files": {
"solution": [
"high-scores.R"
],
"test": [
"test_high-scores.R"
],
"example": [
".meta/example.R"
]
},
"blurb": "Manage a player's High Score list.",
"source": "Tribute to the eighties' arcade game Frogger"
}
Empty file.
46 changes: 46 additions & 0 deletions exercises/practice/high-scores/.meta/tests.toml
Original file line number Diff line number Diff line change
@@ -0,0 +1,46 @@
# 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.

[1035eb93-2208-4c22-bab8-fef06769a73c]
description = "List of scores"

[6aa5dbf5-78fa-4375-b22c-ffaa989732d2]
description = "Latest score"

[b661a2e1-aebf-4f50-9139-0fb817dd12c6]
description = "Personal best"

[3d996a97-c81c-4642-9afc-80b80dc14015]
description = "Top 3 scores -> Personal top three from a list of scores"

[1084ecb5-3eb4-46fe-a816-e40331a4e83a]
description = "Top 3 scores -> Personal top highest to lowest"

[e6465b6b-5a11-4936-bfe3-35241c4f4f16]
description = "Top 3 scores -> Personal top when there is a tie"

[f73b02af-c8fd-41c9-91b9-c86eaa86bce2]
description = "Top 3 scores -> Personal top when there are less than 3"

[16608eae-f60f-4a88-800e-aabce5df2865]
description = "Top 3 scores -> Personal top when there is only one"

[2df075f9-fec9-4756-8f40-98c52a11504f]
description = "Top 3 scores -> Latest score after personal top scores"

[809c4058-7eb1-4206-b01e-79238b9b71bc]
description = "Top 3 scores -> Scores after personal top scores"

[ddb0efc0-9a86-4f82-bc30-21ae0bdc6418]
description = "Top 3 scores -> Latest score after personal best"

[6a0fd2d1-4cc4-46b9-a5bb-2fb667ca2364]
description = "Top 3 scores -> Scores after personal best"
Empty file.
69 changes: 69 additions & 0 deletions exercises/practice/high-scores/test_high-scores.R
Original file line number Diff line number Diff line change
@@ -0,0 +1,69 @@


def test_list_of_scores(self):

Check warning on line 3 in exercises/practice/high-scores/test_high-scores.R

View workflow job for this annotation

GitHub Actions / precheck

file=/home/runner/work/r/r/exercises/practice/high-scores/test_high-scores.R,line=3,col=5,[error] unexpected symbol
scores = [30, 50, 20, 70]
expected = [30, 50, 20, 70]
self.assertEqual(HighScores(scores).scores, expected)

def test_latest_score(self):
scores = [100, 0, 90, 30]
expected = 30
self.assertEqual(HighScores(scores).latest(), expected)

def test_personal_best(self):
scores = [40, 100, 70]
expected = 100
self.assertEqual(HighScores(scores).personal_best(), expected)

def test_personal_top_three_from_a_list_of_scores(self):
scores = [10, 30, 90, 30, 100, 20, 10, 0, 30, 40, 40, 70, 70]
expected = [100, 90, 70]
self.assertEqual(HighScores(scores).personal_top_three(), expected)

def test_personal_top_highest_to_lowest(self):
scores = [20, 10, 30]
expected = [30, 20, 10]
self.assertEqual(HighScores(scores).personal_top_three(), expected)

def test_personal_top_when_there_is_a_tie(self):
scores = [40, 20, 40, 30]
expected = [40, 40, 30]
self.assertEqual(HighScores(scores).personal_top_three(), expected)

def test_personal_top_when_there_are_less_than_3(self):
scores = [30, 70]
expected = [70, 30]
self.assertEqual(HighScores(scores).personal_top_three(), expected)

def test_personal_top_when_there_is_only_one(self):
scores = [40]
expected = [40]
self.assertEqual(HighScores(scores).personal_top_three(), expected)

def test_latest_score_after_personal_top_scores(self):
scores = [70, 50, 20, 30]
expected = 30
highscores = HighScores(scores)
highscores.personal_top_three()
self.assertEqual(highscores.latest(), expected)

def test_scores_after_personal_top_scores(self):
scores = [30, 50, 20, 70]
expected = [30, 50, 20, 70]
highscores = HighScores(scores)
highscores.personal_top_three()
self.assertEqual(highscores.scores, expected)

def test_latest_score_after_personal_best(self):
scores = [20, 70, 15, 25, 30]
expected = 30
highscores = HighScores(scores)
highscores.personal_best()
self.assertEqual(highscores.latest(), expected)

def test_scores_after_personal_best(self):
scores = [20, 70, 15, 25, 30]
expected = [20, 70, 15, 25, 30]
highscores = HighScores(scores)
highscores.personal_best()
self.assertEqual(highscores.scores, expected)

0 comments on commit b667f92

Please sign in to comment.