/about.md` doc and this exercises `introduction.md` doc._)
_**Concept Description Needs to Be Filled In Here/Written**_
_Some "extras" that we might want to include as notes in the concept description, or as links in `links.json`:_
-- Additional `Generator-iterator methods`, such as `generator.send()` and `generator.throw()`
+- Additional `Generator-iterator methods`, such as `generator.send()` and `generator.throw()`
- `generator expressions`
-- Asynchronous generator functions
+- Asynchronous generator functions
- `generators` used as coroutines
## Implementing
@@ -80,10 +75,8 @@ The general Python track concept exercise implantation guide can be found [here]
Tests should be written using `unittest.TestCase` and the test file named `generators_test.py`.
-Code in the `.meta/example.py` file should **only use syntax & concepts introduced in this exercise or one of its prerequisites.** Please do not use comprehensions, generator expressions, or other syntax not previously covered. Please also follow [PEP8](https://www.python.org/dev/peps/pep-0008/) guidelines.
+Code in the `.meta/example.py` file should **only use syntax & concepts introduced in this exercise or one of its prerequisites.** Please do not use comprehensions, generator expressions, or other syntax not previously covered. Please also follow [PEP8](https://www.python.org/dev/peps/pep-0008/) guidelines.
## Help
If you have any questions while implementing the exercise, please post the questions as comments in this issue, or contact one of the maintainers on our Slack channel.
-
-
diff --git a/exercises/concept/plane-tickets/.meta/exemplar.py b/exercises/concept/plane-tickets/.meta/exemplar.py
index fa8927d759a..9a3d7024076 100644
--- a/exercises/concept/plane-tickets/.meta/exemplar.py
+++ b/exercises/concept/plane-tickets/.meta/exemplar.py
@@ -1,15 +1,32 @@
-"""Plane Tickets Exercise"""
+"""Functions to automate Conda airlines ticketing system."""
import math
SEATS_IN_ROW = ['A', 'B', 'C', 'D']
-def generate_seats(amount):
+def generate_seat_letters(amount):
+ """Generate a series of seat letters for airline boarding.
+
+ :param amount: int - amount of seat letters to be generated.
+ :return: generator - generator that yields seat letters.
+
+ Seat letters are generated from A to D.
+ After D it should start again with A.
+
+ Example: A, B, C, D
+
+ """
+
+ for seat in range(amount):
+ yield SEATS_IN_ROW[seat % 4]
+
+
+def generate_seats(amount):
"""Generate a series of seat numbers for airline boarding.
- :param amount: Amount of seats to be generated. (int)
- :return: Generator that generates seat numbers. (generator)
+ :param amount: int - Amount of seats to be generated.
+ :return: generator - generator that yields seat numbers.
There should be no row 13
@@ -21,19 +38,17 @@ def generate_seats(amount):
"""
amount = amount + 4 if amount >= 13 else amount
-
+ letters = generate_seat_letters(amount)
for seat in range(amount):
row_number = math.ceil((seat+1) / 4)
if row_number != 13:
- seat_letter = SEATS_IN_ROW[seat % 4]
- yield f'{str(row_number)}{seat_letter}'
+ yield f'{str(row_number)}{next(letters)}'
def assign_seats(passengers):
+ """Assign seats to passengers.
- """Assign seats to passenger.
-
- :param passengers: A list of strings containing names of passengers. (list[str])
- :return: A dictionary type object containing the names of the passengers as keys and seat numbers as values.
+ :param passengers: list[str] - A list of strings containing names of passengers.
+ :return: dict - with the names of the passengers as keys and seat numbers as values.
Example output: {"Foo": "1A", "Bar": "1B"}
@@ -46,12 +61,11 @@ def assign_seats(passengers):
return output
def generate_codes(seat_numbers, flight_id):
-
"""Generate codes for a ticket.
- :param seat_numbers: A list of seat numbers. (list[str])
- :param flight_id: A string containing the flight identification. (str)
- :return: Generator that generates 12 character long strings. (generator[str])
+ :param seat_numbers: list[str] - list of seat numbers.
+ :param flight_id: str - string containing the flight identification.
+ :return: generator - generator that yields 12 character long strings.
"""
diff --git a/exercises/concept/plane-tickets/plane_tickets.py b/exercises/concept/plane-tickets/plane_tickets.py
index 44d685535b6..4399791b223 100644
--- a/exercises/concept/plane-tickets/plane_tickets.py
+++ b/exercises/concept/plane-tickets/plane_tickets.py
@@ -1,11 +1,26 @@
-"""Plane Tickets Exercise"""
+"""Functions to automate Conda airlines ticketing system."""
-def generate_seats(amount):
+def generate_seat_letters(amount):
+ """ Generate a series of seat letters for airline boarding.
+
+ :param amount: int - amount of seat letters to be generated.
+ :return: generator - generator that yields seat letters.
+
+ Seat letters are generated from A to D.
+ After D it should start again with A.
+
+ Example: A, B, C, D
+
+ """
+ pass
+
+
+def generate_seats(amount):
""" Generate a series of seat numbers for airline boarding.
- :param amount: Amount of seats to be generated. (int)
- :return: Generator that yields seat numbers.
+ :param amount: int - Amount of seats to be generated.
+ :return: generator - generator that yields seat numbers.
There should be no row 13
@@ -19,11 +34,10 @@ def generate_seats(amount):
pass
def assign_seats(passengers):
-
""" Assign seats to passengers.
- :param passengers: A list of strings containing names of passengers. (list[str])
- :return: A dictionary type object containing the names of the passengers as keys and seat numbers as values.
+ :param passengers: list[str] - A list of strings containing names of passengers.
+ :return: dict - with the names of the passengers as keys and seat numbers as values.
Example output: {"Foo": "1A", "Bar": "1B"}
@@ -32,11 +46,10 @@ def assign_seats(passengers):
pass
def generate_codes(seat_numbers, flight_id):
-
"""Generate codes for a ticket.
- :param seat_numbers: A list of seat numbers. (list[str])
- :param flight_id: A string containing the flight identification. (str)
- :return: Generator that generates 12 character long strings. (generator[str])
+ :param seat_numbers: list[str] - list of seat numbers.
+ :param flight_id: str - string containing the flight identification.
+ :return: generator - generator that yields 12 character long strings.
"""
diff --git a/exercises/concept/plane-tickets/plane_tickets_test.py b/exercises/concept/plane-tickets/plane_tickets_test.py
index f4255c43af6..1372e5cd2d7 100644
--- a/exercises/concept/plane-tickets/plane_tickets_test.py
+++ b/exercises/concept/plane-tickets/plane_tickets_test.py
@@ -3,6 +3,7 @@
import pytest
from plane_tickets import (
+ generate_seat_letters,
generate_seats,
assign_seats,
generate_codes
@@ -10,16 +11,31 @@
class PlaneTicketsTest(unittest.TestCase):
-
@pytest.mark.task(taskno=1)
def test_task1_is_generator(self): # * Tests if [Task 1] actually returns a generator.
input_var = 5
output_type = Generator
error_message = f"Expected: {str(output_type)} type, but got a different type."
- self.assertIsInstance(generate_seats(input_var), output_type, msg=error_message)
+ self.assertIsInstance(generate_seat_letters(input_var), output_type, msg=error_message)
@pytest.mark.task(taskno=1)
def test_task1_output(self):
+ input_vars = [1, 2, 3, 4, 5]
+ output = [["A"], ["A", "B"], ["A", "B", "C"], ["A", "B", "C", "D"], ["A", "B", "C", "D", "A"]]
+ for variant, (input_var, output) in enumerate(zip(input_vars, output), start=1):
+ error_message = f"Expected: {output}, but something went wrong while generating {input_var} seat(s)."
+ with self.subTest(f"variation #{variant}", input_data=input_var, output_data=output):
+ self.assertEqual(list(generate_seat_letters(input_var)), output, msg=error_message)
+
+ @pytest.mark.task(taskno=2)
+ def test_task2_is_generator(self): # * Tests if [Task 2] actually returns a generator.
+ input_var = 5
+ output_type = Generator
+ error_message = f"Expected: {str(output_type)} type, but got a different type."
+ self.assertIsInstance(generate_seats(input_var), output_type, msg=error_message)
+
+ @pytest.mark.task(taskno=2)
+ def test_task2_output(self):
input_vars = [1, 2, 3, 4, 5]
output = [["1A"], ["1A", "1B"], ["1A", "1B", "1C"], ["1A", "1B", "1C", "1D"], ["1A", "1B", "1C", "1D", "2A"]]
for variant, (input_var, output) in enumerate(zip(input_vars, output), start=1):
@@ -27,8 +43,8 @@ def test_task1_output(self):
with self.subTest(f"variation #{variant}", input_data=input_var, output_data=output):
self.assertEqual(list(generate_seats(input_var)), output, msg=error_message)
- @pytest.mark.task(taskno=1)
- def test_task1_skips_row_13(self):
+ @pytest.mark.task(taskno=2)
+ def test_task3_skips_row_13(self):
input_vars = [14 * 4]
output = [["1A", "1B", "1C", "1D", "2A", "2B", "2C", "2D",
"3A", "3B", "3C", "3D", "4A", "4B", "4C", "4D",
@@ -42,8 +58,8 @@ def test_task1_skips_row_13(self):
with self.subTest(f"variation #{variant}", input_data=input_var, output_data=output):
self.assertEqual(list(generate_seats(input_var)), output, msg=error_message)
- @pytest.mark.task(taskno=2)
- def test_task2(self):
+ @pytest.mark.task(taskno=3)
+ def test_task3(self):
input_vars = [["Passenger1", "Passenger2", "Passenger3", "Passenger4", "Passenger5"],
["TicketNo=5644", "TicketNo=2273", "TicketNo=493", "TicketNo=5411", "TicketNo=824"]]
output = [{"Passenger1": "1A", "Passenger2": "1B", "Passenger3": "1C", "Passenger4": "1D", "Passenger5": "2A"},
@@ -53,15 +69,15 @@ def test_task2(self):
with self.subTest(f"variation #{variant}", input_data=input_var, output_data=output):
self.assertEqual(assign_seats(input_var), output, msg=error_message)
- @pytest.mark.task(taskno=3)
- def test_task3_is_generator(self):
+ @pytest.mark.task(taskno=4)
+ def test_task4_is_generator(self):
input_var = ("11B", "HA80085")
output_type = Generator
error_message = f"Expected: {str(output_type)} type, but got a different type."
self.assertIsInstance(generate_codes(input_var[0], input_var[1]), output_type, msg=error_message)
- @pytest.mark.task(taskno=3)
- def test_task3(self):
+ @pytest.mark.task(taskno=4)
+ def test_task4(self):
input_vars = [(["12A", "38B", "69C", "102B"],"KL1022"),
(["22C", "88B", "33A", "44B"], "DL1002")]
output = [['12AKL1022000', '38BKL1022000', '69CKL1022000', '102BKL102200'],
diff --git a/exercises/practice/accumulate/.docs/instructions.md b/exercises/practice/accumulate/.docs/instructions.md
index 435e0b32469..c25a03fab18 100644
--- a/exercises/practice/accumulate/.docs/instructions.md
+++ b/exercises/practice/accumulate/.docs/instructions.md
@@ -1,9 +1,6 @@
# Instructions
-Implement the `accumulate` operation, which, given a collection and an
-operation to perform on each element of the collection, returns a new
-collection containing the result of applying that operation to each element of
-the input collection.
+Implement the `accumulate` operation, which, given a collection and an operation to perform on each element of the collection, returns a new collection containing the result of applying that operation to each element of the input collection.
Given the collection of numbers:
@@ -21,6 +18,5 @@ Check out the test suite to see the expected function signature.
## Restrictions
-Keep your hands off that collect/map/fmap/whatchamacallit functionality
-provided by your standard library!
+Keep your hands off that collect/map/fmap/whatchamacallit functionality provided by your standard library!
Solve this one yourself using other basic tools instead.
diff --git a/exercises/practice/accumulate/.meta/tests.toml b/exercises/practice/accumulate/.meta/tests.toml
new file mode 100644
index 00000000000..150ec2e896e
--- /dev/null
+++ b/exercises/practice/accumulate/.meta/tests.toml
@@ -0,0 +1,35 @@
+# 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.
+
+[64d97c14-36dd-44a8-9621-2cecebd6ed23]
+description = "accumulate empty"
+include = false
+
+[00008ed2-4651-4929-8c08-8b4dbd70872e]
+description = "accumulate squares"
+include = false
+
+[551016da-4396-4cae-b0ec-4c3a1a264125]
+description = "accumulate upcases"
+include = false
+
+[cdf95597-b6ec-4eac-a838-3480d13d0d05]
+description = "accumulate reversed strings"
+include = false
+
+[bee8e9b6-b16f-4cd2-be3b-ccf7457e50bb]
+description = "accumulate recursively"
+include = false
+
+[0b357334-4cad-49e1-a741-425202edfc7c]
+description = "accumulate recursively"
+include = false
+reimplements = "bee8e9b6-b16f-4cd2-be3b-ccf7457e50bb"
diff --git a/exercises/practice/acronym/.meta/template.j2 b/exercises/practice/acronym/.meta/template.j2
index 1373d724d31..3480ade6319 100644
--- a/exercises/practice/acronym/.meta/template.j2
+++ b/exercises/practice/acronym/.meta/template.j2
@@ -1,4 +1,8 @@
{%- import "generator_macros.j2" as macros with context -%}
+{{ macros.canonical_ref() }}
+
+{{ macros.header()}}
+
{% macro test_case(case) -%}
{%- set input = case["input"] -%}
def test_{{ case["description"] | to_snake }}(self):
@@ -7,10 +11,9 @@
"{{ case["expected"] }}"
)
{%- endmacro %}
-{{ macros.header()}}
+
class {{ exercise | camel_case }}Test(unittest.TestCase):
{% for case in cases %}
{{ test_case(case) }}
{% endfor %}
-{{ macros.footer() }}
diff --git a/exercises/practice/acronym/acronym_test.py b/exercises/practice/acronym/acronym_test.py
index c5fbbfa39eb..984deef60d2 100644
--- a/exercises/practice/acronym/acronym_test.py
+++ b/exercises/practice/acronym/acronym_test.py
@@ -1,11 +1,13 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/acronym/canonical-data.json
+# File last updated on 2023-07-20
+
import unittest
from acronym import (
abbreviate,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class AcronymTest(unittest.TestCase):
def test_basic(self):
@@ -39,7 +41,3 @@ def test_apostrophes(self):
def test_underscore_emphasis(self):
self.assertEqual(abbreviate("The Road _Not_ Taken"), "TRNT")
-
-
-if __name__ == "__main__":
- unittest.main()
diff --git a/exercises/practice/affine-cipher/.meta/template.j2 b/exercises/practice/affine-cipher/.meta/template.j2
index 2ccc2c7f863..2e92e2b4e59 100644
--- a/exercises/practice/affine-cipher/.meta/template.j2
+++ b/exercises/practice/affine-cipher/.meta/template.j2
@@ -1,4 +1,7 @@
{%- import "generator_macros.j2" as macros with context -%}
+{{ macros.canonical_ref() }}
+
+{{ macros.header()}}
{% macro test_supercase(supercase) %}
{% for case in supercase["cases"] -%}
@@ -25,8 +28,6 @@ def test_{{ case["description"] | to_snake }}(self):
{% endif -%}
{%- endmacro %}
-{{ macros.header() }}
-
class {{ exercise | camel_case }}Test(unittest.TestCase):
{% for supercase in cases -%}
{{ test_supercase(supercase) }}
diff --git a/exercises/practice/affine-cipher/affine_cipher_test.py b/exercises/practice/affine-cipher/affine_cipher_test.py
index fb9cd4a1081..f6d7c106c33 100644
--- a/exercises/practice/affine-cipher/affine_cipher_test.py
+++ b/exercises/practice/affine-cipher/affine_cipher_test.py
@@ -1,3 +1,7 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/affine-cipher/canonical-data.json
+# File last updated on 2023-07-20
+
import unittest
from affine_cipher import (
@@ -5,8 +9,6 @@
encode,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class AffineCipherTest(unittest.TestCase):
def test_encode_yes(self):
diff --git a/exercises/practice/all-your-base/.meta/template.j2 b/exercises/practice/all-your-base/.meta/template.j2
index 20684b546c3..682f9d9e996 100644
--- a/exercises/practice/all-your-base/.meta/template.j2
+++ b/exercises/practice/all-your-base/.meta/template.j2
@@ -1,4 +1,7 @@
{%- import "generator_macros.j2" as macros with context -%}
+{{ macros.canonical_ref() }}
+
+{{ macros.header()}}
{%- macro func_call(case) -%}
{{ case["property"] }}(
@@ -22,11 +25,8 @@
{%- endif %}
{% endmacro %}
-{{ macros.header() }}
-
class {{ exercise | camel_case }}Test(unittest.TestCase):
{% for case in cases -%}
{{ test_case(case) }}
{% endfor -%}
-{{ macros.footer() }}
diff --git a/exercises/practice/all-your-base/all_your_base_test.py b/exercises/practice/all-your-base/all_your_base_test.py
index 04cf27dbae2..32c0b7b924a 100644
--- a/exercises/practice/all-your-base/all_your_base_test.py
+++ b/exercises/practice/all-your-base/all_your_base_test.py
@@ -1,11 +1,13 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/all-your-base/canonical-data.json
+# File last updated on 2023-07-20
+
import unittest
from all_your_base import (
rebase,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class AllYourBaseTest(unittest.TestCase):
def test_single_bit_one_to_decimal(self):
@@ -101,11 +103,3 @@ def test_both_bases_are_negative(self):
rebase(-2, [1], -7)
self.assertEqual(type(err.exception), ValueError)
self.assertEqual(err.exception.args[0], "input base must be >= 2")
-
- # Utility functions
- def assertRaisesWithMessage(self, exception):
- return self.assertRaisesRegex(exception, r".+")
-
-
-if __name__ == "__main__":
- unittest.main()
diff --git a/exercises/practice/allergies/.meta/template.j2 b/exercises/practice/allergies/.meta/template.j2
index f39a9d54a4b..d0085deb8e0 100644
--- a/exercises/practice/allergies/.meta/template.j2
+++ b/exercises/practice/allergies/.meta/template.j2
@@ -1,4 +1,6 @@
{%- import "generator_macros.j2" as macros with context -%}
+{{ macros.canonical_ref() }}
+
{{ macros.header(imports=[ exercise | camel_case ]) }}
class {{ exercise | camel_case }}Test(unittest.TestCase):
@@ -27,5 +29,3 @@ class {{ exercise | camel_case }}Test(unittest.TestCase):
{% endfor %}
{% endfor %}
-
-{{ macros.footer() }}
diff --git a/exercises/practice/allergies/allergies_test.py b/exercises/practice/allergies/allergies_test.py
index 5b8d32c085d..8e10b9d59b6 100644
--- a/exercises/practice/allergies/allergies_test.py
+++ b/exercises/practice/allergies/allergies_test.py
@@ -1,11 +1,13 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/allergies/canonical-data.json
+# File last updated on 2023-07-20
+
import unittest
from allergies import (
Allergies,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class AllergiesTest(unittest.TestCase):
def test_eggs_not_allergic_to_anything(self):
@@ -183,7 +185,3 @@ def test_no_allergen_score_parts(self):
def test_no_allergen_score_parts_without_highest_valid_score(self):
self.assertEqual(Allergies(257).lst, ["eggs"])
-
-
-if __name__ == "__main__":
- unittest.main()
diff --git a/exercises/practice/alphametics/.meta/template.j2 b/exercises/practice/alphametics/.meta/template.j2
index 4841b41ee5a..e051fd81ac3 100644
--- a/exercises/practice/alphametics/.meta/template.j2
+++ b/exercises/practice/alphametics/.meta/template.j2
@@ -1,4 +1,6 @@
{%- import "generator_macros.j2" as macros with context -%}
+{{ macros.canonical_ref() }}
+
{{ macros.header() }}
class {{ exercise | camel_case }}Test(unittest.TestCase):
@@ -30,4 +32,3 @@ class {{ exercise | camel_case }}Test(unittest.TestCase):
{% endif %}
{% endfor %}
-{{ macros.footer()}}
diff --git a/exercises/practice/alphametics/alphametics_test.py b/exercises/practice/alphametics/alphametics_test.py
index c1f573391bc..6279b805c59 100644
--- a/exercises/practice/alphametics/alphametics_test.py
+++ b/exercises/practice/alphametics/alphametics_test.py
@@ -1,11 +1,13 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/alphametics/canonical-data.json
+# File last updated on 2023-07-20
+
import unittest
from alphametics import (
solve,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class AlphameticsTest(unittest.TestCase):
def test_puzzle_with_three_letters(self):
@@ -106,7 +108,3 @@ def test_puzzle_with_ten_letters_and_199_addends(self):
"T": 9,
},
)
-
-
-if __name__ == "__main__":
- unittest.main()
diff --git a/exercises/practice/anagram/.meta/template.j2 b/exercises/practice/anagram/.meta/template.j2
index 1f74aef5bc0..c402f530b45 100644
--- a/exercises/practice/anagram/.meta/template.j2
+++ b/exercises/practice/anagram/.meta/template.j2
@@ -1,4 +1,5 @@
{%- import "generator_macros.j2" as macros with context -%}
+{{ macros.canonical_ref() }}
{{ macros.header() }}
diff --git a/exercises/practice/anagram/anagram_test.py b/exercises/practice/anagram/anagram_test.py
index f06ad9fb53b..5b0e9c6c4d7 100644
--- a/exercises/practice/anagram/anagram_test.py
+++ b/exercises/practice/anagram/anagram_test.py
@@ -1,11 +1,13 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/anagram/canonical-data.json
+# File last updated on 2023-07-20
+
import unittest
from anagram import (
find_anagrams,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class AnagramTest(unittest.TestCase):
def test_no_matches(self):
diff --git a/exercises/practice/armstrong-numbers/.meta/template.j2 b/exercises/practice/armstrong-numbers/.meta/template.j2
index f6ac6e765ea..8f917dfffc0 100644
--- a/exercises/practice/armstrong-numbers/.meta/template.j2
+++ b/exercises/practice/armstrong-numbers/.meta/template.j2
@@ -1,4 +1,6 @@
{%- import "generator_macros.j2" as macros with context -%}
+{{ macros.canonical_ref() }}
+
{{ macros.header() }}
class {{ exercise | camel_case }}Test(unittest.TestCase):
@@ -9,6 +11,4 @@ class {{ exercise | camel_case }}Test(unittest.TestCase):
{{ case["expected"] }}
)
- {% endfor %}
-
-{{ macros.footer() }}
\ No newline at end of file
+ {% endfor %}
\ No newline at end of file
diff --git a/exercises/practice/armstrong-numbers/armstrong_numbers_test.py b/exercises/practice/armstrong-numbers/armstrong_numbers_test.py
index c3f6089e9c8..402476671db 100644
--- a/exercises/practice/armstrong-numbers/armstrong_numbers_test.py
+++ b/exercises/practice/armstrong-numbers/armstrong_numbers_test.py
@@ -1,11 +1,13 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/armstrong-numbers/canonical-data.json
+# File last updated on 2023-07-20
+
import unittest
from armstrong_numbers import (
is_armstrong_number,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class ArmstrongNumbersTest(unittest.TestCase):
def test_zero_is_an_armstrong_number(self):
@@ -34,7 +36,3 @@ def test_seven_digit_number_that_is_an_armstrong_number(self):
def test_seven_digit_number_that_is_not_an_armstrong_number(self):
self.assertIs(is_armstrong_number(9926314), False)
-
-
-if __name__ == "__main__":
- unittest.main()
diff --git a/exercises/practice/atbash-cipher/.meta/template.j2 b/exercises/practice/atbash-cipher/.meta/template.j2
index d3eb3d87621..39908eb4bc7 100644
--- a/exercises/practice/atbash-cipher/.meta/template.j2
+++ b/exercises/practice/atbash-cipher/.meta/template.j2
@@ -1,4 +1,6 @@
{%- import "generator_macros.j2" as macros with context -%}
+{{ macros.canonical_ref() }}
+
{{ macros.header() }}
class {{ exercise | camel_case }}Test(unittest.TestCase):
@@ -11,5 +13,3 @@ class {{ exercise | camel_case }}Test(unittest.TestCase):
{% endfor %}
{% endfor %}
-
-{{ macros.footer() }}
diff --git a/exercises/practice/atbash-cipher/atbash_cipher_test.py b/exercises/practice/atbash-cipher/atbash_cipher_test.py
index 98c1072afc7..f8103f81b9a 100644
--- a/exercises/practice/atbash-cipher/atbash_cipher_test.py
+++ b/exercises/practice/atbash-cipher/atbash_cipher_test.py
@@ -1,3 +1,7 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/atbash-cipher/canonical-data.json
+# File last updated on 2023-07-20
+
import unittest
from atbash_cipher import (
@@ -5,8 +9,6 @@
encode,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class AtbashCipherTest(unittest.TestCase):
def test_encode_yes(self):
@@ -61,7 +63,3 @@ def test_decode_with_no_spaces(self):
self.assertEqual(
decode("zmlyhgzxovrhlugvmzhgvkkrmthglmv"), "anobstacleisoftenasteppingstone"
)
-
-
-if __name__ == "__main__":
- unittest.main()
diff --git a/exercises/practice/bank-account/.meta/config.json b/exercises/practice/bank-account/.meta/config.json
index 8ab9aa0d888..51483ecb667 100644
--- a/exercises/practice/bank-account/.meta/config.json
+++ b/exercises/practice/bank-account/.meta/config.json
@@ -3,7 +3,9 @@
"contributors": [
"cmccandless",
"Dog",
- "tqa236"
+ "tqa236",
+ "bethanyg",
+ "meatball133"
],
"files": {
"solution": [
diff --git a/exercises/practice/bank-account/.meta/example.py b/exercises/practice/bank-account/.meta/example.py
index 21248fa9257..90ddf31c23b 100644
--- a/exercises/practice/bank-account/.meta/example.py
+++ b/exercises/practice/bank-account/.meta/example.py
@@ -4,7 +4,7 @@
class BankAccount:
def __init__(self):
self.is_open = False
- self.balance = 0
+ self.balance = None
self.lock = threading.Lock()
def get_balance(self):
diff --git a/exercises/practice/bank-account/.meta/template.j2 b/exercises/practice/bank-account/.meta/template.j2
new file mode 100644
index 00000000000..3372b2f7fdc
--- /dev/null
+++ b/exercises/practice/bank-account/.meta/template.j2
@@ -0,0 +1,53 @@
+{%- import "generator_macros.j2" as macros with context -%}
+{{ macros.canonical_ref() }}
+
+{{ macros.header(["BankAccount"]) }}
+{% macro test_case(case) -%}
+ def test_{{ case["description"] | to_snake }}(self):
+ account = BankAccount()
+ {%- set inputs = case["input"]["operations"] -%}
+ {%- if case["expected"]["error"] -%}
+ {%- set error_case = true -%}
+ {%- set error_msg = case["expected"]["error"] -%}
+ {%- set error_operation = inputs[-1]["operation"] -%}
+ {%- set final_value = inputs[-1]["amount"] -%}
+ {%- set inputs = inputs[:-1] -%}
+ {% endif %}
+ {%- for input in inputs -%}
+ {%- set operation = input["operation"] -%}
+ {%- set value = input["amount"] -%}
+ {%- set expected = case["expected"] %}
+ {%- if operation and value %}
+ account.{{ operation }}({{ value }})
+ {%- elif not value and operation %}
+ {%- if not error_case and operation == "balance" %}
+ self.assertEqual(account.get_balance(), {{ expected }})
+ {%- else %}
+ account.{{ operation }}()
+ {%- endif %}
+ {%- endif %}
+ {%- endfor %}
+ {%- if error_case %}
+ with self.assertRaises(ValueError) as err:
+ {%- if error_operation == "balance" %}
+ account.get_balance({{ final_value if final_value else "" }})
+ {%- else %}
+ account.{{ error_operation }}({{ final_value if final_value else "" }})
+ {%- endif %}
+ self.assertEqual(type(err.exception), ValueError)
+ self.assertEqual(err.exception.args[0], "{{ error_msg }}")
+ {%- endif %}
+{% endmacro %}
+
+
+class {{ exercise | camel_case }}Test(unittest.TestCase):
+ {% for case in cases -%}
+ {{ test_case(case) }}
+ {% endfor %}
+ {% if additional_cases | length -%}
+
+ # Additional tests for this track
+ {% for case in additional_cases -%}
+ {{ test_case(case) }}
+ {% endfor %}
+ {%- endif %}
diff --git a/exercises/practice/bank-account/.meta/tests.toml b/exercises/practice/bank-account/.meta/tests.toml
new file mode 100644
index 00000000000..1704a08c5ad
--- /dev/null
+++ b/exercises/practice/bank-account/.meta/tests.toml
@@ -0,0 +1,62 @@
+# 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.
+
+[983a1528-4ceb-45e5-8257-8ce01aceb5ed]
+description = "Newly opened account has zero balance"
+
+[e88d4ec3-c6bf-4752-8e59-5046c44e3ba7]
+description = "Single deposit"
+
+[3d9147d4-63f4-4844-8d2b-1fee2e9a2a0d]
+description = "Multiple deposits"
+
+[08f1af07-27ae-4b38-aa19-770bde558064]
+description = "Withdraw once"
+
+[6f6d242f-8c31-4ac6-8995-a90d42cad59f]
+description = "Withdraw twice"
+
+[45161c94-a094-4c77-9cec-998b70429bda]
+description = "Can do multiple operations sequentially"
+
+[f9facfaa-d824-486e-8381-48832c4bbffd]
+description = "Cannot check balance of closed account"
+
+[7a65ba52-e35c-4fd2-8159-bda2bde6e59c]
+description = "Cannot deposit into closed account"
+
+[a0a1835d-faae-4ad4-a6f3-1fcc2121380b]
+description = "Cannot deposit into unopened account"
+
+[570dfaa5-0532-4c1f-a7d3-0f65c3265608]
+description = "Cannot withdraw from closed account"
+
+[c396d233-1c49-4272-98dc-7f502dbb9470]
+description = "Cannot close an account that was not opened"
+
+[c06f534f-bdc2-4a02-a388-1063400684de]
+description = "Cannot open an already opened account"
+
+[0722d404-6116-4f92-ba3b-da7f88f1669c]
+description = "Reopened account does not retain balance"
+
+[ec42245f-9361-4341-8231-a22e8d19c52f]
+description = "Cannot withdraw more than deposited"
+
+[4f381ef8-10ef-4507-8e1d-0631ecc8ee72]
+description = "Cannot withdraw negative"
+
+[d45df9ea-1db0-47f3-b18c-d365db49d938]
+description = "Cannot deposit negative"
+
+[ba0c1e0b-0f00-416f-8097-a7dfc97871ff]
+description = "Can handle concurrent transactions"
+include = false
diff --git a/exercises/practice/bank-account/bank_account_test.py b/exercises/practice/bank-account/bank_account_test.py
index 3a36b3ccb42..c6e6b87020d 100644
--- a/exercises/practice/bank-account/bank_account_test.py
+++ b/exercises/practice/bank-account/bank_account_test.py
@@ -1,9 +1,12 @@
-import sys
-import threading
-import time
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/bank-account/canonical-data.json
+# File last updated on 2023-07-20
+
import unittest
-from bank_account import BankAccount
+from bank_account import (
+ BankAccount,
+)
class BankAccountTest(unittest.TestCase):
@@ -12,76 +15,86 @@ def test_newly_opened_account_has_zero_balance(self):
account.open()
self.assertEqual(account.get_balance(), 0)
- def test_can_deposit_money(self):
+ def test_single_deposit(self):
account = BankAccount()
account.open()
account.deposit(100)
self.assertEqual(account.get_balance(), 100)
- def test_can_deposit_money_sequentially(self):
+ def test_multiple_deposits(self):
account = BankAccount()
account.open()
account.deposit(100)
account.deposit(50)
-
self.assertEqual(account.get_balance(), 150)
- def test_can_withdraw_money(self):
+ def test_withdraw_once(self):
account = BankAccount()
account.open()
account.deposit(100)
- account.withdraw(50)
-
- self.assertEqual(account.get_balance(), 50)
+ account.withdraw(75)
+ self.assertEqual(account.get_balance(), 25)
- def test_can_withdraw_money_sequentially(self):
+ def test_withdraw_twice(self):
account = BankAccount()
account.open()
account.deposit(100)
- account.withdraw(20)
account.withdraw(80)
-
+ account.withdraw(20)
self.assertEqual(account.get_balance(), 0)
- def test_checking_balance_of_closed_account_throws_error(self):
+ def test_can_do_multiple_operations_sequentially(self):
account = BankAccount()
account.open()
- account.close()
+ account.deposit(100)
+ account.deposit(110)
+ account.withdraw(200)
+ account.deposit(60)
+ account.withdraw(50)
+ self.assertEqual(account.get_balance(), 20)
+ def test_cannot_check_balance_of_closed_account(self):
+ account = BankAccount()
+ account.open()
+ account.close()
with self.assertRaises(ValueError) as err:
account.get_balance()
self.assertEqual(type(err.exception), ValueError)
self.assertEqual(err.exception.args[0], "account not open")
- def test_deposit_into_closed_account(self):
+ def test_cannot_deposit_into_closed_account(self):
account = BankAccount()
account.open()
account.close()
-
with self.assertRaises(ValueError) as err:
account.deposit(50)
self.assertEqual(type(err.exception), ValueError)
self.assertEqual(err.exception.args[0], "account not open")
+ def test_cannot_deposit_into_unopened_account(self):
+ account = BankAccount()
+ with self.assertRaises(ValueError) as err:
+ account.deposit(50)
+ self.assertEqual(type(err.exception), ValueError)
+ self.assertEqual(err.exception.args[0], "account not open")
- def test_withdraw_from_closed_account(self):
+ def test_cannot_withdraw_from_closed_account(self):
account = BankAccount()
account.open()
account.close()
-
with self.assertRaises(ValueError) as err:
account.withdraw(50)
self.assertEqual(type(err.exception), ValueError)
self.assertEqual(err.exception.args[0], "account not open")
- def test_close_already_closed_account(self):
+ def test_cannot_close_an_account_that_was_not_opened(self):
account = BankAccount()
with self.assertRaises(ValueError) as err:
account.close()
self.assertEqual(type(err.exception), ValueError)
self.assertEqual(err.exception.args[0], "account not open")
- def test_open_already_opened_account(self):
+ def test_cannot_open_an_already_opened_account(self):
account = BankAccount()
account.open()
with self.assertRaises(ValueError) as err:
@@ -101,7 +114,6 @@ def test_cannot_withdraw_more_than_deposited(self):
account = BankAccount()
account.open()
account.deposit(25)
-
with self.assertRaises(ValueError) as err:
account.withdraw(50)
self.assertEqual(type(err.exception), ValueError)
@@ -111,7 +123,6 @@ def test_cannot_withdraw_negative(self):
account = BankAccount()
account.open()
account.deposit(100)
-
with self.assertRaises(ValueError) as err:
account.withdraw(-50)
self.assertEqual(type(err.exception), ValueError)
@@ -120,40 +131,7 @@ def test_cannot_withdraw_negative(self):
def test_cannot_deposit_negative(self):
account = BankAccount()
account.open()
-
with self.assertRaises(ValueError) as err:
account.deposit(-50)
self.assertEqual(type(err.exception), ValueError)
self.assertEqual(err.exception.args[0], "amount must be greater than 0")
-
- def test_can_handle_concurrent_transactions(self):
- account = BankAccount()
- account.open()
- account.deposit(1000)
-
- self.adjust_balance_concurrently(account)
-
- self.assertEqual(account.get_balance(), 1000)
-
- def adjust_balance_concurrently(self, account):
- def transact():
- account.deposit(5)
- time.sleep(0.001)
- account.withdraw(5)
-
- # Greatly improve the chance of an operation being interrupted
- # by thread switch, thus testing synchronization effectively
- try:
- sys.setswitchinterval(1e-12)
- except AttributeError:
- # For Python 2 compatibility
- sys.setcheckinterval(1)
-
- threads = [threading.Thread(target=transact) for _ in range(1000)]
- for thread in threads:
- thread.start()
- for thread in threads:
- thread.join()
-
-if __name__ == '__main__':
- unittest.main()
diff --git a/exercises/practice/beer-song/.meta/template.j2 b/exercises/practice/beer-song/.meta/template.j2
index 37e45402da9..1a2d6022879 100644
--- a/exercises/practice/beer-song/.meta/template.j2
+++ b/exercises/practice/beer-song/.meta/template.j2
@@ -1,4 +1,6 @@
{%- import "generator_macros.j2" as macros with context -%}
+{{ macros.canonical_ref() }}
+
{{ macros.header() }}
class {{ exercise | camel_case }}Test(unittest.TestCase):
@@ -18,6 +20,3 @@ class {{ exercise | camel_case }}Test(unittest.TestCase):
{% endfor %}
{% endfor %}
{% endfor %}
-
-
-{{ macros.footer() }}
diff --git a/exercises/practice/beer-song/beer_song_test.py b/exercises/practice/beer-song/beer_song_test.py
index 4952a374c89..9232ca1c9bc 100644
--- a/exercises/practice/beer-song/beer_song_test.py
+++ b/exercises/practice/beer-song/beer_song_test.py
@@ -1,11 +1,13 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/beer-song/canonical-data.json
+# File last updated on 2023-07-20
+
import unittest
from beer_song import (
recite,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class BeerSongTest(unittest.TestCase):
def test_first_generic_verse(self):
@@ -369,7 +371,3 @@ def test_all_verses(self):
"Go to the store and buy some more, 99 bottles of beer on the wall.",
]
self.assertEqual(recite(start=99, take=100), expected)
-
-
-if __name__ == "__main__":
- unittest.main()
diff --git a/exercises/practice/binary-search-tree/.meta/template.j2 b/exercises/practice/binary-search-tree/.meta/template.j2
index 518d5ceda03..37177a163c6 100644
--- a/exercises/practice/binary-search-tree/.meta/template.j2
+++ b/exercises/practice/binary-search-tree/.meta/template.j2
@@ -1,6 +1,9 @@
{%- import "generator_macros.j2" as macros with context -%}
+{{ macros.canonical_ref() }}
-{%- macro build_tree(tree_obj) -%}
+{{ macros.header (imports=["BinarySearchTree", "TreeNode"]) }}
+
+{% macro build_tree(tree_obj) %}
{%- if tree_obj is none -%}
None
{%- else -%}
@@ -25,8 +28,6 @@ TreeNode("{{ tree_obj["data"] }}",
self.{{ assertion }}(BinarySearchTree({{ tree_data }}).{{ prop | to_snake }}(),expected)
{%- endmacro -%}
-{{ macros.header (imports=["BinarySearchTree", "TreeNode"]) }}
-
class {{ exercise | camel_case }}Test(unittest.TestCase):
{%- for case in cases %}
{%- if "cases" in case %}
@@ -63,6 +64,3 @@ class {{ exercise | camel_case }}Test(unittest.TestCase):
pass
else:
raise AssertionError
-
-
-{{ macros.footer() }}
diff --git a/exercises/practice/binary-search-tree/binary_search_tree_test.py b/exercises/practice/binary-search-tree/binary_search_tree_test.py
index 23c1fea73b4..f44fe2d5f92 100644
--- a/exercises/practice/binary-search-tree/binary_search_tree_test.py
+++ b/exercises/practice/binary-search-tree/binary_search_tree_test.py
@@ -1,3 +1,7 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/binary-search-tree/canonical-data.json
+# File last updated on 2023-07-20
+
import unittest
from binary_search_tree import (
@@ -5,8 +9,6 @@
TreeNode,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class BinarySearchTreeTest(unittest.TestCase):
def test_data_is_retained(self):
@@ -82,7 +84,3 @@ def compare_tree(self, tree_one, tree_two):
pass
else:
raise AssertionError
-
-
-if __name__ == "__main__":
- unittest.main()
diff --git a/exercises/practice/binary-search/.docs/instructions.md b/exercises/practice/binary-search/.docs/instructions.md
index 175c4c4ba8f..aa1946cfb00 100644
--- a/exercises/practice/binary-search/.docs/instructions.md
+++ b/exercises/practice/binary-search/.docs/instructions.md
@@ -5,17 +5,18 @@ Your task is to implement a binary search algorithm.
A binary search algorithm finds an item in a list by repeatedly splitting it in half, only keeping the half which contains the item we're looking for.
It allows us to quickly narrow down the possible locations of our item until we find it, or until we've eliminated all possible locations.
-```exercism/caution
+~~~~exercism/caution
Binary search only works when a list has been sorted.
-```
+~~~~
The algorithm looks like this:
-- Divide the sorted list in half and compare the middle element with the item we're looking for.
-- If the middle element is our item, then we're done.
-- If the middle element is greater than our item, we can eliminate that number and all the numbers **after** it.
-- If the middle element is less than our item, we can eliminate that number and all the numbers **before** it.
-- Repeat the process on the part of the list that we kept.
+- Find the middle element of a *sorted* list and compare it with the item we're looking for.
+- If the middle element is our item, then we're done!
+- If the middle element is greater than our item, we can eliminate that element and all the elements **after** it.
+- If the middle element is less than our item, we can eliminate that element and all the elements **before** it.
+- If every element of the list has been eliminated then the item is not in the list.
+- Otherwise, repeat the process on the part of the list that has not been eliminated.
Here's an example:
diff --git a/exercises/practice/binary-search/.docs/introduction.md b/exercises/practice/binary-search/.docs/introduction.md
index 66c4b8a45cb..03496599e75 100644
--- a/exercises/practice/binary-search/.docs/introduction.md
+++ b/exercises/practice/binary-search/.docs/introduction.md
@@ -1,9 +1,13 @@
# Introduction
You have stumbled upon a group of mathematicians who are also singer-songwriters.
-They have written a song for each of their favorite numbers, and, as you can imagine, they have a lot of favorite numbers.
+They have written a song for each of their favorite numbers, and, as you can imagine, they have a lot of favorite numbers (like [0][zero] or [73][seventy-three] or [6174][kaprekars-constant]).
You are curious to hear the song for your favorite number, but with so many songs to wade through, finding the right song could take a while.
Fortunately, they have organized their songs in a playlist sorted by the title — which is simply the number that the song is about.
You realize that you can use a binary search algorithm to quickly find a song given the title.
+
+[zero]: https://en.wikipedia.org/wiki/0
+[seventy-three]: https://en.wikipedia.org/wiki/73_(number)
+[kaprekars-constant]: https://en.wikipedia.org/wiki/6174_(number)
diff --git a/exercises/practice/binary-search/.meta/template.j2 b/exercises/practice/binary-search/.meta/template.j2
index f29df253194..0856646f6a9 100644
--- a/exercises/practice/binary-search/.meta/template.j2
+++ b/exercises/practice/binary-search/.meta/template.j2
@@ -1,13 +1,15 @@
{%- import "generator_macros.j2" as macros with context -%}
+{{ macros.canonical_ref() }}
+
+{{ macros.header() }}
{%- macro test_call(case) %}
{{ case["property"] }}(
{{ case["input"]["array"] }},
{{ case["input"]["value"] }}
)
-{% endmacro -%}
+{% endmacro %}
-{{ macros.header() }}
class {{ exercise | camel_case }}Test(unittest.TestCase):
{% for case in cases -%}
diff --git a/exercises/practice/binary-search/binary_search_test.py b/exercises/practice/binary-search/binary_search_test.py
index 9f883d17678..a47a87f9654 100644
--- a/exercises/practice/binary-search/binary_search_test.py
+++ b/exercises/practice/binary-search/binary_search_test.py
@@ -1,11 +1,13 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/binary-search/canonical-data.json
+# File last updated on 2023-07-20
+
import unittest
from binary_search import (
find,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class BinarySearchTest(unittest.TestCase):
def test_finds_a_value_in_an_array_with_one_element(self):
diff --git a/exercises/practice/binary/.docs/instructions.md b/exercises/practice/binary/.docs/instructions.md
index 3cfde215fc9..046fd3e0998 100644
--- a/exercises/practice/binary/.docs/instructions.md
+++ b/exercises/practice/binary/.docs/instructions.md
@@ -2,9 +2,9 @@
Convert a binary number, represented as a string (e.g. '101010'), to its decimal equivalent using first principles.
-Implement binary to decimal conversion. Given a binary input
-string, your program should produce a decimal output. The
-program should handle invalid inputs.
+Implement binary to decimal conversion.
+Given a binary input string, your program should produce a decimal output.
+The program should handle invalid inputs.
## Note
@@ -15,8 +15,7 @@ program should handle invalid inputs.
Decimal is a base-10 system.
-A number 23 in base 10 notation can be understood
-as a linear combination of powers of 10:
+A number 23 in base 10 notation can be understood as a linear combination of powers of 10:
- The rightmost digit gets multiplied by 10^0 = 1
- The next number gets multiplied by 10^1 = 10
diff --git a/exercises/practice/binary/.meta/config.json b/exercises/practice/binary/.meta/config.json
index 7170a4ab191..b9f5b07508a 100644
--- a/exercises/practice/binary/.meta/config.json
+++ b/exercises/practice/binary/.meta/config.json
@@ -26,5 +26,5 @@
]
},
"source": "All of Computer Science",
- "source_url": "http://www.wolframalpha.com/input/?i=binary&a=*C.binary-_*MathWorld-"
+ "source_url": "https://www.wolframalpha.com/examples/mathematics/numbers/base-conversions"
}
diff --git a/exercises/practice/bob/.meta/template.j2 b/exercises/practice/bob/.meta/template.j2
index ce22d1849cf..912f7e31bb0 100644
--- a/exercises/practice/bob/.meta/template.j2
+++ b/exercises/practice/bob/.meta/template.j2
@@ -1,6 +1,9 @@
{%- import "generator_macros.j2" as macros with context -%}
+{{ macros.canonical_ref() }}
+
{{ macros.header() }}
+
class {{ exercise | camel_case }}Test(unittest.TestCase):
{% for case in cases %}
def test_{{ case["description"] | to_snake }}(self):
@@ -9,5 +12,3 @@ class {{ exercise | camel_case }}Test(unittest.TestCase):
{%- set expected = case["expected"] %}
self.assertEqual({{case["property"]}}("{{argument}}"), "{{expected}}")
{% endfor %}
-
-{{ macros.footer() }}
\ No newline at end of file
diff --git a/exercises/practice/bob/bob_test.py b/exercises/practice/bob/bob_test.py
index 40081b045f1..faba5f9612e 100644
--- a/exercises/practice/bob/bob_test.py
+++ b/exercises/practice/bob/bob_test.py
@@ -1,11 +1,13 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/bob/canonical-data.json
+# File last updated on 2023-07-20
+
import unittest
from bob import (
response,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class BobTest(unittest.TestCase):
def test_stating_something(self):
@@ -98,7 +100,3 @@ def test_non_question_ending_with_whitespace(self):
self.assertEqual(
response("This is a statement ending with whitespace "), "Whatever."
)
-
-
-if __name__ == "__main__":
- unittest.main()
diff --git a/exercises/practice/book-store/.docs/instructions.md b/exercises/practice/book-store/.docs/instructions.md
index 341ad01fbd2..906eb587619 100644
--- a/exercises/practice/book-store/.docs/instructions.md
+++ b/exercises/practice/book-store/.docs/instructions.md
@@ -12,9 +12,9 @@ If you buy 4 different books, you get a 20% discount.
If you buy all 5, you get a 25% discount.
-Note: that if you buy four books, of which 3 are different titles, you get a 10% discount on the 3 that form part of a set, but the fourth book still costs $8.
+Note that if you buy four books, of which 3 are different titles, you get a 10% discount on the 3 that form part of a set, but the fourth book still costs $8.
-Your mission is to write a piece of code to calculate the price of any conceivable shopping basket (containing only books of the same series), giving as big a discount as possible.
+Your mission is to write code to calculate the price of any conceivable shopping basket (containing only books of the same series), giving as big a discount as possible.
For example, how much does this basket of books cost?
@@ -26,36 +26,36 @@ For example, how much does this basket of books cost?
One way of grouping these 8 books is:
-- 1 group of 5 --> 25% discount (1st,2nd,3rd,4th,5th)
-- +1 group of 3 --> 10% discount (1st,2nd,3rd)
+- 1 group of 5 (1st, 2nd,3rd, 4th, 5th)
+- 1 group of 3 (1st, 2nd, 3rd)
This would give a total of:
- 5 books at a 25% discount
-- +3 books at a 10% discount
+- 3 books at a 10% discount
Resulting in:
-- 5 × (8 - 2.00) = 5 × 6.00 = $30.00
-- +3 × (8 - 0.80) = 3 × 7.20 = $21.60
+- 5 × (100% - 25%) * $8 = 5 × $6.00 = $30.00, plus
+- 3 × (100% - 10%) * $8 = 3 × $7.20 = $21.60
-For a total of $51.60
+Which equals $51.60.
However, a different way to group these 8 books is:
-- 1 group of 4 books --> 20% discount (1st,2nd,3rd,4th)
-- +1 group of 4 books --> 20% discount (1st,2nd,3rd,5th)
+- 1 group of 4 books (1st, 2nd, 3rd, 4th)
+- 1 group of 4 books (1st, 2nd, 3rd, 5th)
This would give a total of:
- 4 books at a 20% discount
-- +4 books at a 20% discount
+- 4 books at a 20% discount
Resulting in:
-- 4 × (8 - 1.60) = 4 × 6.40 = $25.60
-- +4 × (8 - 1.60) = 4 × 6.40 = $25.60
+- 4 × (100% - 20%) * $8 = 4 × $6.40 = $25.60, plus
+- 4 × (100% - 20%) * $8 = 4 × $6.40 = $25.60
-For a total of $51.20
+Which equals $51.20.
And $51.20 is the price with the biggest discount.
diff --git a/exercises/practice/book-store/.meta/template.j2 b/exercises/practice/book-store/.meta/template.j2
index 6d3a79e8ff3..9e17ab02ee5 100644
--- a/exercises/practice/book-store/.meta/template.j2
+++ b/exercises/practice/book-store/.meta/template.j2
@@ -1,11 +1,14 @@
{%- import "generator_macros.j2" as macros with context -%}
+{{ macros.canonical_ref() }}
+
+{{ macros.header() }}
+
{% macro test_case(case) -%}
{%- set input = case["input"] -%}
def test_{{ case["description"] | to_snake }}(self):
basket = {{ input["basket"] }}
self.assertEqual({{ case["property"] }}(basket), {{ case["expected"] }})
{%- endmacro %}
-{{ macros.header() }}
class {{ exercise | camel_case }}Test(unittest.TestCase):
{% for case in cases %}
@@ -20,5 +23,3 @@ class {{ exercise | camel_case }}Test(unittest.TestCase):
{{ test_case(case) }}
{% endfor %}
{%- endif %}
-
-{{ macros.footer() }}
\ No newline at end of file
diff --git a/exercises/practice/book-store/book_store_test.py b/exercises/practice/book-store/book_store_test.py
index 50f38bc5878..87b0051faa2 100644
--- a/exercises/practice/book-store/book_store_test.py
+++ b/exercises/practice/book-store/book_store_test.py
@@ -1,11 +1,13 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/book-store/canonical-data.json
+# File last updated on 2023-07-20
+
import unittest
from book_store import (
total,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class BookStoreTest(unittest.TestCase):
def test_only_a_single_book(self):
@@ -95,7 +97,3 @@ def test_two_groups_of_four_and_a_group_of_five(self):
def test_shuffled_book_order(self):
basket = [1, 2, 3, 4, 5, 1, 2, 3, 4, 5, 1, 2, 3]
self.assertEqual(total(basket), 8120)
-
-
-if __name__ == "__main__":
- unittest.main()
diff --git a/exercises/practice/bottle-song/.meta/template.j2 b/exercises/practice/bottle-song/.meta/template.j2
index 37e45402da9..1a2d6022879 100644
--- a/exercises/practice/bottle-song/.meta/template.j2
+++ b/exercises/practice/bottle-song/.meta/template.j2
@@ -1,4 +1,6 @@
{%- import "generator_macros.j2" as macros with context -%}
+{{ macros.canonical_ref() }}
+
{{ macros.header() }}
class {{ exercise | camel_case }}Test(unittest.TestCase):
@@ -18,6 +20,3 @@ class {{ exercise | camel_case }}Test(unittest.TestCase):
{% endfor %}
{% endfor %}
{% endfor %}
-
-
-{{ macros.footer() }}
diff --git a/exercises/practice/bottle-song/bottle_song_test.py b/exercises/practice/bottle-song/bottle_song_test.py
index 89877dc4947..998721d4bfe 100644
--- a/exercises/practice/bottle-song/bottle_song_test.py
+++ b/exercises/practice/bottle-song/bottle_song_test.py
@@ -1,11 +1,13 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/bottle-song/canonical-data.json
+# File last updated on 2023-07-20
+
import unittest
from bottle_song import (
recite,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class BottleSongTest(unittest.TestCase):
def test_first_generic_verse(self):
@@ -130,7 +132,3 @@ def test_all_verses(self):
"There'll be no green bottles hanging on the wall.",
]
self.assertEqual(recite(start=10, take=10), expected)
-
-
-if __name__ == "__main__":
- unittest.main()
diff --git a/exercises/practice/bowling/.docs/instructions.md b/exercises/practice/bowling/.docs/instructions.md
index 48a2fedcf42..ddce7ee4895 100644
--- a/exercises/practice/bowling/.docs/instructions.md
+++ b/exercises/practice/bowling/.docs/instructions.md
@@ -36,7 +36,7 @@ Frame 3 is (9 + 0) = 9
This means the current running total is 48.
The tenth frame in the game is a special case.
-If someone throws a strike or a spare then they get a fill ball.
+If someone throws a spare or a strike then they get one or two fill balls respectively.
Fill balls exist to calculate the total of the 10th frame.
Scoring a strike or spare on the fill ball does not give the player more fill balls.
The total value of the 10th frame is the total number of pins knocked down.
diff --git a/exercises/practice/bowling/.meta/template.j2 b/exercises/practice/bowling/.meta/template.j2
index 8234dd1c5a4..2761a8de840 100644
--- a/exercises/practice/bowling/.meta/template.j2
+++ b/exercises/practice/bowling/.meta/template.j2
@@ -1,4 +1,8 @@
{%- import "generator_macros.j2" as macros with context -%}
+{{ macros.canonical_ref() }}
+
+{{ macros.header(["BowlingGame"]) }}
+
{% macro test_case(case) -%}
{%- set input = case["input"] -%}
def test_{{ case["description"] | to_snake }}(self):
@@ -16,7 +20,6 @@
self.assertEqual(game.score(), {{ case["expected"] }})
{% endif %}
{%- endmacro %}
-{{ macros.header(["BowlingGame"]) }}
class {{ exercise | camel_case }}Test(unittest.TestCase):
def roll_new_game(self, rolls):
@@ -29,5 +32,4 @@ class {{ exercise | camel_case }}Test(unittest.TestCase):
{{ test_case(case) }}
{% endfor %}
-
-{{ macros.footer() }}
+{{ macros.utility() }}
diff --git a/exercises/practice/bowling/bowling_test.py b/exercises/practice/bowling/bowling_test.py
index 89d0a45f0bc..45d6b874835 100644
--- a/exercises/practice/bowling/bowling_test.py
+++ b/exercises/practice/bowling/bowling_test.py
@@ -1,11 +1,13 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/bowling/canonical-data.json
+# File last updated on 2023-07-21
+
import unittest
from bowling import (
BowlingGame,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class BowlingTest(unittest.TestCase):
def roll_new_game(self, rolls):
@@ -209,7 +211,3 @@ def test_cannot_roll_after_bonus_rolls_for_strike(self):
# Utility functions
def assertRaisesWithMessage(self, exception):
return self.assertRaisesRegex(exception, r".+")
-
-
-if __name__ == "__main__":
- unittest.main()
diff --git a/exercises/practice/change/.meta/template.j2 b/exercises/practice/change/.meta/template.j2
index 72e4382dcb8..846a9652856 100644
--- a/exercises/practice/change/.meta/template.j2
+++ b/exercises/practice/change/.meta/template.j2
@@ -1,5 +1,7 @@
{%- import "generator_macros.j2" as macros with context -%}
-{{ macros.header() }}
+{{ macros.canonical_ref() }}
+
+{{ macros.header()}}
class {{ exercise | camel_case }}Test(unittest.TestCase):
{% for case in cases -%}
diff --git a/exercises/practice/change/change_test.py b/exercises/practice/change/change_test.py
index 6b335174ef3..f8699e2f6db 100644
--- a/exercises/practice/change/change_test.py
+++ b/exercises/practice/change/change_test.py
@@ -1,11 +1,13 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/change/canonical-data.json
+# File last updated on 2023-07-20
+
import unittest
from change import (
find_fewest_coins,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class ChangeTest(unittest.TestCase):
def test_change_for_1_cent(self):
diff --git a/exercises/practice/circular-buffer/.meta/example.py b/exercises/practice/circular-buffer/.meta/example.py
index 8438b9839fc..538cc7bc5e2 100644
--- a/exercises/practice/circular-buffer/.meta/example.py
+++ b/exercises/practice/circular-buffer/.meta/example.py
@@ -25,7 +25,7 @@ def __init__(self, capacity):
self.read_point = 0
self.write_point = 0
- # (protected) helper method to support python 2/3
+ # (protected) helper method
def _update_buffer(self, data):
try:
self.buffer[self.write_point] = data
diff --git a/exercises/practice/circular-buffer/.meta/template.j2 b/exercises/practice/circular-buffer/.meta/template.j2
index 259d953949b..a7aea897f64 100644
--- a/exercises/practice/circular-buffer/.meta/template.j2
+++ b/exercises/practice/circular-buffer/.meta/template.j2
@@ -1,4 +1,8 @@
{%- import "generator_macros.j2" as macros with context -%}
+{{ macros.canonical_ref() }}
+
+{{ macros.header(["CircularBuffer","BufferEmptyException", "BufferFullException"]) }}
+
{% macro call_op(op) -%}
buf.{{ op["operation"] }}(
{% if "item" in op -%}
@@ -6,7 +10,7 @@ buf.{{ op["operation"] }}(
{%- endif -%}
)
{%- endmacro -%}
-{{ macros.header(["CircularBuffer","BufferEmptyException", "BufferFullException"]) }}
+
class {{ exercise | camel_case }}Test(unittest.TestCase):
{% for case in cases %}
diff --git a/exercises/practice/circular-buffer/circular_buffer_test.py b/exercises/practice/circular-buffer/circular_buffer_test.py
index 403ee1b5ff6..eb0663cf503 100644
--- a/exercises/practice/circular-buffer/circular_buffer_test.py
+++ b/exercises/practice/circular-buffer/circular_buffer_test.py
@@ -1,3 +1,7 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/circular-buffer/canonical-data.json
+# File last updated on 2023-07-20
+
import unittest
from circular_buffer import (
@@ -6,8 +10,6 @@
BufferFullException,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class CircularBufferTest(unittest.TestCase):
def test_reading_empty_buffer_should_fail(self):
diff --git a/exercises/practice/clock/.meta/template.j2 b/exercises/practice/clock/.meta/template.j2
index f786b2f1c88..872dce0a42b 100644
--- a/exercises/practice/clock/.meta/template.j2
+++ b/exercises/practice/clock/.meta/template.j2
@@ -1,8 +1,11 @@
{%- import "generator_macros.j2" as macros with context -%}
+{{ macros.canonical_ref() }}
+
+{{ macros.header(["Clock"])}}
+
{%- macro clock(obj) -%}
Clock({{ obj["hour"] }}, {{ obj["minute"] }})
{%- endmacro -%}
-{{ macros.header(["Clock"])}}
{% set cases = additional_cases + cases %}
@@ -29,4 +32,3 @@ class {{ exercise | camel_case }}Test(unittest.TestCase):
{% endfor %}
{%- endfor %}
-{{ macros.footer() }}
diff --git a/exercises/practice/clock/clock_test.py b/exercises/practice/clock/clock_test.py
index fe06336676b..6fde8e83e7e 100644
--- a/exercises/practice/clock/clock_test.py
+++ b/exercises/practice/clock/clock_test.py
@@ -1,11 +1,13 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/clock/canonical-data.json
+# File last updated on 2023-07-20
+
import unittest
from clock import (
Clock,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class ClockTest(unittest.TestCase):
# Create A String Representation
@@ -177,7 +179,3 @@ def test_clocks_with_negative_hours_and_minutes_that_wrap(self):
def test_full_clock_and_zeroed_clock(self):
self.assertEqual(Clock(24, 0), Clock(0, 0))
-
-
-if __name__ == "__main__":
- unittest.main()
diff --git a/exercises/practice/collatz-conjecture/.meta/template.j2 b/exercises/practice/collatz-conjecture/.meta/template.j2
index 4dcbae8550b..988f4a4ed98 100644
--- a/exercises/practice/collatz-conjecture/.meta/template.j2
+++ b/exercises/practice/collatz-conjecture/.meta/template.j2
@@ -1,4 +1,8 @@
{%- import "generator_macros.j2" as macros with context -%}
+{{ macros.canonical_ref() }}
+
+{{ macros.header()}}
+
{% macro test_case(case) -%}
def test_{{ case["description"] | to_snake }}(self):
{% set expected = case["expected"] -%}
@@ -15,7 +19,6 @@
)
{% endif %}
{%- endmacro %}
-{{ macros.header() }}
class {{ exercise | camel_case }}Test(unittest.TestCase):
{% for case in cases -%}
diff --git a/exercises/practice/collatz-conjecture/collatz_conjecture_test.py b/exercises/practice/collatz-conjecture/collatz_conjecture_test.py
index b9c6df93c82..306e3db7e7c 100644
--- a/exercises/practice/collatz-conjecture/collatz_conjecture_test.py
+++ b/exercises/practice/collatz-conjecture/collatz_conjecture_test.py
@@ -1,11 +1,13 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/collatz-conjecture/canonical-data.json
+# File last updated on 2023-07-20
+
import unittest
from collatz_conjecture import (
steps,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class CollatzConjectureTest(unittest.TestCase):
def test_zero_steps_for_one(self):
diff --git a/exercises/practice/complex-numbers/.meta/template.j2 b/exercises/practice/complex-numbers/.meta/template.j2
index 86b0d71d849..7c3fb7d2dd8 100644
--- a/exercises/practice/complex-numbers/.meta/template.j2
+++ b/exercises/practice/complex-numbers/.meta/template.j2
@@ -1,7 +1,6 @@
-import math
+{% extends "complexnumbers_template.j2" %}
-{% extends "master_template.j2" -%}
-{%- set imports = ["ComplexNumber"] -%}
+{% set imports = ["ComplexNumber"] %}
{%- macro translate_math(item) -%}
{{ item | replace("pi", "math.pi") | replace("e", "math.e") | replace("ln", "math.log") }}
diff --git a/exercises/practice/complex-numbers/complex_numbers_test.py b/exercises/practice/complex-numbers/complex_numbers_test.py
index 2eca7849697..3ebdcfe1082 100644
--- a/exercises/practice/complex-numbers/complex_numbers_test.py
+++ b/exercises/practice/complex-numbers/complex_numbers_test.py
@@ -1,13 +1,14 @@
-import math
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/complex-numbers/canonical-data.json
+# File last updated on 2023-07-19
+import math
import unittest
from complex_numbers import (
ComplexNumber,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class ComplexNumbersTest(unittest.TestCase):
@@ -189,7 +190,3 @@ def test_inequality_of_real_part(self):
def test_inequality_of_imaginary_part(self):
self.assertNotEqual(ComplexNumber(1, 2), ComplexNumber(1, 1))
-
-
-if __name__ == "__main__":
- unittest.main()
diff --git a/exercises/practice/connect/connect_test.py b/exercises/practice/connect/connect_test.py
index 17c786c8652..e7303d35131 100644
--- a/exercises/practice/connect/connect_test.py
+++ b/exercises/practice/connect/connect_test.py
@@ -1,11 +1,13 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/connect/canonical-data.json
+# File last updated on 2023-07-19
+
import unittest
from connect import (
ConnectGame,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class ConnectTest(unittest.TestCase):
def test_an_empty_board_has_no_winner(self):
@@ -108,7 +110,3 @@ def test_x_wins_using_a_spiral_path(self):
)
winner = game.get_winner()
self.assertEqual(winner, "X")
-
-
-if __name__ == "__main__":
- unittest.main()
diff --git a/exercises/practice/crypto-square/.meta/template.j2 b/exercises/practice/crypto-square/.meta/template.j2
index 5568ca09132..f968f0c7477 100644
--- a/exercises/practice/crypto-square/.meta/template.j2
+++ b/exercises/practice/crypto-square/.meta/template.j2
@@ -1,4 +1,6 @@
{%- import "generator_macros.j2" as macros with context -%}
+{{ macros.canonical_ref() }}
+
{{ macros.header(['cipher_text']) }}
class {{ exercise | camel_case }}Test(unittest.TestCase):
@@ -9,5 +11,3 @@ class {{ exercise | camel_case }}Test(unittest.TestCase):
self.assertEqual(cipher_text(value), expected)
{% endfor %}
-
-{{ macros.footer() }}
\ No newline at end of file
diff --git a/exercises/practice/crypto-square/crypto_square_test.py b/exercises/practice/crypto-square/crypto_square_test.py
index 3715400ca3d..97630a67501 100644
--- a/exercises/practice/crypto-square/crypto_square_test.py
+++ b/exercises/practice/crypto-square/crypto_square_test.py
@@ -1,11 +1,13 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/crypto-square/canonical-data.json
+# File last updated on 2023-07-19
+
import unittest
from crypto_square import (
cipher_text,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class CryptoSquareTest(unittest.TestCase):
def test_empty_plaintext_results_in_an_empty_ciphertext(self):
@@ -51,7 +53,3 @@ def test_54_character_plaintext_results_in_7_chunks_the_last_two_with_trailing_s
value = "If man was meant to stay on the ground, god would have given us roots."
expected = "imtgdvs fearwer mayoogo anouuio ntnnlvt wttddes aohghn sseoau "
self.assertEqual(cipher_text(value), expected)
-
-
-if __name__ == "__main__":
- unittest.main()
diff --git a/exercises/practice/custom-set/.meta/template.j2 b/exercises/practice/custom-set/.meta/template.j2
index 13412265944..e7a4ee7d379 100644
--- a/exercises/practice/custom-set/.meta/template.j2
+++ b/exercises/practice/custom-set/.meta/template.j2
@@ -1,4 +1,6 @@
{%- import "generator_macros.j2" as macros with context -%}
+{{ macros.canonical_ref() }}
+
{% set class_name = exercise | camel_case -%}
{{ macros.header([class_name]) }}
@@ -44,5 +46,4 @@ class {{ class_name }}Test(unittest.TestCase):
{% endif %}
{% endfor %}
{% endfor %}
-
-{{ macros.footer() }}
+
\ No newline at end of file
diff --git a/exercises/practice/custom-set/custom_set_test.py b/exercises/practice/custom-set/custom_set_test.py
index e5e3ffd3bc0..9ee2bd19679 100644
--- a/exercises/practice/custom-set/custom_set_test.py
+++ b/exercises/practice/custom-set/custom_set_test.py
@@ -1,11 +1,13 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/custom-set/canonical-data.json
+# File last updated on 2023-07-19
+
import unittest
from custom_set import (
CustomSet,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class CustomSetTest(unittest.TestCase):
def test_sets_with_no_elements_are_empty(self):
@@ -212,7 +214,3 @@ def test_union_of_non_empty_sets_contains_all_unique_elements(self):
set2 = CustomSet([2, 3])
expected = CustomSet([3, 2, 1])
self.assertEqual(set1 + set2, expected)
-
-
-if __name__ == "__main__":
- unittest.main()
diff --git a/exercises/practice/darts/.docs/instructions.md b/exercises/practice/darts/.docs/instructions.md
index 7af7428a06c..70f0e53da7c 100644
--- a/exercises/practice/darts/.docs/instructions.md
+++ b/exercises/practice/darts/.docs/instructions.md
@@ -12,7 +12,7 @@ In our particular instance of the game, the target rewards 4 different amounts o
- If the dart lands in the inner circle of the target, player earns 10 points.
The outer circle has a radius of 10 units (this is equivalent to the total radius for the entire target), the middle circle a radius of 5 units, and the inner circle a radius of 1.
-Of course, they are all centered at the same point (that is, the circles are [concentric][] defined by the coordinates (0, 0).
+Of course, they are all centered at the same point — that is, the circles are [concentric][] defined by the coordinates (0, 0).
Write a function that given a point in the target (defined by its [Cartesian coordinates][cartesian-coordinates] `x` and `y`, where `x` and `y` are [real][real-numbers]), returns the correct amount earned by a dart landing at that point.
diff --git a/exercises/practice/darts/.meta/template.j2 b/exercises/practice/darts/.meta/template.j2
index 09c0361b2fc..e08c6d83c53 100644
--- a/exercises/practice/darts/.meta/template.j2
+++ b/exercises/practice/darts/.meta/template.j2
@@ -1,10 +1,10 @@
{%- import "generator_macros.j2" as macros with context -%}
-{{ macros.header() }}
+{{ macros.canonical_ref() }}
+
+{{ macros.header()}}
class {{ exercise | camel_case }}Test(unittest.TestCase):
{% for case in cases -%}
def test_{{ case["description"] | to_snake }}(self):
self.assertEqual({{ case["property"] }}({{ case["input"]["x"] }}, {{ case["input"]["y"] }}), {{ case["expected"] }})
{% endfor %}
-
-{{ macros.footer() }}
diff --git a/exercises/practice/darts/darts_test.py b/exercises/practice/darts/darts_test.py
index e830199c9c1..5e167046177 100644
--- a/exercises/practice/darts/darts_test.py
+++ b/exercises/practice/darts/darts_test.py
@@ -1,11 +1,13 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/darts/canonical-data.json
+# File last updated on 2023-07-19
+
import unittest
from darts import (
score,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class DartsTest(unittest.TestCase):
def test_missed_target(self):
@@ -46,7 +48,3 @@ def test_just_outside_the_outer_circle(self):
def test_asymmetric_position_between_the_inner_and_middle_circles(self):
self.assertEqual(score(0.5, -4), 5)
-
-
-if __name__ == "__main__":
- unittest.main()
diff --git a/exercises/practice/diamond/.meta/template.j2 b/exercises/practice/diamond/.meta/template.j2
index e9357cc7ac1..0175388cc32 100644
--- a/exercises/practice/diamond/.meta/template.j2
+++ b/exercises/practice/diamond/.meta/template.j2
@@ -1,5 +1,7 @@
{%- import "generator_macros.j2" as macros with context -%}
-{{ macros.header() }}
+{{ macros.canonical_ref() }}
+
+{{ macros.header()}}
class {{ exercise | camel_case }}Test(unittest.TestCase):
{% for case in cases %}
@@ -9,5 +11,3 @@ class {{ exercise | camel_case }}Test(unittest.TestCase):
result = {{expected}}
self.assertEqual({{case["property"]}}("{{letter}}"), result)
{% endfor %}
-
-{{ macros.footer() }}
\ No newline at end of file
diff --git a/exercises/practice/diamond/diamond_test.py b/exercises/practice/diamond/diamond_test.py
index f0e60c862d4..6a3a2295098 100644
--- a/exercises/practice/diamond/diamond_test.py
+++ b/exercises/practice/diamond/diamond_test.py
@@ -1,11 +1,13 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/diamond/canonical-data.json
+# File last updated on 2023-07-19
+
import unittest
from diamond import (
rows,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class DiamondTest(unittest.TestCase):
def test_degenerate_case_with_a_single_a_row(self):
@@ -87,7 +89,3 @@ def test_largest_possible_diamond(self):
" A ",
]
self.assertEqual(rows("Z"), result)
-
-
-if __name__ == "__main__":
- unittest.main()
diff --git a/exercises/practice/difference-of-squares/.meta/template.j2 b/exercises/practice/difference-of-squares/.meta/template.j2
index 62b8d8d2187..db8cc69e9ca 100644
--- a/exercises/practice/difference-of-squares/.meta/template.j2
+++ b/exercises/practice/difference-of-squares/.meta/template.j2
@@ -1,5 +1,7 @@
{%- import "generator_macros.j2" as macros with context -%}
-{{ macros.header() }}
+{{ macros.canonical_ref() }}
+
+{{ macros.header()}}
class {{ exercise | camel_case }}Test(unittest.TestCase):
{% for supercase in cases %}
@@ -11,5 +13,3 @@ class {{ exercise | camel_case }}Test(unittest.TestCase):
{% endfor %}
{% endfor %}
-
-{{ macros.footer() }}
\ No newline at end of file
diff --git a/exercises/practice/difference-of-squares/difference_of_squares_test.py b/exercises/practice/difference-of-squares/difference_of_squares_test.py
index 8c2069e4d9a..aa7271907ac 100644
--- a/exercises/practice/difference-of-squares/difference_of_squares_test.py
+++ b/exercises/practice/difference-of-squares/difference_of_squares_test.py
@@ -1,3 +1,7 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/difference-of-squares/canonical-data.json
+# File last updated on 2023-07-19
+
import unittest
from difference_of_squares import (
@@ -6,8 +10,6 @@
sum_of_squares,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class DifferenceOfSquaresTest(unittest.TestCase):
def test_square_of_sum_1(self):
@@ -36,7 +38,3 @@ def test_difference_of_squares_5(self):
def test_difference_of_squares_100(self):
self.assertEqual(difference_of_squares(100), 25164150)
-
-
-if __name__ == "__main__":
- unittest.main()
diff --git a/exercises/practice/diffie-hellman/.meta/template.j2 b/exercises/practice/diffie-hellman/.meta/template.j2
index b9634cdc302..378c28423d3 100644
--- a/exercises/practice/diffie-hellman/.meta/template.j2
+++ b/exercises/practice/diffie-hellman/.meta/template.j2
@@ -1,7 +1,10 @@
{%- import "generator_macros.j2" as macros with context -%}
-{% set class = exercise | camel_case -%}
+{{ macros.canonical_ref() }}
+
{{ macros.header(["private_key", "public_key", "secret"]) }}
+{% set class = exercise | camel_case -%}
+
class {{ exercise | camel_case }}Test(unittest.TestCase):
{% for case in cases -%}
{% set property = case["property"] | to_snake -%}
diff --git a/exercises/practice/diffie-hellman/diffie_hellman_test.py b/exercises/practice/diffie-hellman/diffie_hellman_test.py
index 716b7ba1917..e24c4e742a1 100644
--- a/exercises/practice/diffie-hellman/diffie_hellman_test.py
+++ b/exercises/practice/diffie-hellman/diffie_hellman_test.py
@@ -1,3 +1,7 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/diffie-hellman/canonical-data.json
+# File last updated on 2023-07-19
+
import unittest
from diffie_hellman import (
@@ -6,8 +10,6 @@
secret,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class DiffieHellmanTest(unittest.TestCase):
def test_private_key_is_greater_than_1_and_less_than_p(self):
diff --git a/exercises/practice/dnd-character/.meta/template.j2 b/exercises/practice/dnd-character/.meta/template.j2
index adb15650537..793f3d921d9 100644
--- a/exercises/practice/dnd-character/.meta/template.j2
+++ b/exercises/practice/dnd-character/.meta/template.j2
@@ -1,4 +1,6 @@
{%- import "generator_macros.j2" as macros with context -%}
+{{ macros.canonical_ref() }}
+
{{ macros.header(["Character", "modifier"]) }}
{% macro test_case(supercase) -%}
diff --git a/exercises/practice/dnd-character/dnd_character_test.py b/exercises/practice/dnd-character/dnd_character_test.py
index 3f370bc4bda..e506fdb1171 100644
--- a/exercises/practice/dnd-character/dnd_character_test.py
+++ b/exercises/practice/dnd-character/dnd_character_test.py
@@ -1,3 +1,7 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/dnd-character/canonical-data.json
+# File last updated on 2023-07-19
+
import unittest
from dnd_character import (
@@ -5,8 +9,6 @@
modifier,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class DndCharacterTest(unittest.TestCase):
def test_ability_modifier_for_score_3_is_n4(self):
diff --git a/exercises/practice/dominoes/.meta/template.j2 b/exercises/practice/dominoes/.meta/template.j2
index e75094e9900..f1f226b3c59 100644
--- a/exercises/practice/dominoes/.meta/template.j2
+++ b/exercises/practice/dominoes/.meta/template.j2
@@ -1,4 +1,6 @@
{%- import "generator_macros.j2" as macros with context -%}
+{{ macros.canonical_ref() }}
+
{{ macros.header()}}
{% macro tuplify(dominoes_list) -%}
@@ -64,6 +66,3 @@ class {{ exercise | camel_case }}Test(unittest.TestCase):
def refute_correct_chain(self, input_dominoes, output_chain):
msg = 'There should be no valid chain for {}'.format(input_dominoes)
self.assertIsNone(output_chain, msg)
-
-{{ macros.footer() }}
-
diff --git a/exercises/practice/dominoes/dominoes_test.py b/exercises/practice/dominoes/dominoes_test.py
index a62f130cc20..4407036af12 100644
--- a/exercises/practice/dominoes/dominoes_test.py
+++ b/exercises/practice/dominoes/dominoes_test.py
@@ -1,11 +1,13 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/dominoes/canonical-data.json
+# File last updated on 2023-07-19
+
import unittest
from dominoes import (
can_chain,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class DominoesTest(unittest.TestCase):
def test_empty_input_empty_output(self):
@@ -128,7 +130,3 @@ def assert_correct_chain(self, input_dominoes, output_chain):
def refute_correct_chain(self, input_dominoes, output_chain):
msg = "There should be no valid chain for {}".format(input_dominoes)
self.assertIsNone(output_chain, msg)
-
-
-if __name__ == "__main__":
- unittest.main()
diff --git a/exercises/practice/error-handling/.docs/instructions.md b/exercises/practice/error-handling/.docs/instructions.md
index 7bc1a0856ba..25dd4d2928f 100644
--- a/exercises/practice/error-handling/.docs/instructions.md
+++ b/exercises/practice/error-handling/.docs/instructions.md
@@ -2,9 +2,7 @@
Implement various kinds of error handling and resource management.
-An important point of programming is how to handle errors and close
-resources even if errors occur.
+An important point of programming is how to handle errors and close resources even if errors occur.
-This exercise requires you to handle various errors. Because error handling
-is rather programming language specific you'll have to refer to the tests
-for your track to see what's exactly required.
+This exercise requires you to handle various errors.
+Because error handling is rather programming language specific you'll have to refer to the tests for your track to see what's exactly required.
diff --git a/exercises/practice/etl/.docs/instructions.md b/exercises/practice/etl/.docs/instructions.md
index fffe64f2015..802863b5405 100644
--- a/exercises/practice/etl/.docs/instructions.md
+++ b/exercises/practice/etl/.docs/instructions.md
@@ -1,19 +1,8 @@
# Instructions
-We are going to do the `Transform` step of an Extract-Transform-Load.
+Your task is to change the data format of letters and their point values in the game.
-## ETL
-
-Extract-Transform-Load (ETL) is a fancy way of saying, "We have some crufty, legacy data over in this system, and now we need it in this shiny new system over here, so we're going to migrate this."
-
-(Typically, this is followed by, "We're only going to need to run this once."
-That's then typically followed by much forehead slapping and moaning about how stupid we could possibly be.)
-
-## The goal
-
-We're going to extract some Scrabble scores from a legacy system.
-
-The old system stored a list of letters per score:
+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",
@@ -23,18 +12,16 @@ The old system stored a list of letters per score:
- 8 points: "J", "X",
- 10 points: "Q", "Z",
-The shiny new Scrabble system instead stores the score per letter, which makes it much faster and easier to calculate the score for a word.
-It also stores the letters in lower-case regardless of the case of the input letters:
+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.
-
-Your mission, should you choose to accept it, is to transform the legacy data format to the shiny new format.
+- etc.
-## Notes
+As part of this change, the team has also decided to change the letters to be lower-case rather than upper-case.
-A final note about scoring, Scrabble is played around the world in a variety of languages, each with its own unique scoring table.
-For example, an "E" is scored at 2 in the Māori-language version of the game while being scored at 4 in the Hawaiian-language version.
+~~~~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.
+~~~~
diff --git a/exercises/practice/etl/.docs/introduction.md b/exercises/practice/etl/.docs/introduction.md
new file mode 100644
index 00000000000..5be65147d7f
--- /dev/null
+++ b/exercises/practice/etl/.docs/introduction.md
@@ -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.
diff --git a/exercises/practice/etl/.meta/config.json b/exercises/practice/etl/.meta/config.json
index 4d99e6314da..32aab8ba3ba 100644
--- a/exercises/practice/etl/.meta/config.json
+++ b/exercises/practice/etl/.meta/config.json
@@ -27,7 +27,7 @@
".meta/example.py"
]
},
- "blurb": "We are going to do the `Transform` step of an Extract-Transform-Load.",
- "source": "Exercise by the JumpstartLab team for students at The Turing School of Software and Design.",
+ "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"
}
diff --git a/exercises/practice/etl/.meta/template.j2 b/exercises/practice/etl/.meta/template.j2
index 8e616d8874a..0fc3ccb39fd 100644
--- a/exercises/practice/etl/.meta/template.j2
+++ b/exercises/practice/etl/.meta/template.j2
@@ -1,4 +1,8 @@
{%- import "generator_macros.j2" as macros with context -%}
+{{ macros.canonical_ref() }}
+
+{{ macros.header()}}
+
{% macro test_case(case) -%}
{%- set input = case["input"] -%}
def test_{{ case["description"] | to_snake }}(self):
@@ -9,12 +13,8 @@
{{ case["property"] | to_snake }}(legacy_data), data
)
{%- endmacro %}
-{{ macros.header()}}
class {{ exercise | camel_case }}Test(unittest.TestCase):
{% for case in cases %}
{{ test_case(case) }}
{% endfor %}
-
-
-{{ macros.footer() }}
diff --git a/exercises/practice/etl/etl_test.py b/exercises/practice/etl/etl_test.py
index 693ecb9e867..d6eed70a574 100644
--- a/exercises/practice/etl/etl_test.py
+++ b/exercises/practice/etl/etl_test.py
@@ -1,11 +1,13 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/etl/canonical-data.json
+# File last updated on 2023-07-19
+
import unittest
from etl import (
transform,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class EtlTest(unittest.TestCase):
def test_single_letter(self):
@@ -62,7 +64,3 @@ def test_multiple_scores_with_differing_numbers_of_letters(self):
"z": 10,
}
self.assertEqual(transform(legacy_data), data)
-
-
-if __name__ == "__main__":
- unittest.main()
diff --git a/exercises/practice/flatten-array/.meta/template.j2 b/exercises/practice/flatten-array/.meta/template.j2
index d1d93ad7113..0a9a631fc77 100644
--- a/exercises/practice/flatten-array/.meta/template.j2
+++ b/exercises/practice/flatten-array/.meta/template.j2
@@ -1,5 +1,7 @@
{%- import "generator_macros.j2" as macros with context -%}
-{{ macros.header() }}
+{{ macros.canonical_ref() }}
+
+{{ macros.header()}}
class {{ exercise | camel_case }}Test(unittest.TestCase):
{% for case in cases -%}
@@ -9,5 +11,4 @@ class {{ exercise | camel_case }}Test(unittest.TestCase):
self.assertEqual({{ case["property"] }}(inputs), expected)
{% endfor %}
-
-{{ macros.footer() }}
+
\ No newline at end of file
diff --git a/exercises/practice/flatten-array/flatten_array_test.py b/exercises/practice/flatten-array/flatten_array_test.py
index 1552f0edb6a..cecb3c5633f 100644
--- a/exercises/practice/flatten-array/flatten_array_test.py
+++ b/exercises/practice/flatten-array/flatten_array_test.py
@@ -1,11 +1,13 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/flatten-array/canonical-data.json
+# File last updated on 2023-07-19
+
import unittest
from flatten_array import (
flatten,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class FlattenArrayTest(unittest.TestCase):
def test_empty(self):
@@ -66,7 +68,3 @@ def test_all_values_in_nested_list_are_null(self):
inputs = [None, [[[None]]], None, None, [[None, None], None], None]
expected = []
self.assertEqual(flatten(inputs), expected)
-
-
-if __name__ == "__main__":
- unittest.main()
diff --git a/exercises/practice/food-chain/.meta/template.j2 b/exercises/practice/food-chain/.meta/template.j2
index e1851f7a30e..bc5c61d5712 100644
--- a/exercises/practice/food-chain/.meta/template.j2
+++ b/exercises/practice/food-chain/.meta/template.j2
@@ -1,5 +1,7 @@
{%- import "generator_macros.j2" as macros with context -%}
-{{ macros.header() }}
+{{ macros.canonical_ref() }}
+
+{{ macros.header()}}
class {{ exercise | camel_case }}Test(unittest.TestCase):
{% for case in cases %}
@@ -10,5 +12,3 @@ class {{ exercise | camel_case }}Test(unittest.TestCase):
self.assertEqual({{ case["property"]}}({{start_verse}}, {{end_verse}}), {{expected}})
{% endfor %}
-
-{{ macros.footer() }}
\ No newline at end of file
diff --git a/exercises/practice/food-chain/food_chain_test.py b/exercises/practice/food-chain/food_chain_test.py
index d77953527e8..0cd42356ab1 100644
--- a/exercises/practice/food-chain/food_chain_test.py
+++ b/exercises/practice/food-chain/food_chain_test.py
@@ -1,11 +1,13 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/food-chain/canonical-data.json
+# File last updated on 2023-07-19
+
import unittest
from food_chain import (
recite,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class FoodChainTest(unittest.TestCase):
def test_fly(self):
@@ -180,7 +182,3 @@ def test_full_song(self):
"She's dead, of course!",
],
)
-
-
-if __name__ == "__main__":
- unittest.main()
diff --git a/exercises/practice/forth/.meta/template.j2 b/exercises/practice/forth/.meta/template.j2
index b6fe07e71a0..0b5dd2b89ef 100644
--- a/exercises/practice/forth/.meta/template.j2
+++ b/exercises/practice/forth/.meta/template.j2
@@ -1,6 +1,7 @@
{%- import "generator_macros.j2" as macros with context -%}
-{% set imports = ["evaluate", "StackUnderflowError"] %}
-{{ macros.header(imports=imports, ignore=ignore) }}
+{{ macros.canonical_ref() }}
+
+{{ macros.header(imports = ["evaluate", "StackUnderflowError"])}}
{% macro test_case(group, case) -%}
def test_{{ group | to_snake }}_{{ case["description"] | to_snake }}(self):
diff --git a/exercises/practice/forth/forth_test.py b/exercises/practice/forth/forth_test.py
index f565c6455e3..f8402bdd64c 100644
--- a/exercises/practice/forth/forth_test.py
+++ b/exercises/practice/forth/forth_test.py
@@ -1,3 +1,7 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/forth/canonical-data.json
+# File last updated on 2023-07-19
+
import unittest
from forth import (
@@ -5,8 +9,6 @@
StackUnderflowError,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class ForthTest(unittest.TestCase):
def test_parsing_and_numbers_numbers_just_get_pushed_onto_the_stack(self):
diff --git a/exercises/practice/gigasecond/.docs/hints.md b/exercises/practice/gigasecond/.docs/hints.md
index 0375a753afe..30a36d1be94 100644
--- a/exercises/practice/gigasecond/.docs/hints.md
+++ b/exercises/practice/gigasecond/.docs/hints.md
@@ -1,6 +1,17 @@
# Hints
-## General
-- Your code should parse a datetime object, add a gigasecond's worth of time to it, and then return the result as a datetime object.
+## General
+
+- Your function should parse the passed-in [datetime object][datetime], add a gigasecond's worth of time to it, and then return the result.
- If you're having trouble, remember to take a look at the provided test cases under the Tests tab. These will help you figure out what the expected inputs and outputs of your function(s) should be.
+
+- Most of the time, code is read rather than written, and a big number can be a challenge to read. Here are a couple of approaches to making big numbers in your code more readable:
+
+ - Using underscores (`_`) in numeric literals can help offset thousands, hundred-thousands, millions, etc. (_**ie:** `1_000_000` or `10_100_201_330` is far more readable than `1000000` or `10100201330`._) See [PEP-0515][underscores_notation] for more information.
+
+ - Scientific notation can be more compact and easier to scan when there are very large numbers (_**ie:** `1e6`, 1 is multiplied by 10 raised to the power of 6, which equals `1000000`_). For more information, see this reference on [scientific notation][scientific_notation].
+
+[datetime]: https://docs.python.org/3.9/library/datetime.html#datetime.datetime
+[scientific_notation]: https://python-reference.readthedocs.io/en/latest/docs/float/scientific.html
+[underscores_notation]: https://peps.python.org/pep-0515/#:~:text=The%20syntax%20would%20be%20the,width%20of%2010%20with%20*%20separator.
diff --git a/exercises/practice/gigasecond/.docs/instructions.append.md b/exercises/practice/gigasecond/.docs/instructions.append.md
index 832fec734c8..ccb6f2d05bb 100644
--- a/exercises/practice/gigasecond/.docs/instructions.append.md
+++ b/exercises/practice/gigasecond/.docs/instructions.append.md
@@ -1,5 +1,15 @@
# Instructions append
+## Reading and Writing Long Numbers
+
+Code is more often _read_ than it is written, and reading a big/long number within other text can be a challenge.
+Here are two approaches to making numbers more readable:
+
+1. Using underscores in Numeric Literals. `1_000_000` is more readable than `1000000`, and `10_100_201_330` is easier to scan than `10100201330`. For more information, see [PEP-0515][underscores_notation].
+
+2. Using exponential notation or scientific notation. The e (or E) character followed by an integer represents the power of 10 by which the number preceding the e should be multiplied (_**ie:** `1e6`, 1 is multiplied by 10 raised to the power of 6, which equals `1000000`_). For more details, check out this reference on [scientific notation][scientific_notation].
+
+
## Dates and Times in Python
This exercise explores objects from Python's `datetime` module:
@@ -8,6 +18,8 @@ This exercise explores objects from Python's `datetime` module:
- [datetime objects][datetime.datetime]
- [timedelta objects][datetime.timedelta]
-[datetime]: https://docs.python.org/3.9/library/datetime.html#module-datetime
[datetime.datetime]: https://docs.python.org/3.9/library/datetime.html#datetime.datetime
-[datetime.timedelta]: https://docs.python.org/3.9/library/datetime.html#timedelta-objects
\ No newline at end of file
+[datetime.timedelta]: https://docs.python.org/3.9/library/datetime.html#timedelta-objects
+[datetime]: https://docs.python.org/3.9/library/datetime.html#module-datetime
+[scientific_notation]: https://python-reference.readthedocs.io/en/latest/docs/float/scientific.html
+[underscores_notation]: https://peps.python.org/pep-0515/#:~:text=The%20syntax%20would%20be%20the,width%20of%2010%20with%20*%20separator.
diff --git a/exercises/practice/gigasecond/.docs/introduction.md b/exercises/practice/gigasecond/.docs/introduction.md
index 74afaa994f3..18a3dc20058 100644
--- a/exercises/practice/gigasecond/.docs/introduction.md
+++ b/exercises/practice/gigasecond/.docs/introduction.md
@@ -13,7 +13,7 @@ Then we can use metric system prefixes for writing large numbers of seconds in m
- Perhaps you and your family would travel to somewhere exotic for two megaseconds (that's two million seconds).
- And if you and your spouse were married for _a thousand million_ seconds, you would celebrate your one gigasecond anniversary.
-```exercism/note
+~~~~exercism/note
If we ever colonize Mars or some other planet, measuring time is going to get even messier.
If someone says "year" do they mean a year on Earth or a year on Mars?
@@ -21,4 +21,4 @@ The idea for this exercise came from the science fiction novel ["A Deepness in t
In it the author uses the metric system as the basis for time measurements.
[vinge-novel]: https://www.tor.com/2017/08/03/science-fiction-with-something-for-everyone-a-deepness-in-the-sky-by-vernor-vinge/
-```
+~~~~
diff --git a/exercises/practice/gigasecond/.meta/config.json b/exercises/practice/gigasecond/.meta/config.json
index 59b2d30cc9e..76af3dac048 100644
--- a/exercises/practice/gigasecond/.meta/config.json
+++ b/exercises/practice/gigasecond/.meta/config.json
@@ -15,7 +15,8 @@
"pheanex",
"sjakobi",
"tqa236",
- "yawpitch"
+ "yawpitch",
+ "AndrewLawendy"
],
"files": {
"solution": [
diff --git a/exercises/practice/gigasecond/.meta/template.j2 b/exercises/practice/gigasecond/.meta/template.j2
index 31d032a46fd..e40462e2d8b 100644
--- a/exercises/practice/gigasecond/.meta/template.j2
+++ b/exercises/practice/gigasecond/.meta/template.j2
@@ -1,4 +1,6 @@
{%- import "generator_macros.j2" as macros with context -%}
+{{ macros.canonical_ref() }}
+
from datetime import datetime
{{ macros.header() }}
@@ -9,6 +11,3 @@ class {{ exercise | camel_case }}Test(unittest.TestCase):
def test_{{ case["description"] | to_snake }}(self):
self.assertEqual({{ case["property"] }}({{ input }}), {{ expected }})
{% endfor %}
-
-
-{{ macros.footer() }}
diff --git a/exercises/practice/gigasecond/gigasecond_test.py b/exercises/practice/gigasecond/gigasecond_test.py
index 76ff16a64c9..dd648e14bd6 100644
--- a/exercises/practice/gigasecond/gigasecond_test.py
+++ b/exercises/practice/gigasecond/gigasecond_test.py
@@ -1,3 +1,7 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/gigasecond/canonical-data.json
+# File last updated on 2023-07-19
+
from datetime import datetime
import unittest
@@ -5,8 +9,6 @@
add,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class GigasecondTest(unittest.TestCase):
def test_date_only_specification_of_time(self):
@@ -33,7 +35,3 @@ def test_full_time_with_day_roll_over(self):
self.assertEqual(
add(datetime(2015, 1, 24, 23, 59, 59)), datetime(2046, 10, 3, 1, 46, 39)
)
-
-
-if __name__ == "__main__":
- unittest.main()
diff --git a/exercises/practice/go-counting/go_counting_test.py b/exercises/practice/go-counting/go_counting_test.py
index 30972ca6a20..aec80a1b369 100644
--- a/exercises/practice/go-counting/go_counting_test.py
+++ b/exercises/practice/go-counting/go_counting_test.py
@@ -1,3 +1,7 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/go-counting/canonical-data.json
+# File last updated on 2023-07-19
+
import unittest
from go_counting import (
@@ -7,8 +11,6 @@
NONE,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class GoCountingTest(unittest.TestCase):
def test_black_corner_territory_on_5x5_board(self):
@@ -83,11 +85,3 @@ def test_two_region_rectangular_board(self):
self.assertSetEqual(territories[BLACK], {(0, 0), (2, 0)})
self.assertSetEqual(territories[WHITE], set())
self.assertSetEqual(territories[NONE], set())
-
- # Utility functions
- def assertRaisesWithMessage(self, exception):
- return self.assertRaisesRegex(exception, r".+")
-
-
-if __name__ == "__main__":
- unittest.main()
diff --git a/exercises/practice/grade-school/.meta/template.j2 b/exercises/practice/grade-school/.meta/template.j2
index 8a86c1a8df7..a97fa010db0 100644
--- a/exercises/practice/grade-school/.meta/template.j2
+++ b/exercises/practice/grade-school/.meta/template.j2
@@ -1,4 +1,8 @@
{%- import "generator_macros.j2" as macros with context -%}
+{{ macros.canonical_ref() }}
+
+{{ macros.header(["School"]) }}
+
{%- macro test_case( case) -%}
{%- set input = case["input"] -%}
{%- set property = case["property"] -%}
@@ -15,8 +19,7 @@
{% else %}
self.assertEqual(school.{{ case["property"] | to_snake }}(), expected)
{%- endif %}
-{% endmacro -%}
-{{ macros.header(["School"]) }}
+{% endmacro %}
class {{ exercise | camel_case }}Test(unittest.TestCase):
{% for case in cases %}
diff --git a/exercises/practice/grade-school/grade_school_test.py b/exercises/practice/grade-school/grade_school_test.py
index 4672efe88ee..30d91c6c57d 100644
--- a/exercises/practice/grade-school/grade_school_test.py
+++ b/exercises/practice/grade-school/grade_school_test.py
@@ -1,11 +1,13 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/grade-school/canonical-data.json
+# File last updated on 2023-07-19
+
import unittest
from grade_school import (
School,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class GradeSchoolTest(unittest.TestCase):
def test_roster_is_empty_when_no_student_is_added(self):
diff --git a/exercises/practice/grains/.meta/template.j2 b/exercises/practice/grains/.meta/template.j2
index 5ea2b5b0f8d..18180801d68 100644
--- a/exercises/practice/grains/.meta/template.j2
+++ b/exercises/practice/grains/.meta/template.j2
@@ -1,4 +1,7 @@
{%- import "generator_macros.j2" as macros with context -%}
+{{ macros.canonical_ref() }}
+
+{{ macros.header()}}
{% macro test_case(case) %}
{%- set input = case["input"] %}
@@ -16,8 +19,6 @@
{% endif %}
{%- endmacro %}
-{{ macros.header()}}
-
class {{ exercise | camel_case }}Test(unittest.TestCase):
{% for case in cases -%}
{%- if "cases" in case -%}
diff --git a/exercises/practice/grains/grains_test.py b/exercises/practice/grains/grains_test.py
index f7e277c0702..8d729fb6f8e 100644
--- a/exercises/practice/grains/grains_test.py
+++ b/exercises/practice/grains/grains_test.py
@@ -1,3 +1,7 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/grains/canonical-data.json
+# File last updated on 2023-07-19
+
import unittest
from grains import (
@@ -5,8 +9,6 @@
total,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class GrainsTest(unittest.TestCase):
def test_grains_on_square_1(self):
diff --git a/exercises/practice/grep/.meta/template.j2 b/exercises/practice/grep/.meta/template.j2
index 6091fd667e5..fdb09b6dbf6 100644
--- a/exercises/practice/grep/.meta/template.j2
+++ b/exercises/practice/grep/.meta/template.j2
@@ -1,6 +1,8 @@
{%- import "generator_macros.j2" as macros with context -%}
-{{ macros.header() }}
+{{ macros.canonical_ref() }}
+
import io
+{{ macros.header()}}
from unittest import mock
{% set filenames = comments | join("\n") | regex_find("[a-z-]*\.txt") -%}
@@ -48,5 +50,3 @@ class {{ exercise | camel_case }}Test(unittest.TestCase):
{% endfor %}
{% endfor %}
-
-{{ macros.footer() }}
diff --git a/exercises/practice/grep/grep_test.py b/exercises/practice/grep/grep_test.py
index 804071542d0..81952884566 100644
--- a/exercises/practice/grep/grep_test.py
+++ b/exercises/practice/grep/grep_test.py
@@ -1,11 +1,13 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/grep/canonical-data.json
+# File last updated on 2023-07-19
+
+import io
import unittest
from grep import (
grep,
)
-
-# Tests adapted from `problem-specifications//canonical-data.json`
-import io
from unittest import mock
FILE_TEXT = {
@@ -290,7 +292,3 @@ def test_multiple_files_several_matches_inverted_and_match_entire_lines_flags(
"paradise-lost.txt:Of Oreb, or of Sinai, didst inspire\n"
"paradise-lost.txt:That Shepherd, who first taught the chosen Seed\n",
)
-
-
-if __name__ == "__main__":
- unittest.main()
diff --git a/exercises/practice/hamming/.meta/template.j2 b/exercises/practice/hamming/.meta/template.j2
index 498fbc56ce6..23efd5b73e2 100644
--- a/exercises/practice/hamming/.meta/template.j2
+++ b/exercises/practice/hamming/.meta/template.j2
@@ -1,12 +1,15 @@
{%- import "generator_macros.j2" as macros with context -%}
+{{ macros.canonical_ref() }}
+
+{{ macros.header()}}
+
{%- macro test_call(case) %}
{{ case["property"] }}(
{% for arg in case["input"].values() -%}
"{{ arg }}"{{ "," if not loop.last }}
{% endfor %}
)
-{% endmacro -%}
-{{ macros.header() }}
+{% endmacro %}
class {{ exercise | camel_case }}Test(unittest.TestCase):
{% for case in cases -%}
diff --git a/exercises/practice/hamming/hamming_test.py b/exercises/practice/hamming/hamming_test.py
index 06a08b09dd8..df58ef002d8 100644
--- a/exercises/practice/hamming/hamming_test.py
+++ b/exercises/practice/hamming/hamming_test.py
@@ -1,11 +1,13 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/hamming/canonical-data.json
+# File last updated on 2023-07-19
+
import unittest
from hamming import (
distance,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class HammingTest(unittest.TestCase):
def test_empty_strands(self):
diff --git a/exercises/practice/hello-world/.meta/template.j2 b/exercises/practice/hello-world/.meta/template.j2
index dbcde585e9c..600120d665f 100644
--- a/exercises/practice/hello-world/.meta/template.j2
+++ b/exercises/practice/hello-world/.meta/template.j2
@@ -1,4 +1,5 @@
{%- import "generator_macros.j2" as macros with context -%}
+{{ macros.canonical_ref() }}
import unittest
diff --git a/exercises/practice/hello-world/hello_world_test.py b/exercises/practice/hello-world/hello_world_test.py
index 245f5434fa6..15473f5557b 100644
--- a/exercises/practice/hello-world/hello_world_test.py
+++ b/exercises/practice/hello-world/hello_world_test.py
@@ -1,3 +1,7 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/hello-world/canonical-data.json
+# File last updated on 2023-07-19
+
import unittest
try:
diff --git a/exercises/practice/hexadecimal/.docs/instructions.md b/exercises/practice/hexadecimal/.docs/instructions.md
index 3e5afa77c6e..a3c648e32f7 100644
--- a/exercises/practice/hexadecimal/.docs/instructions.md
+++ b/exercises/practice/hexadecimal/.docs/instructions.md
@@ -2,7 +2,6 @@
Convert a hexadecimal number, represented as a string (e.g. "10af8c"), to its decimal equivalent using first principles (i.e. no, you may not use built-in or external libraries to accomplish the conversion).
-On the web we use hexadecimal to represent colors, e.g. green: 008000,
-teal: 008080, navy: 000080).
+On the web we use hexadecimal to represent colors, e.g. green: 008000, teal: 008080, navy: 000080).
The program should handle invalid hexadecimal strings.
diff --git a/exercises/practice/hexadecimal/.meta/config.json b/exercises/practice/hexadecimal/.meta/config.json
index 352ca16d78c..b61e1a2c057 100644
--- a/exercises/practice/hexadecimal/.meta/config.json
+++ b/exercises/practice/hexadecimal/.meta/config.json
@@ -26,5 +26,5 @@
]
},
"source": "All of Computer Science",
- "source_url": "http://www.wolframalpha.com/examples/NumberBases.html"
+ "source_url": "https://www.wolframalpha.com/examples/mathematics/numbers/base-conversions"
}
diff --git a/exercises/practice/high-scores/.meta/template.j2 b/exercises/practice/high-scores/.meta/template.j2
index c32ae121aee..36e218c5f47 100644
--- a/exercises/practice/high-scores/.meta/template.j2
+++ b/exercises/practice/high-scores/.meta/template.j2
@@ -1,4 +1,8 @@
{%- import "generator_macros.j2" as macros with context -%}
+{{ macros.canonical_ref() }}
+
+{{ macros.header(["HighScores"]) }}
+
{%- macro get_property(property) %}
{%- if property == "scores" %}
scores
@@ -19,10 +23,7 @@
highscores.personal_{{ function }}()
self.assertEqual(highscores.{{ get_property(property) }}, expected)
{% endif -%}
-{% endmacro -%}
-
-{{ macros.header(["HighScores"]) }}
-
+{% endmacro %}
class {{ exercise | camel_case }}Test(unittest.TestCase):
{%- for case in cases -%}
diff --git a/exercises/practice/high-scores/high_scores_test.py b/exercises/practice/high-scores/high_scores_test.py
index f1406dd852d..6a926e32fde 100644
--- a/exercises/practice/high-scores/high_scores_test.py
+++ b/exercises/practice/high-scores/high_scores_test.py
@@ -1,11 +1,13 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/high-scores/canonical-data.json
+# File last updated on 2023-07-19
+
import unittest
from high_scores import (
HighScores,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class HighScoresTest(unittest.TestCase):
def test_list_of_scores(self):
diff --git a/exercises/practice/house/.meta/template.j2 b/exercises/practice/house/.meta/template.j2
index 9683c07a993..6e61bc88ecc 100644
--- a/exercises/practice/house/.meta/template.j2
+++ b/exercises/practice/house/.meta/template.j2
@@ -1,4 +1,6 @@
{%- import "generator_macros.j2" as macros with context -%}
+{{ macros.canonical_ref() }}
+
{{ macros.header()}}
class {{ exercise | camel_case }}Test(unittest.TestCase):
@@ -10,5 +12,3 @@ class {{ exercise | camel_case }}Test(unittest.TestCase):
{{ case["expected"] }}
)
{% endfor %}
-
-{{ macros.footer() }}
diff --git a/exercises/practice/house/house_test.py b/exercises/practice/house/house_test.py
index 0facef614fe..d859fb4f5ea 100644
--- a/exercises/practice/house/house_test.py
+++ b/exercises/practice/house/house_test.py
@@ -1,11 +1,13 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/house/canonical-data.json
+# File last updated on 2023-07-19
+
import unittest
from house import (
recite,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class HouseTest(unittest.TestCase):
def test_verse_one_the_house_that_jack_built(self):
@@ -126,7 +128,3 @@ def test_full_rhyme(self):
"This is the horse and the hound and the horn that belonged to the farmer sowing his corn that kept the rooster that crowed in the morn that woke the priest all shaven and shorn that married the man all tattered and torn that kissed the maiden all forlorn that milked the cow with the crumpled horn that tossed the dog that worried the cat that killed the rat that ate the malt that lay in the house that Jack built.",
],
)
-
-
-if __name__ == "__main__":
- unittest.main()
diff --git a/exercises/practice/isbn-verifier/.meta/template.j2 b/exercises/practice/isbn-verifier/.meta/template.j2
index ce973c491d4..eae9dbc1148 100644
--- a/exercises/practice/isbn-verifier/.meta/template.j2
+++ b/exercises/practice/isbn-verifier/.meta/template.j2
@@ -1,11 +1,10 @@
{%- import "generator_macros.j2" as macros with context -%}
+{{ macros.canonical_ref() }}
-{{ macros.header() }}
+{{ macros.header()}}
class {{ exercise | camel_case }}Test(unittest.TestCase):
{% for case in cases -%}
def test_{{ case["description"] | to_snake }}(self):
self.assertIs({{ case["property"] | to_snake }}("{{ case["input"]["isbn"] }}"), {{ case["expected"] }})
{% endfor %}
-
-{{ macros.footer() }}
diff --git a/exercises/practice/isbn-verifier/isbn_verifier_test.py b/exercises/practice/isbn-verifier/isbn_verifier_test.py
index f2f97770d7e..dbcddf19d48 100644
--- a/exercises/practice/isbn-verifier/isbn_verifier_test.py
+++ b/exercises/practice/isbn-verifier/isbn_verifier_test.py
@@ -1,11 +1,13 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/isbn-verifier/canonical-data.json
+# File last updated on 2023-07-19
+
import unittest
from isbn_verifier import (
is_valid,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class IsbnVerifierTest(unittest.TestCase):
def test_valid_isbn(self):
@@ -64,7 +66,3 @@ def test_invalid_characters_are_not_ignored_before_checking_length(self):
def test_input_is_too_long_but_contains_a_valid_isbn(self):
self.assertIs(is_valid("98245726788"), False)
-
-
-if __name__ == "__main__":
- unittest.main()
diff --git a/exercises/practice/isogram/.meta/template.j2 b/exercises/practice/isogram/.meta/template.j2
index fbec4a93a84..d75c2f49044 100644
--- a/exercises/practice/isogram/.meta/template.j2
+++ b/exercises/practice/isogram/.meta/template.j2
@@ -1,12 +1,15 @@
{%- import "generator_macros.j2" as macros with context -%}
+{{ macros.canonical_ref() }}
+
+{{ macros.header()}}
+
{%- macro test_call(case) %}
{{ case["property"] | to_snake }}(
{% for arg in case["input"].values() -%}
"{{ arg }}"{{ "," if not loop.last }}
{% endfor %}
)
-{% endmacro -%}
-{{ macros.header() }}
+{% endmacro %}
class {{ exercise | camel_case }}Test(unittest.TestCase):
{# All test cases in this exercise are nested, so use two for loops -#}
diff --git a/exercises/practice/isogram/isogram_test.py b/exercises/practice/isogram/isogram_test.py
index 8d00d2b5f52..c65984f6e64 100644
--- a/exercises/practice/isogram/isogram_test.py
+++ b/exercises/practice/isogram/isogram_test.py
@@ -1,11 +1,13 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/isogram/canonical-data.json
+# File last updated on 2023-07-19
+
import unittest
from isogram import (
is_isogram,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class IsogramTest(unittest.TestCase):
def test_empty_string(self):
diff --git a/exercises/practice/killer-sudoku-helper/.docs/instructions.md b/exercises/practice/killer-sudoku-helper/.docs/instructions.md
index 93469a09cc0..2347ab262ca 100644
--- a/exercises/practice/killer-sudoku-helper/.docs/instructions.md
+++ b/exercises/practice/killer-sudoku-helper/.docs/instructions.md
@@ -56,8 +56,8 @@ The screenshots above have been generated using [F-Puzzles.com](https://www.f-pu
[sudoku-rules]: https://masteringsudoku.com/sudoku-rules-beginners/
[killer-guide]: https://masteringsudoku.com/killer-sudoku/
-[one-solution-img]: https://media.githubusercontent.com/media/exercism/v3-files/main/julia/killer-sudoku-helper/example1.png
-[four-solutions-img]: https://media.githubusercontent.com/media/exercism/v3-files/main/julia/killer-sudoku-helper/example2.png
-[not-possible-img]: https://media.githubusercontent.com/media/exercism/v3-files/main/julia/killer-sudoku-helper/example3.png
+[one-solution-img]: https://exercism-v3-icons.s3.eu-west-2.amazonaws.com/images/exercises/killer-sudoku-helper/example1.png
+[four-solutions-img]: https://exercism-v3-icons.s3.eu-west-2.amazonaws.com/images/exercises/killer-sudoku-helper/example2.png
+[not-possible-img]: https://exercism-v3-icons.s3.eu-west-2.amazonaws.com/images/exercises/killer-sudoku-helper/example3.png
[clover-puzzle]: https://app.crackingthecryptic.com/sudoku/HqTBn3Pr6R
[goodliffe-video]: https://youtu.be/c_NjEbFEeW0?t=1180
diff --git a/exercises/practice/killer-sudoku-helper/.meta/template.j2 b/exercises/practice/killer-sudoku-helper/.meta/template.j2
index c107933784f..43fca4aa994 100644
--- a/exercises/practice/killer-sudoku-helper/.meta/template.j2
+++ b/exercises/practice/killer-sudoku-helper/.meta/template.j2
@@ -1,4 +1,8 @@
{%- import "generator_macros.j2" as macros with context -%}
+{{ macros.canonical_ref() }}
+
+{{ macros.header()}}
+
{% macro test_case(case) -%}
{%- set input = case["input"] -%}
def test_{{ case["description"] | to_snake }}(self):
@@ -8,7 +12,6 @@
{{ case["input"]["cage"]["exclude"] }}),
{{ case["expected"] }})
{%- endmacro %}
-{{ macros.header()}}
class {{ exercise | camel_case }}Test(unittest.TestCase):
{% for case in cases[0]["cases"] -%}
diff --git a/exercises/practice/killer-sudoku-helper/killer_sudoku_helper_test.py b/exercises/practice/killer-sudoku-helper/killer_sudoku_helper_test.py
index b5732054653..2479bfc8958 100644
--- a/exercises/practice/killer-sudoku-helper/killer_sudoku_helper_test.py
+++ b/exercises/practice/killer-sudoku-helper/killer_sudoku_helper_test.py
@@ -1,11 +1,13 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/killer-sudoku-helper/canonical-data.json
+# File last updated on 2023-07-19
+
import unittest
from killer_sudoku_helper import (
combinations,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class KillerSudokuHelperTest(unittest.TestCase):
def test_1(self):
diff --git a/exercises/practice/kindergarten-garden/.meta/template.j2 b/exercises/practice/kindergarten-garden/.meta/template.j2
index f1dc54254de..4ba100bbe6e 100644
--- a/exercises/practice/kindergarten-garden/.meta/template.j2
+++ b/exercises/practice/kindergarten-garden/.meta/template.j2
@@ -1,4 +1,8 @@
{%- import "generator_macros.j2" as macros with context -%}
+{{ macros.canonical_ref() }}
+
+{{ macros.header(["Garden"]) }}
+
{%- macro test_case(group_name, case) -%}
{%- set input = case["input"] -%}
def test_{{ group_name | to_snake }}_
@@ -16,8 +20,7 @@
"{{ val | camel_case }}"{{- "," if not loop.last }}
{% endfor %}]
)
-{% endmacro -%}
-{{ macros.header(["Garden"]) }}
+{% endmacro %}
class {{ exercise | camel_case }}Test(unittest.TestCase):
{% for casegroup in cases %}
diff --git a/exercises/practice/kindergarten-garden/kindergarten_garden_test.py b/exercises/practice/kindergarten-garden/kindergarten_garden_test.py
index 95095cabed8..fd4d0222388 100644
--- a/exercises/practice/kindergarten-garden/kindergarten_garden_test.py
+++ b/exercises/practice/kindergarten-garden/kindergarten_garden_test.py
@@ -1,11 +1,13 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/kindergarten-garden/canonical-data.json
+# File last updated on 2023-07-19
+
import unittest
from kindergarten_garden import (
Garden,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class KindergartenGardenTest(unittest.TestCase):
def test_partial_garden_garden_with_single_student(self):
diff --git a/exercises/practice/knapsack/.meta/template.j2 b/exercises/practice/knapsack/.meta/template.j2
index 12760c7abae..e4282e9ce30 100644
--- a/exercises/practice/knapsack/.meta/template.j2
+++ b/exercises/practice/knapsack/.meta/template.j2
@@ -1,5 +1,7 @@
{%- import "generator_macros.j2" as macros with context -%}
-{{ macros.header() }}
+{{ macros.canonical_ref() }}
+
+{{ macros.header()}}
class {{ exercise | camel_case }}Test(unittest.TestCase):
{% for case in cases -%}
@@ -13,5 +15,3 @@ class {{ exercise | camel_case }}Test(unittest.TestCase):
self.assertEqual({{ case["property"] |to_snake }}({{weight}}, {{items}}), {{expected}})
{% endif%}
{% endfor %}
-
-{{ macros.footer() }}
\ No newline at end of file
diff --git a/exercises/practice/knapsack/knapsack_test.py b/exercises/practice/knapsack/knapsack_test.py
index 0a792f179c3..011f7ba8324 100644
--- a/exercises/practice/knapsack/knapsack_test.py
+++ b/exercises/practice/knapsack/knapsack_test.py
@@ -1,11 +1,13 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/knapsack/canonical-data.json
+# File last updated on 2023-07-19
+
import unittest
from knapsack import (
maximum_value,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class KnapsackTest(unittest.TestCase):
def test_no_items(self):
@@ -100,7 +102,3 @@ def test_15_items(self):
),
1458,
)
-
-
-if __name__ == "__main__":
- unittest.main()
diff --git a/exercises/practice/largest-series-product/.docs/instructions.append.md b/exercises/practice/largest-series-product/.docs/instructions.append.md
index 9250db2e8ca..5a0f9b92064 100644
--- a/exercises/practice/largest-series-product/.docs/instructions.append.md
+++ b/exercises/practice/largest-series-product/.docs/instructions.append.md
@@ -12,8 +12,8 @@ To raise a `ValueError` with a message, write the message as an argument to the
# span of numbers is longer than number series
raise ValueError("span must be smaller than string length")
-# span of number is zero or negative
-raise ValueError("span must be greater than zero")
+# span of number is negative
+raise ValueError("span must not be negative")
# series includes non-number input
raise ValueError("digits input must only contain digits")
diff --git a/exercises/practice/largest-series-product/.docs/instructions.md b/exercises/practice/largest-series-product/.docs/instructions.md
index 08586dd5933..f297b57f7c4 100644
--- a/exercises/practice/largest-series-product/.docs/instructions.md
+++ b/exercises/practice/largest-series-product/.docs/instructions.md
@@ -1,14 +1,26 @@
# Instructions
-Given a string of digits, calculate the largest product for a contiguous substring of digits of length n.
+Your task is to look for patterns in the long sequence of digits in the encrypted signal.
-For example, for the input `'1027839564'`, the largest product for a series of 3 digits is 270 `(9 * 5 * 6)`, and the largest product for a series of 5 digits is 7560 `(7 * 8 * 3 * 9 * 5)`.
+The technique you're going to use here is called the largest series product.
-Note that these series are only required to occupy *adjacent positions* in the input; the digits need not be *numerically consecutive*.
+Let's define a few terms, first.
-For the input `'73167176531330624919225119674426574742355349194934'`,
-the largest product for a series of 6 digits is 23520.
+- **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
-For a series of zero digits, the largest product is 1 because 1 is the multiplicative identity.
-(You don't need to know what a multiplicative identity is to solve this problem;
-it just means that multiplying a number by 1 gives you the same number.)
+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**.
diff --git a/exercises/practice/largest-series-product/.docs/introduction.md b/exercises/practice/largest-series-product/.docs/introduction.md
new file mode 100644
index 00000000000..597bb5fa15d
--- /dev/null
+++ b/exercises/practice/largest-series-product/.docs/introduction.md
@@ -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.
diff --git a/exercises/practice/largest-series-product/.meta/template.j2 b/exercises/practice/largest-series-product/.meta/template.j2
index 7da257f4c2e..07fe947fb56 100644
--- a/exercises/practice/largest-series-product/.meta/template.j2
+++ b/exercises/practice/largest-series-product/.meta/template.j2
@@ -1,9 +1,11 @@
{%- import "generator_macros.j2" as macros with context -%}
+{{ macros.canonical_ref() }}
+
+{{ macros.header()}}
+
{%- macro test_call(case) -%}
{{ case["property"] | to_snake }}("{{ case["input"]["digits"] }}", {{ case["input"]["span"] }})
-{%- endmacro -%}
-
-{{ macros.header() }}
+{%- endmacro %}
class {{ exercise | camel_case }}Test(unittest.TestCase):
{% for case in cases -%}
diff --git a/exercises/practice/largest-series-product/.meta/tests.toml b/exercises/practice/largest-series-product/.meta/tests.toml
index 6c111adf0f1..88316925977 100644
--- a/exercises/practice/largest-series-product/.meta/tests.toml
+++ b/exercises/practice/largest-series-product/.meta/tests.toml
@@ -41,9 +41,11 @@ description = "rejects span longer than string length"
[06bc8b90-0c51-4c54-ac22-3ec3893a079e]
description = "reports 1 for empty string and empty product (0 span)"
+include = false
[3ec0d92e-f2e2-4090-a380-70afee02f4c0]
description = "reports 1 for nonempty string and empty product (0 span)"
+include = false
[6d96c691-4374-4404-80ee-2ea8f3613dd4]
description = "rejects empty string and nonzero span"
diff --git a/exercises/practice/largest-series-product/largest_series_product_test.py b/exercises/practice/largest-series-product/largest_series_product_test.py
index 0a67d4ca14e..e5056236736 100644
--- a/exercises/practice/largest-series-product/largest_series_product_test.py
+++ b/exercises/practice/largest-series-product/largest_series_product_test.py
@@ -1,11 +1,13 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/largest-series-product/canonical-data.json
+# File last updated on 2023-07-19
+
import unittest
from largest_series_product import (
largest_product,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class LargestSeriesProductTest(unittest.TestCase):
def test_finds_the_largest_product_if_span_equals_length(self):
@@ -46,12 +48,6 @@ def test_rejects_span_longer_than_string_length(self):
err.exception.args[0], "span must be smaller than string length"
)
- def test_reports_1_for_empty_string_and_empty_product_0_span(self):
- self.assertEqual(largest_product("", 0), 1)
-
- def test_reports_1_for_nonempty_string_and_empty_product_0_span(self):
- self.assertEqual(largest_product("123", 0), 1)
-
def test_rejects_empty_string_and_nonzero_span(self):
with self.assertRaises(ValueError) as err:
largest_product("", 1)
diff --git a/exercises/practice/leap/.meta/template.j2 b/exercises/practice/leap/.meta/template.j2
index 968306fcb71..d3607dcd3e3 100644
--- a/exercises/practice/leap/.meta/template.j2
+++ b/exercises/practice/leap/.meta/template.j2
@@ -1,5 +1,7 @@
{%- import "generator_macros.j2" as macros with context -%}
-{{ macros.header() }}
+{{ macros.canonical_ref() }}
+
+{{ macros.header()}}
class {{ exercise | camel_case }}Test(unittest.TestCase):
{% for case in cases -%}
@@ -11,5 +13,3 @@ class {{ exercise | camel_case }}Test(unittest.TestCase):
{{- case ["expected"] }}
)
{% endfor %}
-
-{{ macros.footer() }}
diff --git a/exercises/practice/leap/leap_test.py b/exercises/practice/leap/leap_test.py
index e51aeb423a7..6a1d732c987 100644
--- a/exercises/practice/leap/leap_test.py
+++ b/exercises/practice/leap/leap_test.py
@@ -1,11 +1,13 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/leap/canonical-data.json
+# File last updated on 2023-07-19
+
import unittest
from leap import (
leap_year,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class LeapTest(unittest.TestCase):
def test_year_not_divisible_by_4_in_common_year(self):
@@ -34,7 +36,3 @@ def test_year_divisible_by_400_but_not_by_125_is_still_a_leap_year(self):
def test_year_divisible_by_200_not_divisible_by_400_in_common_year(self):
self.assertIs(leap_year(1800), False)
-
-
-if __name__ == "__main__":
- unittest.main()
diff --git a/exercises/practice/ledger/.meta/config.json b/exercises/practice/ledger/.meta/config.json
index eeb5e2ccdf1..5b9998ba1b3 100644
--- a/exercises/practice/ledger/.meta/config.json
+++ b/exercises/practice/ledger/.meta/config.json
@@ -3,7 +3,9 @@
"cmccandless"
],
"contributors": [
+ "BethanyG",
"Dog",
+ "IsaaG",
"tqa236"
],
"files": {
diff --git a/exercises/practice/ledger/.meta/template.j2 b/exercises/practice/ledger/.meta/template.j2
new file mode 100644
index 00000000000..a3dbcf26f70
--- /dev/null
+++ b/exercises/practice/ledger/.meta/template.j2
@@ -0,0 +1,24 @@
+{%- import "generator_macros.j2" as macros with context -%}
+{{ macros.canonical_ref() }}
+
+{{ macros.header(imports=["format_entries", "create_entry"]) }}
+
+class {{ exercise | camel_case }}Test(unittest.TestCase):
+ maxDiff = 5000
+ {%- for case in cases %}
+
+ def test_{{ case["description"] | to_snake }}(self):
+ currency = '{{- case["input"]["currency"] }}'
+ locale = '{{- case["input"]["locale"] }}'
+ entries = [
+ {%- for entry in case["input"]["entries"] %}
+ create_entry('{{ entry["date"] }}', '{{ entry["description"] }}', {{ entry["amountInCents"] }}),
+ {%- endfor %}
+ ]
+ expected = '\n'.join([
+ {%- for line in case["expected"] %}
+ '{{- line -}}',
+ {%- endfor %}
+ ])
+ self.assertEqual(format_entries(currency, locale, entries), expected)
+ {%- endfor %}
diff --git a/exercises/practice/ledger/.meta/tests.toml b/exercises/practice/ledger/.meta/tests.toml
new file mode 100644
index 00000000000..e71dfbfcafd
--- /dev/null
+++ b/exercises/practice/ledger/.meta/tests.toml
@@ -0,0 +1,43 @@
+# 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.
+
+[d131ecae-a30e-436c-b8f3-858039a27234]
+description = "empty ledger"
+
+[ce4618d2-9379-4eca-b207-9df1c4ec8aaa]
+description = "one entry"
+
+[8d02e9cb-e6ee-4b77-9ce4-e5aec8eb5ccb]
+description = "credit and debit"
+
+[502c4106-0371-4e7c-a7d8-9ce33f16ccb1]
+description = "multiple entries on same date ordered by description"
+
+[29dd3659-6c2d-4380-94a8-6d96086e28e1]
+description = "final order tie breaker is change"
+
+[9b9712a6-f779-4f5c-a759-af65615fcbb9]
+description = "overlong description is truncated"
+
+[67318aad-af53-4f3d-aa19-1293b4d4c924]
+description = "euros"
+
+[bdc499b6-51f5-4117-95f2-43cb6737208e]
+description = "Dutch locale"
+
+[86591cd4-1379-4208-ae54-0ee2652b4670]
+description = "Dutch locale and euros"
+
+[876bcec8-d7d7-4ba4-82bd-b836ac87c5d2]
+description = "Dutch negative number with 3 digits before decimal point"
+
+[29670d1c-56be-492a-9c5e-427e4b766309]
+description = "American negative number with 3 digits before decimal point"
diff --git a/exercises/practice/ledger/ledger.py b/exercises/practice/ledger/ledger.py
index 493109b847b..c0dcf94f738 100644
--- a/exercises/practice/ledger/ledger.py
+++ b/exercises/practice/ledger/ledger.py
@@ -296,3 +296,4 @@ def format_entries(currency, locale, entries):
change_str = ' ' + change_str
table += change_str
return table
+
diff --git a/exercises/practice/ledger/ledger_test.py b/exercises/practice/ledger/ledger_test.py
index f0de049df19..cc37167146d 100644
--- a/exercises/practice/ledger/ledger_test.py
+++ b/exercises/practice/ledger/ledger_test.py
@@ -1,147 +1,173 @@
-# -*- coding: utf-8 -*-
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/ledger/canonical-data.json
+# File last updated on 2023-07-19
+
import unittest
-from ledger import format_entries, create_entry
+from ledger import (
+ format_entries,
+ create_entry,
+)
class LedgerTest(unittest.TestCase):
maxDiff = 5000
def test_empty_ledger(self):
- currency = 'USD'
- locale = 'en_US'
+ currency = "USD"
+ locale = "en_US"
entries = []
- expected = 'Date | Description | Change '
+ expected = "\n".join(
+ [
+ "Date | Description | Change ",
+ ]
+ )
self.assertEqual(format_entries(currency, locale, entries), expected)
def test_one_entry(self):
- currency = 'USD'
- locale = 'en_US'
+ currency = "USD"
+ locale = "en_US"
entries = [
- create_entry('2015-01-01', 'Buy present', -1000),
+ create_entry("2015-01-01", "Buy present", -1000),
]
- expected = '\n'.join([
- 'Date | Description | Change ',
- '01/01/2015 | Buy present | ($10.00)',
- ])
+ expected = "\n".join(
+ [
+ "Date | Description | Change ",
+ "01/01/2015 | Buy present | ($10.00)",
+ ]
+ )
self.assertEqual(format_entries(currency, locale, entries), expected)
def test_credit_and_debit(self):
- currency = 'USD'
- locale = 'en_US'
+ currency = "USD"
+ locale = "en_US"
entries = [
- create_entry('2015-01-02', 'Get present', 1000),
- create_entry('2015-01-01', 'Buy present', -1000),
+ create_entry("2015-01-02", "Get present", 1000),
+ create_entry("2015-01-01", "Buy present", -1000),
]
- expected = '\n'.join([
- 'Date | Description | Change ',
- '01/01/2015 | Buy present | ($10.00)',
- '01/02/2015 | Get present | $10.00 ',
- ])
+ expected = "\n".join(
+ [
+ "Date | Description | Change ",
+ "01/01/2015 | Buy present | ($10.00)",
+ "01/02/2015 | Get present | $10.00 ",
+ ]
+ )
self.assertEqual(format_entries(currency, locale, entries), expected)
def test_multiple_entries_on_same_date_ordered_by_description(self):
- currency = 'USD'
- locale = 'en_US'
+ currency = "USD"
+ locale = "en_US"
entries = [
- create_entry('2015-01-02', 'Get present', 1000),
- create_entry('2015-01-01', 'Buy present', -1000),
+ create_entry("2015-01-02", "Get present", 1000),
+ create_entry("2015-01-01", "Buy present", -1000),
]
- expected = '\n'.join([
- 'Date | Description | Change ',
- '01/01/2015 | Buy present | ($10.00)',
- '01/02/2015 | Get present | $10.00 ',
- ])
+ expected = "\n".join(
+ [
+ "Date | Description | Change ",
+ "01/01/2015 | Buy present | ($10.00)",
+ "01/02/2015 | Get present | $10.00 ",
+ ]
+ )
self.assertEqual(format_entries(currency, locale, entries), expected)
def test_final_order_tie_breaker_is_change(self):
- currency = 'USD'
- locale = 'en_US'
+ currency = "USD"
+ locale = "en_US"
entries = [
- create_entry('2015-01-01', 'Something', 0),
- create_entry('2015-01-01', 'Something', -1),
- create_entry('2015-01-01', 'Something', 1),
+ create_entry("2015-01-01", "Something", 0),
+ create_entry("2015-01-01", "Something", -1),
+ create_entry("2015-01-01", "Something", 1),
]
- expected = '\n'.join([
- 'Date | Description | Change ',
- '01/01/2015 | Something | ($0.01)',
- '01/01/2015 | Something | $0.00 ',
- '01/01/2015 | Something | $0.01 ',
- ])
+ expected = "\n".join(
+ [
+ "Date | Description | Change ",
+ "01/01/2015 | Something | ($0.01)",
+ "01/01/2015 | Something | $0.00 ",
+ "01/01/2015 | Something | $0.01 ",
+ ]
+ )
self.assertEqual(format_entries(currency, locale, entries), expected)
- def test_overlong_description(self):
- currency = 'USD'
- locale = 'en_US'
+ def test_overlong_description_is_truncated(self):
+ currency = "USD"
+ locale = "en_US"
entries = [
- create_entry('2015-01-01', 'Freude schoner Gotterfunken', -123456),
+ create_entry("2015-01-01", "Freude schoner Gotterfunken", -123456),
]
- expected = '\n'.join([
- 'Date | Description | Change ',
- '01/01/2015 | Freude schoner Gotterf... | ($1,234.56)',
- ])
+ expected = "\n".join(
+ [
+ "Date | Description | Change ",
+ "01/01/2015 | Freude schoner Gotterf... | ($1,234.56)",
+ ]
+ )
self.assertEqual(format_entries(currency, locale, entries), expected)
def test_euros(self):
- currency = 'EUR'
- locale = 'en_US'
+ currency = "EUR"
+ locale = "en_US"
entries = [
- create_entry('2015-01-01', 'Buy present', -1000),
+ create_entry("2015-01-01", "Buy present", -1000),
]
- expected = '\n'.join([
- 'Date | Description | Change ',
- u'01/01/2015 | Buy present | (€10.00)',
- ])
+ expected = "\n".join(
+ [
+ "Date | Description | Change ",
+ "01/01/2015 | Buy present | (€10.00)",
+ ]
+ )
self.assertEqual(format_entries(currency, locale, entries), expected)
def test_dutch_locale(self):
- currency = 'USD'
- locale = 'nl_NL'
+ currency = "USD"
+ locale = "nl_NL"
entries = [
- create_entry('2015-03-12', 'Buy present', 123456),
+ create_entry("2015-03-12", "Buy present", 123456),
]
- expected = '\n'.join([
- 'Datum | Omschrijving | Verandering ',
- '12-03-2015 | Buy present | $ 1.234,56 ',
- ])
+ expected = "\n".join(
+ [
+ "Datum | Omschrijving | Verandering ",
+ "12-03-2015 | Buy present | $ 1.234,56 ",
+ ]
+ )
self.assertEqual(format_entries(currency, locale, entries), expected)
def test_dutch_locale_and_euros(self):
- currency = 'EUR'
- locale = 'nl_NL'
+ currency = "EUR"
+ locale = "nl_NL"
entries = [
- create_entry('2015-03-12', 'Buy present', 123456),
+ create_entry("2015-03-12", "Buy present", 123456),
]
- expected = '\n'.join([
- 'Datum | Omschrijving | Verandering ',
- u'12-03-2015 | Buy present | € 1.234,56 ',
- ])
+ expected = "\n".join(
+ [
+ "Datum | Omschrijving | Verandering ",
+ "12-03-2015 | Buy present | € 1.234,56 ",
+ ]
+ )
self.assertEqual(format_entries(currency, locale, entries), expected)
def test_dutch_negative_number_with_3_digits_before_decimal_point(self):
- currency = 'USD'
- locale = 'nl_NL'
+ currency = "USD"
+ locale = "nl_NL"
entries = [
- create_entry('2015-03-12', 'Buy present', -12345),
+ create_entry("2015-03-12", "Buy present", -12345),
]
- expected = '\n'.join([
- 'Datum | Omschrijving | Verandering ',
- '12-03-2015 | Buy present | $ -123,45 ',
- ])
+ expected = "\n".join(
+ [
+ "Datum | Omschrijving | Verandering ",
+ "12-03-2015 | Buy present | $ -123,45 ",
+ ]
+ )
self.assertEqual(format_entries(currency, locale, entries), expected)
def test_american_negative_number_with_3_digits_before_decimal_point(self):
- currency = 'USD'
- locale = 'en_US'
+ currency = "USD"
+ locale = "en_US"
entries = [
- create_entry('2015-03-12', 'Buy present', -12345),
+ create_entry("2015-03-12", "Buy present", -12345),
]
- expected = '\n'.join([
- 'Date | Description | Change ',
- '03/12/2015 | Buy present | ($123.45)',
- ])
+ expected = "\n".join(
+ [
+ "Date | Description | Change ",
+ "03/12/2015 | Buy present | ($123.45)",
+ ]
+ )
self.assertEqual(format_entries(currency, locale, entries), expected)
-
-
-if __name__ == '__main__':
- unittest.main()
diff --git a/exercises/practice/linked-list/.docs/instructions.md b/exercises/practice/linked-list/.docs/instructions.md
index 3d949d39357..edf4055b38c 100644
--- a/exercises/practice/linked-list/.docs/instructions.md
+++ b/exercises/practice/linked-list/.docs/instructions.md
@@ -1,26 +1,26 @@
# Instructions
-Implement a doubly linked list.
+Your team has decided to use a doubly linked list to represent each train route in the schedule.
+Each station along the train's route will be represented by a node in the linked list.
-Like an array, a linked list is a simple linear data structure.
-Several common data types can be implemented using linked lists, like queues, stacks, and associative arrays.
+You don't need to worry about arrival and departure times at the stations.
+Each station will simply be represented by a number.
-A linked list is a collection of data elements called *nodes*.
-In a *singly linked list* each node holds a value and a link to the next node.
-In a *doubly linked list* each node also holds a link to the previous node.
+Routes can be extended, adding stations to the beginning or end of a route.
+They can also be shortened by removing stations from the beginning or the end of a route.
-You will write an implementation of a doubly linked list.
-Implement a Node to hold a value and pointers to the next and previous nodes.
-Then implement a List which holds references to the first and last node and offers an array-like interface for adding and removing items:
+Sometimes a station gets closed down, and in that case the station needs to be removed from the route, even if it is not at the beginning or end of the route.
-- `push` (*insert value at back*);
-- `pop` (*remove value at back*);
-- `shift` (*remove value at front*).
-- `unshift` (*insert value at front*);
+The size of a route is measured not by how far the train travels, but by how many stations it stops at.
-To keep your implementation simple, the tests will not cover error conditions.
-Specifically: `pop` or `shift` will never be called on an empty list.
+~~~~exercism/note
+The linked list is a fundamental data structure in computer science, often used in the implementation of other data structures.
+As the name suggests, it is a list of nodes that are linked together.
+It is a list of "nodes", where each node links to its neighbor or neighbors.
+In a **singly linked list** each node links only to the node that follows it.
+In a **doubly linked list** each node links to both the node that comes before, as well as the node that comes after.
-Read more about [linked lists on Wikipedia][linked-lists].
+If you want to dig deeper into linked lists, check out [this article][intro-linked-list] that explains it using nice drawings.
-[linked-lists]: https://en.wikipedia.org/wiki/Linked_list
+[intro-linked-list]: https://medium.com/basecs/whats-a-linked-list-anyway-part-1-d8b7e6508b9d
+~~~~
diff --git a/exercises/practice/linked-list/.docs/introduction.md b/exercises/practice/linked-list/.docs/introduction.md
new file mode 100644
index 00000000000..6e83ae7b6e5
--- /dev/null
+++ b/exercises/practice/linked-list/.docs/introduction.md
@@ -0,0 +1,6 @@
+# Introduction
+
+You are working on a project to develop a train scheduling system for a busy railway network.
+
+You've been asked to develop a prototype for the train routes in the scheduling system.
+Each route consists of a sequence of train stations that a given train stops at.
diff --git a/exercises/practice/linked-list/.meta/template.j2 b/exercises/practice/linked-list/.meta/template.j2
index a753efc3df4..604c5f5163c 100644
--- a/exercises/practice/linked-list/.meta/template.j2
+++ b/exercises/practice/linked-list/.meta/template.j2
@@ -1,4 +1,8 @@
{%- import "generator_macros.j2" as macros with context -%}
+{{ macros.canonical_ref() }}
+
+{{ macros.header(["LinkedList"]) }}
+
{% macro test_case(case) -%}
def test_{{ case["description"] | to_snake }}(self):
lst = LinkedList()
@@ -45,7 +49,6 @@
{%- endif %}
{%- endmacro %}
-{{ macros.header(["LinkedList"]) }}
class {{ exercise | camel_case }}Test(unittest.TestCase):
{% for case in cases -%}
diff --git a/exercises/practice/linked-list/linked_list_test.py b/exercises/practice/linked-list/linked_list_test.py
index 3af5bc221e4..6724a1ebcef 100644
--- a/exercises/practice/linked-list/linked_list_test.py
+++ b/exercises/practice/linked-list/linked_list_test.py
@@ -1,11 +1,13 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/linked-list/canonical-data.json
+# File last updated on 2023-07-19
+
import unittest
from linked_list import (
LinkedList,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class LinkedListTest(unittest.TestCase):
def test_pop_gets_element_from_the_list(self):
diff --git a/exercises/practice/list-ops/.docs/instructions.md b/exercises/practice/list-ops/.docs/instructions.md
index d34533387ae..ccfc2f8b2ac 100644
--- a/exercises/practice/list-ops/.docs/instructions.md
+++ b/exercises/practice/list-ops/.docs/instructions.md
@@ -12,6 +12,8 @@ The precise number and names of the operations to be implemented will be track d
- `filter` (*given a predicate and a list, return the list of all items for which `predicate(item)` is True*);
- `length` (*given a list, return the total number of items within it*);
- `map` (*given a function and a list, return the list of the results of applying `function(item)` on all items*);
-- `foldl` (*given a function, a list, and initial accumulator, fold (reduce) each item into the accumulator from the left using `function(accumulator, item)`*);
-- `foldr` (*given a function, a list, and an initial accumulator, fold (reduce) each item into the accumulator from the right using `function(item, accumulator)`*);
-- `reverse` (*given a list, return a list with all the original items, but in reversed order*);
+- `foldl` (*given a function, a list, and initial accumulator, fold (reduce) each item into the accumulator from the left*);
+- `foldr` (*given a function, a list, and an initial accumulator, fold (reduce) each item into the accumulator from the right*);
+- `reverse` (*given a list, return a list with all the original items, but in reversed order*).
+
+Note, the ordering in which arguments are passed to the fold functions (`foldl`, `foldr`) is significant.
diff --git a/exercises/practice/list-ops/.meta/additional_tests.json b/exercises/practice/list-ops/.meta/additional_tests.json
index 7eb1d65c767..39c0a8bfa63 100644
--- a/exercises/practice/list-ops/.meta/additional_tests.json
+++ b/exercises/practice/list-ops/.meta/additional_tests.json
@@ -6,7 +6,7 @@
"input": {
"list": ["e", "x", "e", "r", "c", "i", "s", "m"],
"initial": "!",
- "function": "(x, y) -> x + y"
+ "function": "(acc, el) -> el + acc"
},
"expected": "exercism!"
},
@@ -19,4 +19,4 @@
"expected": [1, "cat", 4.0, "xyz"]
}
]
-}
\ No newline at end of file
+}
diff --git a/exercises/practice/list-ops/.meta/config.json b/exercises/practice/list-ops/.meta/config.json
index efc025a3543..cdb33138a4e 100644
--- a/exercises/practice/list-ops/.meta/config.json
+++ b/exercises/practice/list-ops/.meta/config.json
@@ -8,6 +8,7 @@
"Dog",
"dvermd",
"gabriel376",
+ "IsaacG",
"N-Parsons",
"pheanex",
"rootulp",
diff --git a/exercises/practice/list-ops/.meta/example.py b/exercises/practice/list-ops/.meta/example.py
index ee43248f99e..75f45033e2b 100644
--- a/exercises/practice/list-ops/.meta/example.py
+++ b/exercises/practice/list-ops/.meta/example.py
@@ -29,7 +29,7 @@ def foldr(function, list, initial):
if len(list) == 0:
return initial
else:
- return function(list[0], foldr(function, list[1:], initial))
+ return function(foldr(function, list[1:], initial), list[0])
def reverse(list):
diff --git a/exercises/practice/list-ops/.meta/template.j2 b/exercises/practice/list-ops/.meta/template.j2
index c346d3c20fb..2e0a1bdd639 100644
--- a/exercises/practice/list-ops/.meta/template.j2
+++ b/exercises/practice/list-ops/.meta/template.j2
@@ -1,8 +1,11 @@
{%- import "generator_macros.j2" as macros with context -%}
+{{ macros.canonical_ref() }}
+
+{{ macros.header(imports=["append", "concat", "foldl", "foldr", "length", "reverse", "filter as list_ops_filter", "map as list_ops_map"]) }}
+
{% macro lambdify(function) -%}
{% set function = function.replace("(", "", 1).replace(")", "", 1).replace(" ->", ":") %}
{% set function = function.replace("modulo", "%") %}
- {% set function = function.replace("/", "//") %}
lambda {{function}}
{%- endmacro %}
@@ -37,7 +40,6 @@
{{ stringify(case["expected"]) }}
)
{%- endmacro %}
-{{ macros.header(imports=["append", "concat", "foldl", "foldr", "length", "reverse", "filter as list_ops_filter", "map as list_ops_map"]) }}
class {{ exercise | camel_case }}Test(unittest.TestCase):
{% for casegroup in cases -%}
@@ -53,6 +55,3 @@ class {{ exercise | camel_case }}Test(unittest.TestCase):
{{ test_case(case) }}
{% endfor %}
{%- endif %}
-
-
-{{ macros.footer() }}
diff --git a/exercises/practice/list-ops/.meta/tests.toml b/exercises/practice/list-ops/.meta/tests.toml
index 7fe3c8d1a9c..08b1edc0443 100644
--- a/exercises/practice/list-ops/.meta/tests.toml
+++ b/exercises/practice/list-ops/.meta/tests.toml
@@ -71,7 +71,6 @@ reimplements = "e56df3eb-9405-416a-b13a-aabb4c3b5194"
[d7fcad99-e88e-40e1-a539-4c519681f390]
description = "folds (reduces) the given list from the left with a function -> direction dependent function applied to non-empty list"
reimplements = "d2cf5644-aee1-4dfc-9b88-06896676fe27"
-include = false
[aeb576b9-118e-4a57-a451-db49fac20fdc]
description = "folds (reduces) the given list from the right with a function -> empty list"
@@ -96,7 +95,6 @@ reimplements = "c4b64e58-313e-4c47-9c68-7764964efb8e"
[8066003b-f2ff-437e-9103-66e6df474844]
description = "folds (reduces) the given list from the right with a function -> direction dependent function applied to non-empty list"
reimplements = "be396a53-c074-4db3-8dd6-f7ed003cce7c"
-include = false
[94231515-050e-4841-943d-d4488ab4ee30]
description = "reverse the elements of the list -> empty list"
diff --git a/exercises/practice/list-ops/list_ops_test.py b/exercises/practice/list-ops/list_ops_test.py
index cff6156dc65..ea0d2136599 100644
--- a/exercises/practice/list-ops/list_ops_test.py
+++ b/exercises/practice/list-ops/list_ops_test.py
@@ -1,3 +1,7 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/list-ops/canonical-data.json
+# File last updated on 2023-07-19
+
import unittest
from list_ops import (
@@ -11,8 +15,6 @@
map as list_ops_map,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class ListOpsTest(unittest.TestCase):
def test_append_empty_lists(self):
@@ -63,12 +65,18 @@ def test_foldl_empty_list(self):
def test_foldl_direction_independent_function_applied_to_non_empty_list(self):
self.assertEqual(foldl(lambda acc, el: el + acc, [1, 2, 3, 4], 5), 15)
+ def test_foldl_direction_dependent_function_applied_to_non_empty_list(self):
+ self.assertEqual(foldl(lambda acc, el: el / acc, [1, 2, 3, 4], 24), 64)
+
def test_foldr_empty_list(self):
self.assertEqual(foldr(lambda acc, el: el * acc, [], 2), 2)
def test_foldr_direction_independent_function_applied_to_non_empty_list(self):
self.assertEqual(foldr(lambda acc, el: el + acc, [1, 2, 3, 4], 5), 15)
+ def test_foldr_direction_dependent_function_applied_to_non_empty_list(self):
+ self.assertEqual(foldr(lambda acc, el: el / acc, [1, 2, 3, 4], 24), 9)
+
def test_reverse_empty_list(self):
self.assertEqual(reverse([]), [])
@@ -84,13 +92,11 @@ def test_reverse_list_of_lists_is_not_flattened(self):
def test_foldr_foldr_add_string(self):
self.assertEqual(
- foldr(lambda x, y: x + y, ["e", "x", "e", "r", "c", "i", "s", "m"], "!"),
+ foldr(
+ lambda acc, el: el + acc, ["e", "x", "e", "r", "c", "i", "s", "m"], "!"
+ ),
"exercism!",
)
def test_reverse_reverse_mixed_types(self):
self.assertEqual(reverse(["xyz", 4.0, "cat", 1]), [1, "cat", 4.0, "xyz"])
-
-
-if __name__ == "__main__":
- unittest.main()
diff --git a/exercises/practice/luhn/.meta/template.j2 b/exercises/practice/luhn/.meta/template.j2
index af8489b3c89..568d26efc61 100644
--- a/exercises/practice/luhn/.meta/template.j2
+++ b/exercises/practice/luhn/.meta/template.j2
@@ -1,4 +1,8 @@
{%- import "generator_macros.j2" as macros with context -%}
+{{ macros.canonical_ref() }}
+
+{{ macros.header(["Luhn"]) }}
+
{%- macro test_case(group_name, case) -%}
{%- set input = case["input"] -%}
def test_{{ group_name | to_snake }}_
@@ -16,8 +20,7 @@
"{{ val | camel_case }}",
{% endfor %}]
)
-{% endmacro -%}
-{{ macros.header(["Luhn"]) }}
+{% endmacro %}
class {{ exercise | camel_case }}Test(unittest.TestCase):
{% for case in cases %}
diff --git a/exercises/practice/luhn/luhn_test.py b/exercises/practice/luhn/luhn_test.py
index bbc1f8eb1f8..58234eb7d55 100644
--- a/exercises/practice/luhn/luhn_test.py
+++ b/exercises/practice/luhn/luhn_test.py
@@ -1,11 +1,13 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/luhn/canonical-data.json
+# File last updated on 2023-07-19
+
import unittest
from luhn import (
Luhn,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class LuhnTest(unittest.TestCase):
def test_single_digit_strings_can_not_be_valid(self):
diff --git a/exercises/practice/markdown/.meta/template.j2 b/exercises/practice/markdown/.meta/template.j2
index da2a037cec8..e0b5f717c7b 100644
--- a/exercises/practice/markdown/.meta/template.j2
+++ b/exercises/practice/markdown/.meta/template.j2
@@ -1,5 +1,7 @@
{%- import "generator_macros.j2" as macros with context -%}
-{{ macros.header() }}
+{{ macros.canonical_ref() }}
+
+{{ macros.header()}}
class {{ exercise | camel_case }}Test(unittest.TestCase):
{% for case in cases -%}
diff --git a/exercises/practice/markdown/markdown_test.py b/exercises/practice/markdown/markdown_test.py
index 5c059c725a8..ad6d243a635 100644
--- a/exercises/practice/markdown/markdown_test.py
+++ b/exercises/practice/markdown/markdown_test.py
@@ -1,11 +1,13 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/markdown/canonical-data.json
+# File last updated on 2023-07-19
+
import unittest
from markdown import (
parse,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class MarkdownTest(unittest.TestCase):
def test_parses_normal_text_as_a_paragraph(self):
diff --git a/exercises/practice/matching-brackets/.meta/template.j2 b/exercises/practice/matching-brackets/.meta/template.j2
index bc8f0830264..53abdc8efbe 100644
--- a/exercises/practice/matching-brackets/.meta/template.j2
+++ b/exercises/practice/matching-brackets/.meta/template.j2
@@ -1,5 +1,7 @@
{%- import "generator_macros.j2" as macros with context -%}
-{{ macros.header() }}
+{{ macros.canonical_ref() }}
+
+{{ macros.header()}}
class {{ exercise | camel_case }}Test(unittest.TestCase):
{% for case in cases -%}
@@ -8,7 +10,3 @@ class {{ exercise | camel_case }}Test(unittest.TestCase):
{%- set expected = case["expected"] %}
self.assertEqual({{ case["property"] | to_snake }}({{ "{!r}".format(value) }}), {{ expected }})
{% endfor %}
-
-{{ macros.footer() }}
-
-
diff --git a/exercises/practice/matching-brackets/matching_brackets_test.py b/exercises/practice/matching-brackets/matching_brackets_test.py
index fd23bd78403..a8321d94ad1 100644
--- a/exercises/practice/matching-brackets/matching_brackets_test.py
+++ b/exercises/practice/matching-brackets/matching_brackets_test.py
@@ -1,11 +1,13 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/matching-brackets/canonical-data.json
+# File last updated on 2023-07-19
+
import unittest
from matching_brackets import (
is_paired,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class MatchingBracketsTest(unittest.TestCase):
def test_paired_square_brackets(self):
@@ -72,7 +74,3 @@ def test_complex_latex_expression(self):
),
True,
)
-
-
-if __name__ == "__main__":
- unittest.main()
diff --git a/exercises/practice/matrix/.meta/template.j2 b/exercises/practice/matrix/.meta/template.j2
index ae1c08c3b68..090f7d85c88 100644
--- a/exercises/practice/matrix/.meta/template.j2
+++ b/exercises/practice/matrix/.meta/template.j2
@@ -1,16 +1,15 @@
{%- import "generator_macros.j2" as macros with context -%}
+{{ macros.canonical_ref() }}
+
+{{ macros.header(["Matrix"])}}
+
{%- macro testcase(case) %}
def test_{{ case["description"] | to_snake }}(self):
matrix = Matrix("{{ case["input"]["string"] | replace('\n', '\\n') }}")
self.assertEqual(matrix.{{ case["property"] | to_snake }}({{ case["input"]["index"]}} ), {{ case["expected"] }})
-{% endmacro -%}
-{{ macros.header(["Matrix"])}}
+{% endmacro %}
class {{ exercise | camel_case }}Test(unittest.TestCase):
{%- for case in cases -%}
{{- testcase(case) -}}
{% endfor %}
-
-
-if __name__ == '__main__':
- unittest.main()
diff --git a/exercises/practice/matrix/matrix_test.py b/exercises/practice/matrix/matrix_test.py
index 10820ab6c12..6f5ce7da5fe 100644
--- a/exercises/practice/matrix/matrix_test.py
+++ b/exercises/practice/matrix/matrix_test.py
@@ -1,11 +1,13 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/matrix/canonical-data.json
+# File last updated on 2023-07-19
+
import unittest
from matrix import (
Matrix,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class MatrixTest(unittest.TestCase):
def test_extract_row_from_one_number_matrix(self):
@@ -39,7 +41,3 @@ def test_can_extract_column_from_non_square_matrix_with_no_corresponding_row(sel
def test_extract_column_where_numbers_have_different_widths(self):
matrix = Matrix("89 1903 3\n18 3 1\n9 4 800")
self.assertEqual(matrix.column(2), [1903, 3, 4])
-
-
-if __name__ == "__main__":
- unittest.main()
diff --git a/exercises/practice/meetup/.meta/template.j2 b/exercises/practice/meetup/.meta/template.j2
index 39d9cf8db84..8078c5a3a34 100644
--- a/exercises/practice/meetup/.meta/template.j2
+++ b/exercises/practice/meetup/.meta/template.j2
@@ -1,4 +1,9 @@
{%- import "generator_macros.j2" as macros with context -%}
+{{ macros.canonical_ref() }}
+
+from datetime import date
+{{ macros.header(imports=["meetup", "MeetupDayException"]) }}
+
{% macro test_case(case) -%}
def test_{{ case["description"] | to_snake }}(self):
{%- set input = namespace() %}
@@ -18,9 +23,6 @@
{% endif %}
{%- endmacro %}
-from datetime import date
-{{ macros.header(imports=["meetup", "MeetupDayException"]) }}
-
class {{ exercise | camel_case }}Test(unittest.TestCase):
{% for case in cases -%}
{{ test_case(case) }}
diff --git a/exercises/practice/meetup/meetup_test.py b/exercises/practice/meetup/meetup_test.py
index 9ecc3d8a1df..ec9e22b556d 100644
--- a/exercises/practice/meetup/meetup_test.py
+++ b/exercises/practice/meetup/meetup_test.py
@@ -1,3 +1,7 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/meetup/canonical-data.json
+# File last updated on 2023-07-19
+
from datetime import date
import unittest
@@ -6,8 +10,6 @@
MeetupDayException,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class MeetupTest(unittest.TestCase):
def test_when_teenth_monday_is_the_13th_the_first_day_of_the_teenth_week(self):
diff --git a/exercises/practice/minesweeper/.meta/template.j2 b/exercises/practice/minesweeper/.meta/template.j2
index b34be795739..68570a9fd4b 100644
--- a/exercises/practice/minesweeper/.meta/template.j2
+++ b/exercises/practice/minesweeper/.meta/template.j2
@@ -1,8 +1,11 @@
{%- import "generator_macros.j2" as macros with context -%}
+{{ macros.canonical_ref() }}
+
+{{ macros.header()}}
+
{%- macro test_call(case) -%}
{{ case["property"] | to_snake }}({{ case["input"]["minefield"] }})
-{%- endmacro -%}
-{{ macros.header() }}
+{%- endmacro %}
class {{ exercise | camel_case }}Test(unittest.TestCase):
{% for case in cases -%}
diff --git a/exercises/practice/minesweeper/minesweeper_test.py b/exercises/practice/minesweeper/minesweeper_test.py
index d5e6b78b7f4..f6ffab43609 100644
--- a/exercises/practice/minesweeper/minesweeper_test.py
+++ b/exercises/practice/minesweeper/minesweeper_test.py
@@ -1,11 +1,13 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/minesweeper/canonical-data.json
+# File last updated on 2023-07-19
+
import unittest
from minesweeper import (
annotate,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class MinesweeperTest(unittest.TestCase):
def test_no_rows(self):
diff --git a/exercises/practice/nth-prime/.meta/template.j2 b/exercises/practice/nth-prime/.meta/template.j2
index 453ade58894..ab3d42adff7 100644
--- a/exercises/practice/nth-prime/.meta/template.j2
+++ b/exercises/practice/nth-prime/.meta/template.j2
@@ -1,4 +1,8 @@
{%- import "generator_macros.j2" as macros with context -%}
+{{ macros.canonical_ref() }}
+
+{{ macros.header()}}
+
{% macro test_case(case) -%}
{%- set input = case["input"] -%}
def test_{{ case["description"] | to_snake }}(self):
@@ -14,7 +18,6 @@
)
{%- endif %}
{%- endmacro %}
-{{ macros.header()}}
def prime_range(n):
"""Returns a list of the first n primes"""
diff --git a/exercises/practice/nth-prime/nth_prime_test.py b/exercises/practice/nth-prime/nth_prime_test.py
index 2a3e1b3f2e8..6f30f30aa0f 100644
--- a/exercises/practice/nth-prime/nth_prime_test.py
+++ b/exercises/practice/nth-prime/nth_prime_test.py
@@ -1,11 +1,13 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/nth-prime/canonical-data.json
+# File last updated on 2023-07-19
+
import unittest
from nth_prime import (
prime,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
def prime_range(n):
"""Returns a list of the first n primes"""
diff --git a/exercises/practice/nucleotide-count/.docs/instructions.md b/exercises/practice/nucleotide-count/.docs/instructions.md
index 57667134b72..548d9ba5a5e 100644
--- a/exercises/practice/nucleotide-count/.docs/instructions.md
+++ b/exercises/practice/nucleotide-count/.docs/instructions.md
@@ -1,10 +1,12 @@
# Instructions
-Each of us inherits from our biological parents a set of chemical instructions known as DNA that influence how our bodies are constructed. All known life depends on DNA!
+Each of us inherits from our biological parents a set of chemical instructions known as DNA that influence how our bodies are constructed.
+All known life depends on DNA!
> Note: You do not need to understand anything about nucleotides or DNA to complete this exercise.
-DNA is a long chain of other chemicals and the most important are the four nucleotides, adenine, cytosine, guanine and thymine. A single DNA chain can contain billions of these four nucleotides and the order in which they occur is important!
+DNA is a long chain of other chemicals and the most important are the four nucleotides, adenine, cytosine, guanine and thymine.
+A single DNA chain can contain billions of these four nucleotides and the order in which they occur is important!
We call the order of these nucleotides in a bit of DNA a "DNA sequence".
We represent a DNA sequence as an ordered collection of these four nucleotides and a common way to do that is with a string of characters such as "ATTACG" for a DNA sequence of 6 nucleotides.
diff --git a/exercises/practice/nucleotide-count/.meta/config.json b/exercises/practice/nucleotide-count/.meta/config.json
index 4e91bb7ee9f..e0c108f7b88 100644
--- a/exercises/practice/nucleotide-count/.meta/config.json
+++ b/exercises/practice/nucleotide-count/.meta/config.json
@@ -28,5 +28,5 @@
]
},
"source": "The Calculating DNA Nucleotides_problem at Rosalind",
- "source_url": "http://rosalind.info/problems/dna/"
+ "source_url": "https://rosalind.info/problems/dna/"
}
diff --git a/exercises/practice/ocr-numbers/.meta/template.j2 b/exercises/practice/ocr-numbers/.meta/template.j2
index c829331802b..94286b1ef8b 100644
--- a/exercises/practice/ocr-numbers/.meta/template.j2
+++ b/exercises/practice/ocr-numbers/.meta/template.j2
@@ -1,5 +1,7 @@
{%- import "generator_macros.j2" as macros with context -%}
-{{ macros.header() }}
+{{ macros.canonical_ref() }}
+
+{{ macros.header()}}
class {{ exercise | camel_case }}Test(unittest.TestCase):
{% for case in cases -%}
diff --git a/exercises/practice/ocr-numbers/ocr_numbers_test.py b/exercises/practice/ocr-numbers/ocr_numbers_test.py
index eeafb2fb314..3d24adc557c 100644
--- a/exercises/practice/ocr-numbers/ocr_numbers_test.py
+++ b/exercises/practice/ocr-numbers/ocr_numbers_test.py
@@ -1,11 +1,13 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/ocr-numbers/canonical-data.json
+# File last updated on 2023-07-19
+
import unittest
from ocr_numbers import (
convert,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class OcrNumbersTest(unittest.TestCase):
def test_recognizes_0(self):
diff --git a/exercises/practice/octal/.docs/instructions.md b/exercises/practice/octal/.docs/instructions.md
index 81f108384b0..65ce135c6ff 100644
--- a/exercises/practice/octal/.docs/instructions.md
+++ b/exercises/practice/octal/.docs/instructions.md
@@ -1,11 +1,9 @@
# Instructions
-Convert an octal number, represented as a string (e.g. '1735263'), to its
-decimal equivalent using first principles (i.e. no, you may not use built-in or
-external libraries to accomplish the conversion).
+Convert an octal number, represented as a string (e.g. '1735263'), to its decimal equivalent using first principles (i.e. no, you may not use built-in or external libraries to accomplish the conversion).
-Implement octal to decimal conversion. Given an octal input
-string, your program should produce a decimal output.
+Implement octal to decimal conversion.
+Given an octal input string, your program should produce a decimal output.
## Note
diff --git a/exercises/practice/octal/.meta/config.json b/exercises/practice/octal/.meta/config.json
index e39e3fb6870..4fe6c11bdef 100644
--- a/exercises/practice/octal/.meta/config.json
+++ b/exercises/practice/octal/.meta/config.json
@@ -26,5 +26,5 @@
]
},
"source": "All of Computer Science",
- "source_url": "http://www.wolframalpha.com/input/?i=base+8"
+ "source_url": "https://www.wolframalpha.com/examples/mathematics/numbers/base-conversions"
}
diff --git a/exercises/practice/paasio/paasio_test.py b/exercises/practice/paasio/paasio_test.py
index 07a5cea7a55..c5c7ff73176 100644
--- a/exercises/practice/paasio/paasio_test.py
+++ b/exercises/practice/paasio/paasio_test.py
@@ -199,13 +199,13 @@ def test_meteredsocket_stats_read_only(self):
self.assertEqual(282, socket.send_bytes)
self.assertEqual(258, socket.recv_ops)
self.assertEqual(259, socket.recv_bytes)
- with self.assertRaisesRegex(AttributeError, "can't set"):
+ with self.assertRaises(AttributeError, msg="property 'send_ops' of 'MeteredSocket' object has no setter"):
socket.send_ops = 0
- with self.assertRaisesRegex(AttributeError, "can't set"):
+ with self.assertRaises(AttributeError, msg="property 'send_bytes' of 'MeteredSocket' object has no setter"):
socket.send_bytes = 0
- with self.assertRaisesRegex(AttributeError, "can't set"):
+ with self.assertRaises(AttributeError, msg="property 'recv_ops' of 'MeteredSocket' object has no setter"):
socket.recv_ops = 0
- with self.assertRaisesRegex(AttributeError, "can't set"):
+ with self.assertRaises(AttributeError, msg="property 'recv_bytes' of 'MeteredSocket' object has no setter"):
socket.recv_bytes = 0
self.assertEqual(278, socket.send_ops)
self.assertEqual(282, socket.send_bytes)
@@ -426,19 +426,15 @@ def test_meteredfile_stats_read_only(self, super_mock):
file.write(b"bytes")
self.assertEqual(78, file.write_ops)
self.assertEqual(82, file.write_bytes)
- with self.assertRaisesRegex(AttributeError, "can't set"):
+ with self.assertRaises(AttributeError, msg="property 'write_ops' of 'MeteredFile' object has no setter"):
file.write_ops = 0
- with self.assertRaisesRegex(AttributeError, "can't set"):
+ with self.assertRaises(AttributeError, msg="property 'write_bytes' of 'MeteredFile' object has no setter"):
file.write_bytes = 0
- with self.assertRaisesRegex(AttributeError, "can't set"):
+ with self.assertRaises(AttributeError, msg="property 'read_ops' of 'MeteredFile' object has no setter"):
file.read_ops = 0
- with self.assertRaisesRegex(AttributeError, "can't set"):
+ with self.assertRaises(AttributeError, msg="property 'read_bytes' of 'MeteredFile' object has no setter"):
file.read_bytes = 0
self.assertEqual(78, file.write_ops)
self.assertEqual(82, file.write_bytes)
self.assertEqual(58, file.read_ops)
self.assertEqual(59, file.read_bytes)
-
-
-if __name__ == "__main__":
- unittest.main()
diff --git a/exercises/practice/palindrome-products/.meta/template.j2 b/exercises/practice/palindrome-products/.meta/template.j2
index 634adaf53fc..f1862fc0c88 100644
--- a/exercises/practice/palindrome-products/.meta/template.j2
+++ b/exercises/practice/palindrome-products/.meta/template.j2
@@ -1,4 +1,7 @@
{%- import "generator_macros.j2" as macros with context -%}
+{{ macros.canonical_ref() }}
+
+{{ macros.header()}}
{%- macro value_factor_unpacking(case) -%}
{%- set input = case["input"] -%}
@@ -24,8 +27,6 @@
{%- endif %}
{% endmacro %}
-{{ macros.header() }}
-
class {{ exercise | camel_case }}Test(unittest.TestCase):
{% for case in cases -%}
{{ test_case(case) }}
diff --git a/exercises/practice/palindrome-products/palindrome_products_test.py b/exercises/practice/palindrome-products/palindrome_products_test.py
index 0fd7eaece32..e9339b5d25d 100644
--- a/exercises/practice/palindrome-products/palindrome_products_test.py
+++ b/exercises/practice/palindrome-products/palindrome_products_test.py
@@ -1,3 +1,7 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/palindrome-products/canonical-data.json
+# File last updated on 2023-07-19
+
import unittest
from palindrome_products import (
@@ -5,8 +9,6 @@
smallest,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class PalindromeProductsTest(unittest.TestCase):
def test_find_the_smallest_palindrome_from_single_digit_factors(self):
diff --git a/exercises/practice/pangram/.approaches/bitfield/content.md b/exercises/practice/pangram/.approaches/bitfield/content.md
index 20e460fea0d..b292540567e 100644
--- a/exercises/practice/pangram/.approaches/bitfield/content.md
+++ b/exercises/practice/pangram/.approaches/bitfield/content.md
@@ -9,9 +9,9 @@ ALL_26_BITS_SET = 67108863
def is_pangram(sentence):
letter_flags = 0
for letter in sentence:
- if letter >= 'a' and letter <= 'z':
+ if 'a' <= letter <= 'z':
letter_flags |= 1 << ord(letter) - A_LCASE
- elif letter >= 'A' and letter <= 'Z':
+ elif 'A' <= letter <= 'Z':
letter_flags |= 1 << ord(letter) - A_UCASE
return letter_flags == ALL_26_BITS_SET
diff --git a/exercises/practice/pangram/.articles/performance/code/Benchmark.py b/exercises/practice/pangram/.articles/performance/code/Benchmark.py
index 729cc967dc9..1b423744479 100644
--- a/exercises/practice/pangram/.articles/performance/code/Benchmark.py
+++ b/exercises/practice/pangram/.articles/performance/code/Benchmark.py
@@ -43,9 +43,9 @@ def is_pangram(sentence):
def is_pangram(sentence):
letter_flags = 0
for letter in sentence:
- if letter >= 'a' and letter <= 'z':
+ if 'a' <= letter <= 'z':
letter_flags |= 1 << (ord(letter) - A_LCASE)
- elif letter >= 'A' and letter <= 'Z':
+ elif 'A' <= letter <= 'Z':
letter_flags |= 1 << (ord(letter) - A_UCASE)
return letter_flags == ALL_26_BITS_SET
diff --git a/exercises/practice/pangram/.docs/instructions.md b/exercises/practice/pangram/.docs/instructions.md
index d5698bc2a29..817c872d907 100644
--- a/exercises/practice/pangram/.docs/instructions.md
+++ b/exercises/practice/pangram/.docs/instructions.md
@@ -5,4 +5,4 @@ Your task is to figure out if a sentence is a pangram.
A pangram is a sentence using every letter of the alphabet at least once.
It is case insensitive, so it doesn't matter if a letter is lower-case (e.g. `k`) or upper-case (e.g. `K`).
-For this exercise we only use the basic letters used in the English alphabet: `a` to `z`.
+For this exercise, a sentence is a pangram if it contains each of the 26 letters in the English alphabet.
diff --git a/exercises/practice/pangram/.docs/introduction.md b/exercises/practice/pangram/.docs/introduction.md
index d38fa341dfa..32b6f1fc317 100644
--- a/exercises/practice/pangram/.docs/introduction.md
+++ b/exercises/practice/pangram/.docs/introduction.md
@@ -7,10 +7,10 @@ To give a comprehensive sense of the font, the random sentences should use **all
They're running a competition to get suggestions for sentences that they can use.
You're in charge of checking the submissions to see if they are valid.
-```exercism/note
+~~~~exercism/note
Pangram comes from Greek, παν γράμμα, pan gramma, which means "every letter".
The best known English pangram is:
> The quick brown fox jumps over the lazy dog.
-```
+~~~~
diff --git a/exercises/practice/pangram/.meta/template.j2 b/exercises/practice/pangram/.meta/template.j2
index 7e93a443548..df38b578777 100644
--- a/exercises/practice/pangram/.meta/template.j2
+++ b/exercises/practice/pangram/.meta/template.j2
@@ -1,4 +1,8 @@
{%- import "generator_macros.j2" as macros with context -%}
+{{ macros.canonical_ref() }}
+
+{{ macros.header()}}
+
{% macro test_case(case) -%}
{%- set input = case["input"] -%}
def test_{{ case["description"] | to_snake }}(self):
@@ -7,7 +11,6 @@
{{ case["expected"] }}
)
{%- endmacro %}
-{{ macros.header()}}
class {{ exercise | camel_case }}Test(unittest.TestCase):
{# All test cases in this exercise are nested, so use two for loops -#}
@@ -22,4 +25,3 @@ class {{ exercise | camel_case }}Test(unittest.TestCase):
{{ test_case(case) }}
{% endfor %}
{%- endif %}
-{{ macros.footer() }}
diff --git a/exercises/practice/pangram/pangram_test.py b/exercises/practice/pangram/pangram_test.py
index 1031cb4e6a4..09e303d4407 100644
--- a/exercises/practice/pangram/pangram_test.py
+++ b/exercises/practice/pangram/pangram_test.py
@@ -1,11 +1,13 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/pangram/canonical-data.json
+# File last updated on 2023-07-19
+
import unittest
from pangram import (
is_pangram,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class PangramTest(unittest.TestCase):
def test_empty_sentence(self):
@@ -50,7 +52,3 @@ def test_sentence_without_lower_bound(self):
def test_sentence_without_upper_bound(self):
self.assertIs(is_pangram("abcdefghijklmnopqrstuvwxy"), False)
-
-
-if __name__ == "__main__":
- unittest.main()
diff --git a/exercises/practice/parallel-letter-frequency/.docs/instructions.md b/exercises/practice/parallel-letter-frequency/.docs/instructions.md
index a5b936c5e2a..85abcf86a42 100644
--- a/exercises/practice/parallel-letter-frequency/.docs/instructions.md
+++ b/exercises/practice/parallel-letter-frequency/.docs/instructions.md
@@ -2,7 +2,6 @@
Count the frequency of letters in texts using parallel computation.
-Parallelism is about doing things in parallel that can also be done
-sequentially. A common example is counting the frequency of letters.
-Create a function that returns the total frequency of each letter in a
-list of texts and that employs parallelism.
+Parallelism is about doing things in parallel that can also be done sequentially.
+A common example is counting the frequency of letters.
+Create a function that returns the total frequency of each letter in a list of texts and that employs parallelism.
diff --git a/exercises/practice/parallel-letter-frequency/.meta/tests.toml b/exercises/practice/parallel-letter-frequency/.meta/tests.toml
new file mode 100644
index 00000000000..6cf36e6fd2d
--- /dev/null
+++ b/exercises/practice/parallel-letter-frequency/.meta/tests.toml
@@ -0,0 +1,62 @@
+# 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.
+
+[c054d642-c1fa-4234-8007-9339f2337886]
+description = "no texts"
+include = false
+
+[818031be-49dc-4675-b2f9-c4047f638a2a]
+description = "one text with one letter"
+include = false
+
+[c0b81d1b-940d-4cea-9f49-8445c69c17ae]
+description = "one text with multiple letters"
+include = false
+
+[708ff1e0-f14a-43fd-adb5-e76750dcf108]
+description = "two texts with one letter"
+include = false
+
+[1b5c28bb-4619-4c9d-8db9-a4bb9c3bdca0]
+description = "two texts with multiple letters"
+include = false
+
+[6366e2b8-b84c-4334-a047-03a00a656d63]
+description = "ignore letter casing"
+include = false
+
+[92ebcbb0-9181-4421-a784-f6f5aa79f75b]
+description = "ignore whitespace"
+include = false
+
+[bc5f4203-00ce-4acc-a5fa-f7b865376fd9]
+description = "ignore punctuation"
+include = false
+
+[68032b8b-346b-4389-a380-e397618f6831]
+description = "ignore numbers"
+include = false
+
+[aa9f97ac-3961-4af1-88e7-6efed1bfddfd]
+description = "Unicode letters"
+include = false
+
+[7b1da046-701b-41fc-813e-dcfb5ee51813]
+description = "combination of lower- and uppercase letters, punctuation and white space"
+include = false
+
+[4727f020-df62-4dcf-99b2-a6e58319cb4f]
+description = "large texts"
+include = false
+
+[adf8e57b-8e54-4483-b6b8-8b32c115884c]
+description = "many small texts"
+include = false
diff --git a/exercises/practice/pascals-triangle/.meta/template.j2 b/exercises/practice/pascals-triangle/.meta/template.j2
index 0041fd53c2b..936db7587c8 100644
--- a/exercises/practice/pascals-triangle/.meta/template.j2
+++ b/exercises/practice/pascals-triangle/.meta/template.j2
@@ -1,4 +1,6 @@
{%- import "generator_macros.j2" as macros with context -%}
+{{ macros.canonical_ref() }}
+
import sys
{{ macros.header() }}
diff --git a/exercises/practice/pascals-triangle/pascals_triangle_test.py b/exercises/practice/pascals-triangle/pascals_triangle_test.py
index dc7b7ce1111..21f68895522 100644
--- a/exercises/practice/pascals-triangle/pascals_triangle_test.py
+++ b/exercises/practice/pascals-triangle/pascals_triangle_test.py
@@ -1,3 +1,7 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/pascals-triangle/canonical-data.json
+# File last updated on 2023-07-19
+
import sys
import unittest
@@ -5,8 +9,6 @@
rows,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
TRIANGLE = [
[1],
[1, 1],
diff --git a/exercises/practice/perfect-numbers/.meta/template.j2 b/exercises/practice/perfect-numbers/.meta/template.j2
index c92e39ca402..e6cd0310043 100644
--- a/exercises/practice/perfect-numbers/.meta/template.j2
+++ b/exercises/practice/perfect-numbers/.meta/template.j2
@@ -1,4 +1,8 @@
{%- import "generator_macros.j2" as macros with context -%}
+{{ macros.canonical_ref() }}
+
+{{ macros.header()}}
+
{% macro test_case(case) -%}
{%- set input = case["input"] -%}
def test_{{ case["description"] | to_snake }}(self):
@@ -14,7 +18,6 @@
)
{% endif %}
{%- endmacro %}
-{{ macros.header()}}
{% for case in cases -%}
class {{ case["description"] | camel_case }}Test(unittest.TestCase):
diff --git a/exercises/practice/perfect-numbers/perfect_numbers_test.py b/exercises/practice/perfect-numbers/perfect_numbers_test.py
index 786f92630ef..eef8661cef1 100644
--- a/exercises/practice/perfect-numbers/perfect_numbers_test.py
+++ b/exercises/practice/perfect-numbers/perfect_numbers_test.py
@@ -1,11 +1,13 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/perfect-numbers/canonical-data.json
+# File last updated on 2023-07-19
+
import unittest
from perfect_numbers import (
classify,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class PerfectNumbersTest(unittest.TestCase):
def test_smallest_perfect_number_is_classified_correctly(self):
diff --git a/exercises/practice/phone-number/.meta/template.j2 b/exercises/practice/phone-number/.meta/template.j2
index 2b2826217c1..faff6e206a9 100644
--- a/exercises/practice/phone-number/.meta/template.j2
+++ b/exercises/practice/phone-number/.meta/template.j2
@@ -1,7 +1,10 @@
{%- import "generator_macros.j2" as macros with context -%}
+{{ macros.canonical_ref() }}
+
{% set class = exercise | camel_case -%}
{{ macros.header([class]) }}
+
class {{ class }}Test(unittest.TestCase):
{% for case in cases -%}
def test_{{ case["description"] | to_snake }}(self):
diff --git a/exercises/practice/phone-number/phone_number_test.py b/exercises/practice/phone-number/phone_number_test.py
index 72ff3b099ac..2b018dfaaf3 100644
--- a/exercises/practice/phone-number/phone_number_test.py
+++ b/exercises/practice/phone-number/phone_number_test.py
@@ -1,11 +1,13 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/phone-number/canonical-data.json
+# File last updated on 2023-07-19
+
import unittest
from phone_number import (
PhoneNumber,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class PhoneNumberTest(unittest.TestCase):
def test_cleans_the_number(self):
diff --git a/exercises/practice/pig-latin/.docs/instructions.md b/exercises/practice/pig-latin/.docs/instructions.md
index c9de5ca1865..032905aa9b0 100644
--- a/exercises/practice/pig-latin/.docs/instructions.md
+++ b/exercises/practice/pig-latin/.docs/instructions.md
@@ -8,11 +8,12 @@ It obeys a few simple rules (below), but when it's spoken quickly it's really di
- **Rule 1**: If a word begins with a vowel sound, add an "ay" sound to the end of the word.
Please note that "xr" and "yt" at the beginning of a word make vowel sounds (e.g. "xray" -> "xrayay", "yttria" -> "yttriaay").
- **Rule 2**: If a word begins with a consonant sound, move it to the end of the word and then add an "ay" sound to the end of the word.
- Consonant sounds can be made up of multiple consonants, a.k.a. a consonant cluster (e.g. "chair" -> "airchay").
+ Consonant sounds can be made up of multiple consonants, such as the "ch" in "chair" or "st" in "stand" (e.g. "chair" -> "airchay").
- **Rule 3**: If a word starts with a consonant sound followed by "qu", move it to the end of the word, and then add an "ay" sound to the end of the word (e.g. "square" -> "aresquay").
- **Rule 4**: If a word contains a "y" after a consonant cluster or as the second letter in a two letter word it makes a vowel sound (e.g. "rhythm" -> "ythmrhay", "my" -> "ymay").
There are a few more rules for edge cases, and there are regional variants too.
+Check the tests for all the details.
Read more about [Pig Latin on Wikipedia][pig-latin].
diff --git a/exercises/practice/pig-latin/.meta/template.j2 b/exercises/practice/pig-latin/.meta/template.j2
index f516f6f1a8c..5badcb774fd 100644
--- a/exercises/practice/pig-latin/.meta/template.j2
+++ b/exercises/practice/pig-latin/.meta/template.j2
@@ -1,5 +1,7 @@
{%- import "generator_macros.j2" as macros with context -%}
-{{ macros.header() }}
+{{ macros.canonical_ref() }}
+
+{{ macros.header()}}
class {{ exercise | camel_case }}Test(unittest.TestCase):
{% for supercase in cases %}
@@ -11,5 +13,3 @@ class {{ exercise | camel_case }}Test(unittest.TestCase):
{% endfor %}
{% endfor %}
-
-{{ macros.footer() }}
\ No newline at end of file
diff --git a/exercises/practice/pig-latin/pig_latin_test.py b/exercises/practice/pig-latin/pig_latin_test.py
index cf666ddf3ad..e5a441eb6b9 100644
--- a/exercises/practice/pig-latin/pig_latin_test.py
+++ b/exercises/practice/pig-latin/pig_latin_test.py
@@ -1,11 +1,13 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/pig-latin/canonical-data.json
+# File last updated on 2023-07-19
+
import unittest
from pig_latin import (
translate,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class PigLatinTest(unittest.TestCase):
def test_word_beginning_with_a(self):
@@ -73,7 +75,3 @@ def test_y_as_second_letter_in_two_letter_word(self):
def test_a_whole_phrase(self):
self.assertEqual(translate("quick fast run"), "ickquay astfay unray")
-
-
-if __name__ == "__main__":
- unittest.main()
diff --git a/exercises/practice/point-mutations/.meta/config.json b/exercises/practice/point-mutations/.meta/config.json
index 2d8d765c187..b02f3706511 100644
--- a/exercises/practice/point-mutations/.meta/config.json
+++ b/exercises/practice/point-mutations/.meta/config.json
@@ -26,5 +26,5 @@
]
},
"source": "The Calculating Point Mutations problem at Rosalind",
- "source_url": "http://rosalind.info/problems/hamm/"
+ "source_url": "https://rosalind.info/problems/hamm/"
}
diff --git a/exercises/practice/poker/.meta/template.j2 b/exercises/practice/poker/.meta/template.j2
index 099626a1349..730d54dd69f 100644
--- a/exercises/practice/poker/.meta/template.j2
+++ b/exercises/practice/poker/.meta/template.j2
@@ -1,4 +1,6 @@
{%- import "generator_macros.j2" as macros with context -%}
+{{ macros.canonical_ref() }}
+
{{ macros.header()}}
class {{ exercise | camel_case }}Test(unittest.TestCase):
@@ -8,5 +10,3 @@ class {{ exercise | camel_case }}Test(unittest.TestCase):
self.assertEqual(
{{ case["property"] | to_snake }}({{ input["hands"] }}), {{ case["expected"] }})
{% endfor %}
-
-{{ macros.footer() }}
diff --git a/exercises/practice/poker/poker_test.py b/exercises/practice/poker/poker_test.py
index f436e48120b..c80aad6f059 100644
--- a/exercises/practice/poker/poker_test.py
+++ b/exercises/practice/poker/poker_test.py
@@ -1,11 +1,13 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/poker/canonical-data.json
+# File last updated on 2023-07-19
+
import unittest
from poker import (
best_hands,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class PokerTest(unittest.TestCase):
def test_single_hand_always_wins(self):
@@ -209,7 +211,3 @@ def test_even_though_an_ace_is_usually_high_a_5_high_straight_flush_is_the_lowes
self.assertEqual(
best_hands(["2H 3H 4H 5H 6H", "4D AD 3D 2D 5D"]), ["2H 3H 4H 5H 6H"]
)
-
-
-if __name__ == "__main__":
- unittest.main()
diff --git a/exercises/practice/pov/.meta/template.j2 b/exercises/practice/pov/.meta/template.j2
index aee59684a19..00d1f005a37 100644
--- a/exercises/practice/pov/.meta/template.j2
+++ b/exercises/practice/pov/.meta/template.j2
@@ -1,6 +1,9 @@
{%- import "generator_macros.j2" as macros with context -%}
+{{ macros.canonical_ref() }}
-{%- macro test_case(case) %}
+{{ macros.header(["Tree"]) }}
+
+{% macro test_case(case) %}
def test_{{ case["description"] | to_snake }}(self):
tree = {{ write_tree(case["input"]["tree"]) }}
{% if case["property"] == "fromPov" -%}
@@ -8,7 +11,7 @@
{%- elif case["property"] == "pathTo" -%}
{{ test_path_to(case) }}
{%- endif -%}
-{% endmacro -%}
+{% endmacro %}
{%- macro test_from_pov(case) -%}
{% if case["expected"] -%}
@@ -20,7 +23,7 @@
self.assertEqual(type(err.exception), ValueError)
self.assertEqual(err.exception.args[0], "Tree could not be reoriented")
{% endif -%}
-{% endmacro -%}
+{% endmacro %}
{%- macro test_path_to(case) -%}
{% if case["expected"] -%}
@@ -47,8 +50,6 @@
]{% endif %})
{%- endmacro -%}
-{{ macros.header(["Tree"]) }}
-
class {{ exercise | camel_case }}Test(unittest.TestCase):
{% for supercase in cases -%}
{%- for case in supercase["cases"] %}
diff --git a/exercises/practice/pov/pov_test.py b/exercises/practice/pov/pov_test.py
index 4bbdbaa8718..2436ebc2db9 100644
--- a/exercises/practice/pov/pov_test.py
+++ b/exercises/practice/pov/pov_test.py
@@ -1,11 +1,13 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/pov/canonical-data.json
+# File last updated on 2023-07-19
+
import unittest
from pov import (
Tree,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class PovTest(unittest.TestCase):
def test_results_in_the_same_tree_if_the_input_tree_is_a_singleton(self):
diff --git a/exercises/practice/prime-factors/.meta/template.j2 b/exercises/practice/prime-factors/.meta/template.j2
index 4178af79aac..cc9a9fe3841 100644
--- a/exercises/practice/prime-factors/.meta/template.j2
+++ b/exercises/practice/prime-factors/.meta/template.j2
@@ -1,5 +1,7 @@
{%- import "generator_macros.j2" as macros with context -%}
-{{ macros.header() }}
+{{ macros.canonical_ref() }}
+
+{{ macros.header()}}
class {{ exercise | camel_case }}Test(unittest.TestCase):
{% for case in cases %}
diff --git a/exercises/practice/prime-factors/prime_factors_test.py b/exercises/practice/prime-factors/prime_factors_test.py
index 02b36e7a16c..4f6865036e5 100644
--- a/exercises/practice/prime-factors/prime_factors_test.py
+++ b/exercises/practice/prime-factors/prime_factors_test.py
@@ -1,11 +1,13 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/prime-factors/canonical-data.json
+# File last updated on 2023-07-19
+
import unittest
from prime_factors import (
factors,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class PrimeFactorsTest(unittest.TestCase):
def test_no_factors(self):
diff --git a/exercises/practice/protein-translation/.meta/template.j2 b/exercises/practice/protein-translation/.meta/template.j2
index 5cc931bcfd5..e0b591609f1 100644
--- a/exercises/practice/protein-translation/.meta/template.j2
+++ b/exercises/practice/protein-translation/.meta/template.j2
@@ -1,5 +1,7 @@
{%- import "generator_macros.j2" as macros with context -%}
-{{ macros.header() }}
+{{ macros.canonical_ref() }}
+
+{{ macros.header()}}
class {{ exercise | camel_case }}Test(unittest.TestCase):
{% for case in cases -%}
@@ -9,5 +11,4 @@ class {{ exercise | camel_case }}Test(unittest.TestCase):
self.assertEqual({{ case["property"] }}(value), expected)
{% endfor %}
-
-{{ macros.footer() }}
+
\ No newline at end of file
diff --git a/exercises/practice/protein-translation/protein_translation_test.py b/exercises/practice/protein-translation/protein_translation_test.py
index 046c0a43e76..91e6324b6e3 100644
--- a/exercises/practice/protein-translation/protein_translation_test.py
+++ b/exercises/practice/protein-translation/protein_translation_test.py
@@ -1,11 +1,13 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/protein-translation/canonical-data.json
+# File last updated on 2023-07-19
+
import unittest
from protein_translation import (
proteins,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class ProteinTranslationTest(unittest.TestCase):
def test_methionine_rna_sequence(self):
@@ -132,7 +134,3 @@ def test_translation_stops_if_stop_codon_in_middle_of_six_codon_sequence(self):
value = "UGGUGUUAUUAAUGGUUU"
expected = ["Tryptophan", "Cysteine", "Tyrosine"]
self.assertEqual(proteins(value), expected)
-
-
-if __name__ == "__main__":
- unittest.main()
diff --git a/exercises/practice/proverb/.meta/template.j2 b/exercises/practice/proverb/.meta/template.j2
index cf50a261903..333a2d47d73 100644
--- a/exercises/practice/proverb/.meta/template.j2
+++ b/exercises/practice/proverb/.meta/template.j2
@@ -1,5 +1,8 @@
{%- import "generator_macros.j2" as macros with context -%}
+{{ macros.canonical_ref() }}
+
{{ macros.header(imports=["proverb"]) }}
+
{{ "# PLEASE TAKE NOTE: Expected result lists for these test cases use **implicit line joining.**" }}
{{ "# A new line in a result list below **does not** always equal a new list element." }}
{{ "# Check comma placement carefully!" }}
diff --git a/exercises/practice/proverb/proverb_test.py b/exercises/practice/proverb/proverb_test.py
index 69905dadf4a..8c09283c020 100644
--- a/exercises/practice/proverb/proverb_test.py
+++ b/exercises/practice/proverb/proverb_test.py
@@ -1,10 +1,13 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/proverb/canonical-data.json
+# File last updated on 2023-07-19
+
import unittest
from proverb import (
proverb,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
# PLEASE TAKE NOTE: Expected result lists for these test cases use **implicit line joining.**
# A new line in a result list below **does not** always equal a new list element.
# Check comma placement carefully!
diff --git a/exercises/practice/pythagorean-triplet/.meta/template.j2 b/exercises/practice/pythagorean-triplet/.meta/template.j2
index b3836a54427..96fa266789d 100644
--- a/exercises/practice/pythagorean-triplet/.meta/template.j2
+++ b/exercises/practice/pythagorean-triplet/.meta/template.j2
@@ -1,15 +1,11 @@
{%- import "generator_macros.j2" as macros with context -%}
+{{ macros.canonical_ref() }}
-{{ macros.header() }}
+{{ macros.header()}}
-# Python 2/3 compatibility
-if not hasattr(unittest.TestCase, 'assertCountEqual'):
- unittest.TestCase.assertCountEqual = unittest.TestCase.assertItemsEqual
class {{ exercise | camel_case }}Test(unittest.TestCase):
{% for case in cases -%}
def test_{{ case["description"] | to_snake }}(self):
self.assertCountEqual({{ case["property"] | to_snake }}({{ case["input"]["n"] }}), {{ case["expected"] }})
{% endfor %}
-
-{{ macros.footer() }}
diff --git a/exercises/practice/pythagorean-triplet/pythagorean_triplet_test.py b/exercises/practice/pythagorean-triplet/pythagorean_triplet_test.py
index 70d501c4fbc..91137932245 100644
--- a/exercises/practice/pythagorean-triplet/pythagorean_triplet_test.py
+++ b/exercises/practice/pythagorean-triplet/pythagorean_triplet_test.py
@@ -1,15 +1,13 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/pythagorean-triplet/canonical-data.json
+# File last updated on 2023-07-19
+
import unittest
from pythagorean_triplet import (
triplets_with_sum,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
-# Python 2/3 compatibility
-if not hasattr(unittest.TestCase, "assertCountEqual"):
- unittest.TestCase.assertCountEqual = unittest.TestCase.assertItemsEqual
-
class PythagoreanTripletTest(unittest.TestCase):
def test_triplets_whose_sum_is_12(self):
@@ -53,7 +51,3 @@ def test_triplets_for_large_number(self):
[7500, 10000, 12500],
],
)
-
-
-if __name__ == "__main__":
- unittest.main()
diff --git a/exercises/practice/queen-attack/.docs/instructions.md b/exercises/practice/queen-attack/.docs/instructions.md
index dce0fc29850..ad7ea954796 100644
--- a/exercises/practice/queen-attack/.docs/instructions.md
+++ b/exercises/practice/queen-attack/.docs/instructions.md
@@ -21,5 +21,5 @@ So if you are told the white queen is at `c5` (zero-indexed at column 2, row 3)
a b c d e f g h
```
-You are also be able to answer whether the queens can attack each other.
+You are also able to answer whether the queens can attack each other.
In this case, that answer would be yes, they can, because both pieces share a diagonal.
diff --git a/exercises/practice/queen-attack/.meta/template.j2 b/exercises/practice/queen-attack/.meta/template.j2
index 6a08c5251e2..b8be7aeaafa 100644
--- a/exercises/practice/queen-attack/.meta/template.j2
+++ b/exercises/practice/queen-attack/.meta/template.j2
@@ -1,4 +1,6 @@
{%- import "generator_macros.j2" as macros with context -%}
+{{ macros.canonical_ref() }}
+
{{ macros.header(imports=['Queen']) }}
class {{ exercise | camel_case }}Test(unittest.TestCase):
diff --git a/exercises/practice/queen-attack/queen_attack_test.py b/exercises/practice/queen-attack/queen_attack_test.py
index 34c212af19e..e1289aebcef 100644
--- a/exercises/practice/queen-attack/queen_attack_test.py
+++ b/exercises/practice/queen-attack/queen_attack_test.py
@@ -1,11 +1,13 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/queen-attack/canonical-data.json
+# File last updated on 2023-07-19
+
import unittest
from queen_attack import (
Queen,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class QueenAttackTest(unittest.TestCase):
# Test creation of Queens with valid and invalid positions
diff --git a/exercises/practice/rail-fence-cipher/.meta/template.j2 b/exercises/practice/rail-fence-cipher/.meta/template.j2
index 2c11e606c67..4df5b2c66d4 100644
--- a/exercises/practice/rail-fence-cipher/.meta/template.j2
+++ b/exercises/practice/rail-fence-cipher/.meta/template.j2
@@ -1,5 +1,7 @@
{%- import "generator_macros.j2" as macros with context -%}
-{{ macros.header() }}
+{{ macros.canonical_ref() }}
+
+{{ macros.header()}}
class {{ exercise | camel_case }}Test(unittest.TestCase):
{% for supercase in cases %}
@@ -12,5 +14,3 @@ class {{ exercise | camel_case }}Test(unittest.TestCase):
{% endfor %}
{% endfor %}
-
-{{ macros.footer() }}
\ No newline at end of file
diff --git a/exercises/practice/rail-fence-cipher/rail_fence_cipher_test.py b/exercises/practice/rail-fence-cipher/rail_fence_cipher_test.py
index 65743180a7c..f82066ca274 100644
--- a/exercises/practice/rail-fence-cipher/rail_fence_cipher_test.py
+++ b/exercises/practice/rail-fence-cipher/rail_fence_cipher_test.py
@@ -1,3 +1,7 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/rail-fence-cipher/canonical-data.json
+# File last updated on 2023-07-19
+
import unittest
from rail_fence_cipher import (
@@ -5,8 +9,6 @@
encode,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class RailFenceCipherTest(unittest.TestCase):
def test_encode_with_two_rails(self):
@@ -33,7 +35,3 @@ def test_decode_with_six_rails(self):
decode("133714114238148966225439541018335470986172518171757571896261", 6),
"112358132134558914423337761098715972584418167651094617711286",
)
-
-
-if __name__ == "__main__":
- unittest.main()
diff --git a/exercises/practice/raindrops/.meta/template.j2 b/exercises/practice/raindrops/.meta/template.j2
index d1b0d2f8612..c84975c9bbb 100644
--- a/exercises/practice/raindrops/.meta/template.j2
+++ b/exercises/practice/raindrops/.meta/template.j2
@@ -1,12 +1,15 @@
{%- import "generator_macros.j2" as macros with context -%}
+{{ macros.canonical_ref() }}
+
+{{ macros.header()}}
+
{%- macro test_call(case) %}
{{ case["property"] | to_snake }}(
{% for arg in case["input"].values() -%}
{{ arg }}{{- "," if not loop.last }}
{% endfor %}
)
-{% endmacro -%}
-{{ macros.header() }}
+{% endmacro %}
class {{ exercise | camel_case }}Test(unittest.TestCase):
{% for case in cases -%}
@@ -16,5 +19,3 @@ class {{ exercise | camel_case }}Test(unittest.TestCase):
"{{ case["expected"] }}"
)
{% endfor %}
-
-{{ macros.footer() }}
diff --git a/exercises/practice/raindrops/raindrops_test.py b/exercises/practice/raindrops/raindrops_test.py
index 247f4daa47b..b07e70dc24a 100644
--- a/exercises/practice/raindrops/raindrops_test.py
+++ b/exercises/practice/raindrops/raindrops_test.py
@@ -1,11 +1,13 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/raindrops/canonical-data.json
+# File last updated on 2023-07-19
+
import unittest
from raindrops import (
convert,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class RaindropsTest(unittest.TestCase):
def test_the_sound_for_1_is_1(self):
@@ -63,7 +65,3 @@ def test_the_sound_for_105_is_pling_plang_plong_as_it_has_factors_3_5_and_7(self
def test_the_sound_for_3125_is_plang_as_it_has_a_factor_5(self):
self.assertEqual(convert(3125), "Plang")
-
-
-if __name__ == "__main__":
- unittest.main()
diff --git a/exercises/practice/rational-numbers/.meta/template.j2 b/exercises/practice/rational-numbers/.meta/template.j2
index 026bd1de48c..eb640c95757 100644
--- a/exercises/practice/rational-numbers/.meta/template.j2
+++ b/exercises/practice/rational-numbers/.meta/template.j2
@@ -1,4 +1,7 @@
{%- import "generator_macros.j2" as macros with context -%}
+{{ macros.canonical_ref() }}
+
+{{ macros.header(imports=["Rational"]) }}
{%- set operators = {
"add": "+",
@@ -82,9 +85,6 @@
{%- endmacro %}
-from __future__ import division
-{{ macros.header(imports=["Rational"]) }}
-
class {{ exercise | camel_case }}Test(unittest.TestCase):
{% for mathtypescases in cases %}
# Tests of type: {{ mathtypescases["description"] }}
diff --git a/exercises/practice/rational-numbers/rational_numbers_test.py b/exercises/practice/rational-numbers/rational_numbers_test.py
index e7a50e528e8..181bb128bf2 100644
--- a/exercises/practice/rational-numbers/rational_numbers_test.py
+++ b/exercises/practice/rational-numbers/rational_numbers_test.py
@@ -1,12 +1,13 @@
-from __future__ import division
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/rational-numbers/canonical-data.json
+# File last updated on 2023-07-19
+
import unittest
from rational_numbers import (
Rational,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class RationalNumbersTest(unittest.TestCase):
diff --git a/exercises/practice/react/.meta/template.j2 b/exercises/practice/react/.meta/template.j2
index f9fb637c433..f46e0f39e3d 100644
--- a/exercises/practice/react/.meta/template.j2
+++ b/exercises/practice/react/.meta/template.j2
@@ -1,5 +1,9 @@
{%- import "generator_macros.j2" as macros with context -%}
+{{ macros.canonical_ref() }}
+
from functools import partial
+{{ macros.header(["InputCell", "ComputeCell"])}}
+
{% macro test_case(case) -%}
{%- set input = case["input"] -%}
{%- set callback = [] -%}
@@ -48,7 +52,6 @@ from functools import partial
{%- endif %}
{% endfor -%}
{%- endmacro %}
-{{ macros.header(["InputCell", "ComputeCell"])}}
class {{ exercise | camel_case }}Test(unittest.TestCase):
{% for case in cases -%}
diff --git a/exercises/practice/react/react_test.py b/exercises/practice/react/react_test.py
index 2ba86a80ffa..1f917e40b41 100644
--- a/exercises/practice/react/react_test.py
+++ b/exercises/practice/react/react_test.py
@@ -1,5 +1,8 @@
-from functools import partial
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/react/canonical-data.json
+# File last updated on 2023-07-19
+from functools import partial
import unittest
from react import (
@@ -7,8 +10,6 @@
ComputeCell,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class ReactTest(unittest.TestCase):
def test_input_cells_have_a_value(self):
diff --git a/exercises/practice/rectangles/.meta/template.j2 b/exercises/practice/rectangles/.meta/template.j2
index 0d82cb8421d..0061968aa25 100644
--- a/exercises/practice/rectangles/.meta/template.j2
+++ b/exercises/practice/rectangles/.meta/template.j2
@@ -1,5 +1,7 @@
{%- import "generator_macros.j2" as macros with context -%}
-{{ macros.header() }}
+{{ macros.canonical_ref() }}
+
+{{ macros.header()}}
class {{ exercise | camel_case }}Test(unittest.TestCase):
{% for case in cases -%}
@@ -8,5 +10,4 @@ class {{ exercise | camel_case }}Test(unittest.TestCase):
self.assertEqual({{ case["property"] }}({{ input_strings }}), {{ case["expected"] }})
{% endfor %}
-
-{{ macros.footer() }}
+
\ No newline at end of file
diff --git a/exercises/practice/rectangles/rectangles_test.py b/exercises/practice/rectangles/rectangles_test.py
index 59c622de769..89de9f28647 100644
--- a/exercises/practice/rectangles/rectangles_test.py
+++ b/exercises/practice/rectangles/rectangles_test.py
@@ -1,11 +1,13 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/rectangles/canonical-data.json
+# File last updated on 2023-07-19
+
import unittest
from rectangles import (
rectangles,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class RectanglesTest(unittest.TestCase):
def test_no_rows(self):
@@ -98,7 +100,3 @@ def test_rectangles_must_have_four_sides(self):
),
5,
)
-
-
-if __name__ == "__main__":
- unittest.main()
diff --git a/exercises/practice/resistor-color-duo/.meta/template.j2 b/exercises/practice/resistor-color-duo/.meta/template.j2
index cabf271cae5..ac0a560ac0e 100644
--- a/exercises/practice/resistor-color-duo/.meta/template.j2
+++ b/exercises/practice/resistor-color-duo/.meta/template.j2
@@ -1,4 +1,8 @@
{%- import "generator_macros.j2" as macros with context -%}
+{{ macros.canonical_ref() }}
+
+{{ macros.header()}}
+
{% macro test_case(case) -%}
{%- set input = case["input"] -%}
def test_{{ case["description"] | to_snake }}(self):
@@ -7,7 +11,6 @@
{{ case["expected"] }}
)
{%- endmacro %}
-{{ macros.header()}}
class {{ exercise | camel_case }}Test(unittest.TestCase):
{% for case in cases -%}
diff --git a/exercises/practice/resistor-color-duo/resistor_color_duo_test.py b/exercises/practice/resistor-color-duo/resistor_color_duo_test.py
index 72df473f071..5a67016d894 100644
--- a/exercises/practice/resistor-color-duo/resistor_color_duo_test.py
+++ b/exercises/practice/resistor-color-duo/resistor_color_duo_test.py
@@ -1,11 +1,13 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/resistor-color-duo/canonical-data.json
+# File last updated on 2023-07-19
+
import unittest
from resistor_color_duo import (
value,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class ResistorColorDuoTest(unittest.TestCase):
def test_brown_and_black(self):
diff --git a/exercises/practice/resistor-color-expert/.docs/instructions.md b/exercises/practice/resistor-color-expert/.docs/instructions.md
new file mode 100644
index 00000000000..d76c567b5d0
--- /dev/null
+++ b/exercises/practice/resistor-color-expert/.docs/instructions.md
@@ -0,0 +1,79 @@
+# Instructions
+
+In this exercise, you are going to create a helpful program so that you don't have to remember the values of the bands.
+The program will take 1, 4, or 5 colors as input, and outputs the correct value, in ohms.
+The color bands are encoded as follows:
+
+- Black: 0
+- Brown: 1
+- Red: 2
+- Orange: 3
+- Yellow: 4
+- Green: 5
+- Blue: 6
+- Violet: 7
+- Grey: 8
+- White: 9
+
+In `resistor-color trio` you decoded the first three colors.
+For instance: orange-orange-brown translated to the main value `330`.
+In this exercise you will need to add _tolerance_ to the mix.
+Tolerance is the maximum amount that a value can be above or below the main value.
+For example, if the last band is green, the maximum tolerance will be ±0.5%.
+
+The tolerance band will have one of these values:
+
+- Grey - 0.05%
+- Violet - 0.1%
+- Blue - 0.25%
+- Green - 0.5%
+- Brown - 1%
+- Red - 2%
+- Gold - 5%
+- Silver - 10%
+
+The four-band resistor is built up like this:
+
+| Band_1 | Band_2 | Band_3 | band_4 |
+| ------- | ------- | ---------- | --------- |
+| Value_1 | Value_2 | Multiplier | Tolerance |
+
+Meaning
+
+- orange-orange-brown-green would be 330 ohms with a ±0.5% tolerance.
+- orange-orange-red-grey would be 3300 ohms with ±0.05% tolerance.
+
+The difference between a four and five-band resistor is that the five-band resistor has an extra band to indicate a more precise value.
+
+| Band_1 | Band_2 | Band_3 | Band_4 | band_5 |
+| ------- | ------- | ------- | ---------- | --------- |
+| Value_1 | Value_2 | Value_3 | Multiplier | Tolerance |
+
+Meaning
+
+- orange-orange-orange-black-green would be 333 ohms with a ±0.5% tolerance.
+- orange-red-orange-blue-violet would be 323M ohms with a ±0.10 tolerance.
+
+There are also one band resistors.
+One band resistors only have the color black with a value of 0.
+
+This exercise is about translating the resistor band colors into a label:
+
+"... ohms ...%"
+
+So an input of "orange", "orange", "black, green" should return:
+
+"33 ohms ±0.5%"
+
+When there are more than a thousand ohms, we say "kiloohms".
+ That's similar to saying "kilometer" for 1000 meters, and "kilograms" for 1000 grams.
+
+So an input of "orange", "orange", "orange", grey should return:
+
+"33 kiloohms ±0.05%"
+
+When there are more than a million ohms, we say "megaohms".
+
+So an input of "orange", "orange", "orange", "red" should return:
+
+"33 megaohms ±2%"
diff --git a/exercises/practice/resistor-color-expert/.docs/introduction.md b/exercises/practice/resistor-color-expert/.docs/introduction.md
new file mode 100644
index 00000000000..fd9e05efc4d
--- /dev/null
+++ b/exercises/practice/resistor-color-expert/.docs/introduction.md
@@ -0,0 +1,10 @@
+# Introduction
+
+If you want to build something using a Raspberry Pi, you'll probably use _resistors_.
+Like the previous `Resistor Color Duo` and `Resistor Color Trio` exercises, you will be translating resistor color bands to human-readable labels.
+
+- Each resistor has a resistance value.
+- Resistors are small - so small in fact that if you printed the resistance value on them, it would be hard to read.
+ To get around this problem, manufacturers print color-coded bands onto the resistors to denote their resistance values.
+- Each band acts as a digit of a number.
+ For example, if they printed a brown band (value 1) followed by a green band (value 5), it would translate to the number 15.
diff --git a/exercises/practice/resistor-color-expert/.meta/config.json b/exercises/practice/resistor-color-expert/.meta/config.json
new file mode 100644
index 00000000000..edf50b4a1e1
--- /dev/null
+++ b/exercises/practice/resistor-color-expert/.meta/config.json
@@ -0,0 +1,20 @@
+{
+ "authors": [
+ "meatball133",
+ "bethanyg"
+ ],
+ "files": {
+ "solution": [
+ "resistor_color_expert.py"
+ ],
+ "test": [
+ "resistor_color_expert_test.py"
+ ],
+ "example": [
+ ".meta/example.py"
+ ]
+ },
+ "blurb": "Convert color codes as used on resistors with different bands to a human-readable label.",
+ "source": "Based on earlier resistor color exercises made by Erik Schierboom and Maud de Vries",
+ "source_url": "https://github.com/exercism/problem-specifications/issues/1464"
+}
diff --git a/exercises/practice/resistor-color-expert/.meta/example.py b/exercises/practice/resistor-color-expert/.meta/example.py
new file mode 100644
index 00000000000..0fd6e42fcd9
--- /dev/null
+++ b/exercises/practice/resistor-color-expert/.meta/example.py
@@ -0,0 +1,49 @@
+COLORS = [
+ 'black',
+ 'brown',
+ 'red',
+ 'orange',
+ 'yellow',
+ 'green',
+ 'blue',
+ 'violet',
+ 'grey',
+ 'white'
+]
+
+COLORS_TOLERANCE = {
+ 'brown': 1,
+ 'red': 2,
+ 'green': 0.5,
+ 'blue': 0.25,
+ 'violet': 0.1,
+ 'grey': 0.05,
+ 'gold': 5,
+ 'silver': 10
+}
+
+
+def resistor_label(colors):
+ if len(colors) == 1:
+ return f'0 ohms'
+ elif len(colors) == 4:
+ value = 10 * COLORS.index(colors[0]) + COLORS.index(colors[1])
+ value *= 10 ** COLORS.index(colors[2])
+ value, unit = color_code(value)
+ value = int(value) if value.is_integer() else value
+ return f'{value} {unit} ±{COLORS_TOLERANCE[colors[3]]}%'
+ else:
+ value = 100 * COLORS.index(colors[0]) + 10 * COLORS.index(colors[1]) + COLORS.index(colors[2])
+ value *= 10 ** COLORS.index(colors[3])
+ value, unit = color_code(value)
+ value = int(value) if value.is_integer() else value
+ return f'{value} {unit} ±{COLORS_TOLERANCE[colors[4]]}%'
+
+
+def color_code(color):
+ if color < 1000:
+ return color / 1, 'ohms'
+ elif color < 1000000:
+ return color / 1000, 'kiloohms'
+ else:
+ return color / 1000000, 'megaohms'
\ No newline at end of file
diff --git a/exercises/practice/resistor-color-expert/.meta/tests.toml b/exercises/practice/resistor-color-expert/.meta/tests.toml
new file mode 100644
index 00000000000..4f57723a19f
--- /dev/null
+++ b/exercises/practice/resistor-color-expert/.meta/tests.toml
@@ -0,0 +1,40 @@
+# 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.
+
+[8c4f9fb6-d477-4250-bc57-b325d2be226f]
+description = "Orange, orange, black, and red"
+
+[d1d4a769-9210-43cc-9a14-6af6ce4c0b00]
+description = "Blue, grey, brown, and violet"
+
+[6af91bc3-8275-4c38-920a-185d30feb5f3]
+description = "Red, black, red, and green"
+
+[9c4630bf-0dda-4212-baca-2f5111530b4d]
+description = "Green, brown, orange, and grey"
+
+[5880ddf1-0dc6-4bd0-b9de-5626117cd2c7]
+description = "One black band"
+
+[a5cfda34-3c02-4bda-b183-726791fb43b2]
+description = "Orange, orange, yellow, black, and brown"
+
+[4f0ad96c-cdab-4c84-95dd-7074e889e001]
+description = "Red, green, yellow, yellow, and brown"
+
+[48c66841-208c-46a7-8992-1e84a2eda9e2]
+description = "Blue, grey, white, brown, and brown"
+
+[4f3aeb0c-fd9d-4cbd-b204-554e61978f73]
+description = "Violet, orange, red, and grey"
+
+[1ae3a17f-8bc0-449c-9831-fddfd2d91c5d]
+description = "Brown, red, orange, green, and blue"
diff --git a/exercises/practice/resistor-color-expert/resistor_color_expert.py b/exercises/practice/resistor-color-expert/resistor_color_expert.py
new file mode 100644
index 00000000000..f36881c5a0e
--- /dev/null
+++ b/exercises/practice/resistor-color-expert/resistor_color_expert.py
@@ -0,0 +1,2 @@
+def resistor_label(colors):
+ pass
diff --git a/exercises/practice/resistor-color-expert/resistor_color_expert_test.py b/exercises/practice/resistor-color-expert/resistor_color_expert_test.py
new file mode 100644
index 00000000000..bcf2052c021
--- /dev/null
+++ b/exercises/practice/resistor-color-expert/resistor_color_expert_test.py
@@ -0,0 +1,51 @@
+import unittest
+
+from resistor_color_expert import (
+ resistor_label,
+)
+
+# Tests adapted from `problem-specifications//canonical-data.json`
+
+
+class ResistorColorExpertTest(unittest.TestCase):
+ def test_orange_orange_black_and_red(self):
+ self.assertEqual(resistor_label(["orange", "orange", "black", "red"]), "33 ohms ±2%")
+
+ def test_blue_grey_brown_and_violet(self):
+ self.assertEqual(resistor_label(["blue", "grey", "brown", "violet"]), "680 ohms ±0.1%")
+
+ def test_red_black_red_and_green(self):
+ self.assertEqual(resistor_label(["red", "black", "red", "green"]), "2 kiloohms ±0.5%")
+
+ def test_green_brown_orange_and_grey(self):
+ self.assertEqual(
+ resistor_label(["green", "brown", "orange", "grey"]), "51 kiloohms ±0.05%"
+ )
+
+ def test_one_black_band(self):
+ self.assertEqual(resistor_label(["black"]), "0 ohms")
+
+ def test_orange_orange_yellow_black_and_brown(self):
+ self.assertEqual(
+ resistor_label(["orange", "orange", "yellow", "black", "brown"]), "334 ohms ±1%"
+ )
+
+ def test_red_green_yellow_yellow_and_brown(self):
+ self.assertEqual(
+ resistor_label(["red", "green", "yellow", "yellow", "brown"]), "2.54 megaohms ±1%"
+ )
+
+ def test_blue_grey_white_red_and_brown(self):
+ self.assertEqual(
+ resistor_label(["blue", "grey", "white", "brown", "brown"]), "6.89 kiloohms ±1%"
+ )
+
+ def test_violet_orange_red_and_grey(self):
+ self.assertEqual(
+ resistor_label(["violet", "orange", "red", "grey"]), "7.3 kiloohms ±0.05%"
+ )
+
+ def test_brown_red_orange_green_and_blue(self):
+ self.assertEqual(
+ resistor_label(["brown", "red", "orange", "green", "blue"]), "12.3 megaohms ±0.25%"
+ )
diff --git a/exercises/practice/resistor-color-trio/.meta/template.j2 b/exercises/practice/resistor-color-trio/.meta/template.j2
index 54814bed31d..aa458450031 100644
--- a/exercises/practice/resistor-color-trio/.meta/template.j2
+++ b/exercises/practice/resistor-color-trio/.meta/template.j2
@@ -1,4 +1,8 @@
{%- import "generator_macros.j2" as macros with context -%}
+{{ macros.canonical_ref() }}
+
+{{ macros.header()}}
+
{% macro test_case(case) -%}
{%- set input = case["input"] -%}
def test_{{ case["description"] | to_snake }}(self):
@@ -7,7 +11,6 @@
"{{ case['expected']['value']}} {{ case['expected']['unit']}}"
)
{%- endmacro %}
-{{ macros.header()}}
class {{ exercise | camel_case }}Test(unittest.TestCase):
{% for case in cases -%}
diff --git a/exercises/practice/resistor-color-trio/resistor_color_trio_test.py b/exercises/practice/resistor-color-trio/resistor_color_trio_test.py
index ddfdfb6930c..05f794281d3 100644
--- a/exercises/practice/resistor-color-trio/resistor_color_trio_test.py
+++ b/exercises/practice/resistor-color-trio/resistor_color_trio_test.py
@@ -1,11 +1,13 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/resistor-color-trio/canonical-data.json
+# File last updated on 2023-07-19
+
import unittest
from resistor_color_trio import (
label,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class ResistorColorTrioTest(unittest.TestCase):
def test_orange_and_orange_and_black(self):
diff --git a/exercises/practice/resistor-color/.meta/template.j2 b/exercises/practice/resistor-color/.meta/template.j2
index e186e3562ec..0a6830e8ca2 100644
--- a/exercises/practice/resistor-color/.meta/template.j2
+++ b/exercises/practice/resistor-color/.meta/template.j2
@@ -1,5 +1,7 @@
{%- import "generator_macros.j2" as macros with context -%}
-{{ macros.header() }}
+{{ macros.canonical_ref() }}
+
+{{ macros.header()}}
class {{ exercise | camel_case }}Test(unittest.TestCase):
{% for case in cases -%}
@@ -14,5 +16,3 @@ class {{ exercise | camel_case }}Test(unittest.TestCase):
self.assertEqual({{ case["property"] | to_snake }}(), expected)
{%- endif -%}
{% endfor %}
-
-{{ macros.footer() }}
diff --git a/exercises/practice/resistor-color/resistor_color_test.py b/exercises/practice/resistor-color/resistor_color_test.py
index 62ab48625fd..d86d7553215 100644
--- a/exercises/practice/resistor-color/resistor_color_test.py
+++ b/exercises/practice/resistor-color/resistor_color_test.py
@@ -1,3 +1,7 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/resistor-color/canonical-data.json
+# File last updated on 2023-07-19
+
import unittest
from resistor_color import (
@@ -5,8 +9,6 @@
colors,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class ResistorColorTest(unittest.TestCase):
def test_black(self):
@@ -32,7 +34,3 @@ def test_colors(self):
"white",
]
self.assertEqual(colors(), expected)
-
-
-if __name__ == "__main__":
- unittest.main()
diff --git a/exercises/practice/rest-api/.meta/template.j2 b/exercises/practice/rest-api/.meta/template.j2
index 9bd4e751df7..a467adb569d 100644
--- a/exercises/practice/rest-api/.meta/template.j2
+++ b/exercises/practice/rest-api/.meta/template.j2
@@ -1,6 +1,8 @@
{%- import "generator_macros.j2" as macros with context -%}
-{{ macros.header(imports=["RestAPI"]) }}
+{{ macros.canonical_ref() }}
+
import json
+{{ macros.header(imports=["RestAPI"]) }}
class {{ exercise | camel_case }}Test(unittest.TestCase):
{% for casegroup in cases -%}{%- for case in casegroup["cases"] -%}
@@ -20,5 +22,3 @@ class {{ exercise | camel_case }}Test(unittest.TestCase):
expected = {{ case["expected"] }}
self.assertDictEqual(json.loads(response), expected)
{% endfor %}{% endfor %}
-
-{{ macros.footer() }}
diff --git a/exercises/practice/rest-api/rest_api_test.py b/exercises/practice/rest-api/rest_api_test.py
index 8092aec2374..6d0bd213a15 100644
--- a/exercises/practice/rest-api/rest_api_test.py
+++ b/exercises/practice/rest-api/rest_api_test.py
@@ -1,12 +1,14 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/rest-api/canonical-data.json
+# File last updated on 2023-07-19
+
+import json
import unittest
from rest_api import (
RestAPI,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-import json
-
class RestApiTest(unittest.TestCase):
def test_no_users(self):
@@ -159,7 +161,3 @@ def test_lender_owes_borrower_same_as_new_loan(self):
]
}
self.assertDictEqual(json.loads(response), expected)
-
-
-if __name__ == "__main__":
- unittest.main()
diff --git a/exercises/practice/reverse-string/.meta/template.j2 b/exercises/practice/reverse-string/.meta/template.j2
index f7e1e41f3a2..bf60c0643e8 100644
--- a/exercises/practice/reverse-string/.meta/template.j2
+++ b/exercises/practice/reverse-string/.meta/template.j2
@@ -1,5 +1,7 @@
{%- import "generator_macros.j2" as macros with context -%}
-{{ macros.header() }}
+{{ macros.canonical_ref() }}
+
+{{ macros.header()}}
class {{ exercise | camel_case }}Test(unittest.TestCase):
{% for case in cases -%}
@@ -11,5 +13,3 @@ class {{ exercise | camel_case }}Test(unittest.TestCase):
"{{- case ["expected"] }}"
)
{% endfor %}
-
-{{ macros.footer() }}
diff --git a/exercises/practice/reverse-string/reverse_string_test.py b/exercises/practice/reverse-string/reverse_string_test.py
index 78212b41def..0c3298704cc 100644
--- a/exercises/practice/reverse-string/reverse_string_test.py
+++ b/exercises/practice/reverse-string/reverse_string_test.py
@@ -1,11 +1,13 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/reverse-string/canonical-data.json
+# File last updated on 2023-07-19
+
import unittest
from reverse_string import (
reverse,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class ReverseStringTest(unittest.TestCase):
def test_an_empty_string(self):
@@ -25,7 +27,3 @@ def test_a_palindrome(self):
def test_an_even_sized_word(self):
self.assertEqual(reverse("drawer"), "reward")
-
-
-if __name__ == "__main__":
- unittest.main()
diff --git a/exercises/practice/rna-transcription/.docs/instructions.md b/exercises/practice/rna-transcription/.docs/instructions.md
index 851bdb49db7..36da381f5a7 100644
--- a/exercises/practice/rna-transcription/.docs/instructions.md
+++ b/exercises/practice/rna-transcription/.docs/instructions.md
@@ -1,6 +1,6 @@
# Instructions
-Given a DNA strand, return its RNA complement (per RNA transcription).
+Your task is determine the RNA complement of a given DNA sequence.
Both DNA and RNA strands are a sequence of nucleotides.
@@ -14,3 +14,7 @@ Given a DNA strand, its transcribed RNA strand is formed by replacing each nucle
- `C` -> `G`
- `T` -> `A`
- `A` -> `U`
+
+~~~~exercism/note
+If you want to look at how the inputs and outputs are structured, take a look at the examples in the test suite.
+~~~~
diff --git a/exercises/practice/rna-transcription/.docs/introduction.md b/exercises/practice/rna-transcription/.docs/introduction.md
new file mode 100644
index 00000000000..6b3f44b532d
--- /dev/null
+++ b/exercises/practice/rna-transcription/.docs/introduction.md
@@ -0,0 +1,16 @@
+# Introduction
+
+You work for a bioengineering company that specializes in developing therapeutic solutions.
+
+Your team has just been given a new project to develop a targeted therapy for a rare type of cancer.
+
+~~~~exercism/note
+It's all very complicated, but the basic idea is that sometimes people's bodies produce too much of a given protein.
+That can cause all sorts of havoc.
+
+But if you can create a very specific molecule (called a micro-RNA), it can prevent the protein from being produced.
+
+This technique is called [RNA Interference][rnai].
+
+[rnai]: https://admin.acceleratingscience.com/ask-a-scientist/what-is-rnai/
+~~~~
diff --git a/exercises/practice/rna-transcription/.meta/template.j2 b/exercises/practice/rna-transcription/.meta/template.j2
index 6be1210ad61..04caf39d50f 100644
--- a/exercises/practice/rna-transcription/.meta/template.j2
+++ b/exercises/practice/rna-transcription/.meta/template.j2
@@ -1,4 +1,6 @@
{%- import "generator_macros.j2" as macros with context -%}
+{{ macros.canonical_ref() }}
+
{{ macros.header()}}
class {{ exercise | camel_case }}Test(unittest.TestCase):
@@ -9,5 +11,3 @@ class {{ exercise | camel_case }}Test(unittest.TestCase):
'{{ case["expected"] }}'
)
{% endfor %}
-
-{{ macros.footer() }}
diff --git a/exercises/practice/rna-transcription/rna_transcription_test.py b/exercises/practice/rna-transcription/rna_transcription_test.py
index aa062329593..766f20299e2 100644
--- a/exercises/practice/rna-transcription/rna_transcription_test.py
+++ b/exercises/practice/rna-transcription/rna_transcription_test.py
@@ -1,11 +1,13 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/rna-transcription/canonical-data.json
+# File last updated on 2023-07-19
+
import unittest
from rna_transcription import (
to_rna,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class RnaTranscriptionTest(unittest.TestCase):
def test_empty_rna_sequence(self):
@@ -25,7 +27,3 @@ def test_rna_complement_of_adenine_is_uracil(self):
def test_rna_complement(self):
self.assertEqual(to_rna("ACGTGGTCTTAA"), "UGCACCAGAAUU")
-
-
-if __name__ == "__main__":
- unittest.main()
diff --git a/exercises/practice/robot-name/.approaches/config.json b/exercises/practice/robot-name/.approaches/config.json
new file mode 100644
index 00000000000..c71235ec7e4
--- /dev/null
+++ b/exercises/practice/robot-name/.approaches/config.json
@@ -0,0 +1,21 @@
+{
+ "introduction": {
+ "authors": ["safwansamsudeen"]
+ },
+ "approaches": [
+ {
+ "uuid": "94d82d63-0a20-44df-ad9b-14aba7c076ae",
+ "slug": "mass-name-generation",
+ "title": "Mass Name Generation",
+ "blurb": "Select from all possible names",
+ "authors": ["safwansamsudeen"]
+ },
+ {
+ "uuid": "20ca6d56-ab48-46be-a04e-98736109be0a",
+ "slug": "name-on-the-fly",
+ "title": "Find name on the fly",
+ "blurb": "Generate name and check that it hasn't been used",
+ "authors": ["safwansamsudeen"]
+ }
+ ]
+}
diff --git a/exercises/practice/robot-name/.approaches/introduction.md b/exercises/practice/robot-name/.approaches/introduction.md
new file mode 100644
index 00000000000..9dc810ed5ea
--- /dev/null
+++ b/exercises/practice/robot-name/.approaches/introduction.md
@@ -0,0 +1,59 @@
+# Introduction
+Robot Name in Python is an interesting exercise for practising randomness.
+
+## General Guidance
+Two ways immedietely come to mind: generate all the possible names and then return them sequentially, or generate a random name and ensure that it's not been previously used.
+
+Randomness can be a little, well, random, so **it's very easy to have an incorrect solution and still pass the tests**. It's strongly recommended to submit your solution for Code Review.
+
+## Approach: mass name generation
+We'd first have to generate all the possible names, shuffle them, and then use `next` (the simplest way) or maintain a `current_index` and get the name.
+Here's a possible way to do it:
+
+```python
+from itertools import product
+from random import shuffle
+from string import ascii_uppercase as letters
+
+letter_pairs = (''.join(p) for p in product(letters, letters))
+numbers = (str(i).zfill(3) for i in range(1000))
+names = [l + n for l, n in product(letter_pairs, numbers)]
+shuffle(names)
+NAMES = iter(names)
+class Robot(object):
+ def __init__(self):
+ self.reset()
+ def reset(self):
+ self.name = next(NAMES)
+```
+Note that selecting randomly from the list of all names would be incorrect, as there's a possibility of the name being repeated.
+For more detail and explanation of the code, [read here][approach-mass-name-generation].
+
+## Approach: name on the fly
+Another approach is to generate the name on the fly and add it to a cache or a store, and checking if the generated name hasn't been used previously.
+
+
+A possible way to implement this:
+```python
+from string import ascii_uppercase, digits
+from random import choices
+
+
+cache = set()
+
+
+class Robot:
+ def __get_name(self):
+ return ''.join(choices(ascii_uppercase, k=2) + choices(digits, k=3))
+
+ def reset(self):
+ while (name := self.__get_name()) in cache:
+ pass
+ cache.add(name)
+ self.name = name
+
+ def __init__(self):
+ self.reset()
+```
+
+For more detail and different ways to implement this, [read here][approach-name-on-the-fly].
\ No newline at end of file
diff --git a/exercises/practice/robot-name/.approaches/mass-name-generation/content.md b/exercises/practice/robot-name/.approaches/mass-name-generation/content.md
new file mode 100644
index 00000000000..6e5fad83e95
--- /dev/null
+++ b/exercises/practice/robot-name/.approaches/mass-name-generation/content.md
@@ -0,0 +1,49 @@
+# Mass Name Generation
+We'd first have to generate all the possible names, shuffle them, and then use `next` (the simplest way) or maintain a `current_index` and get the name.
+Note that selecting randomly from the list of all names would be incorrect, as there's a possibility of the name being repeated.
+
+Here's a possible way to do it:
+
+```python
+from itertools import product
+from random import shuffle
+from string import ascii_uppercase
+
+letter_pairs = (''.join(p) for p in product(ascii_uppercase, ascii_uppercase))
+numbers = (str(i).zfill(3) for i in range(1000))
+names = [l + n for l, n in product(letter_pairs, numbers)]
+
+shuffle(names)
+NAMES = iter(names)
+
+class Robot(object):
+ def __init__(self):
+ self.reset()
+ def reset(self):
+ self.name = next(NAMES)
+```
+
+The first few lines of the mass name generation uses [`itertools.product`][itertools-product].
+The resultant code is a simplification of:
+```python
+letter_pairs = (''.join((l1, l2)) for l1 in ascii_uppercase for l2 in ascii_uppercase)
+numbers = (str(i).zfill(3) for i in range(1000))
+names = [l + n for l in letter_pairs for n in numbers]
+```
+
+After the name generation, the names are shuffled - using the [default `seed`][random-seed] in the `random` module (the current timestamp).
+When the tests reseed `random`, this has no effect as the names were shuffled before that.
+
+We then set `NAMES` to the iterable of names, and in `reset`, set the robot's name to the `next(name)`.
+If you'd like, read more on [`iter` and `next`][iter-and-next].
+
+Unlike the on the fly approach, this has a relatively short "generation" time, because we're merely giving the `next` name instead of generating it.
+However, this has a huge startup memory and time cost, as 676,000 strings have to be calculated and stored.
+For an approximate calculation, 676,000 strings * 5 characters / string * 1 byte / character gives 3380000 bytes or 3.38 MB of RAM - and that's just the memory aspect of it.
+Sounds small, but it's relatively very expensive at the beginning.
+
+Thus, this approach is inefficient in cases where only a small amount of names are needed _and_ the time to set/reset the robot isn't crucial.
+
+[random-seed]: https://docs.python.org/3/library/random.html#random.seed
+[iter-and-next]: https://www.programiz.com/python-programming/methods/built-in/iter
+[itertools-product]: https://www.hackerrank.com/challenges/itertools-product/problem
\ No newline at end of file
diff --git a/exercises/practice/robot-name/.approaches/mass-name-generation/snippet.txt b/exercises/practice/robot-name/.approaches/mass-name-generation/snippet.txt
new file mode 100644
index 00000000000..341230946b2
--- /dev/null
+++ b/exercises/practice/robot-name/.approaches/mass-name-generation/snippet.txt
@@ -0,0 +1,8 @@
+...
+names = [l + n for l, n in product(letter_pairs, numbers)]
+shuffle(names)
+NAMES = iter(names)
+
+class Robot(object):
+ def reset(self):
+ self.name = next(NAMES)
\ No newline at end of file
diff --git a/exercises/practice/robot-name/.approaches/name-on-the-fly/content.md b/exercises/practice/robot-name/.approaches/name-on-the-fly/content.md
new file mode 100644
index 00000000000..0aa9f9a3fab
--- /dev/null
+++ b/exercises/practice/robot-name/.approaches/name-on-the-fly/content.md
@@ -0,0 +1,52 @@
+# Find name on the fly
+We generate the name on the fly and add it to a cache or a store, and checking if the generated name hasn't been used previously.
+
+A possible way to implement this:
+```python
+from string import ascii_uppercase, digits
+from random import choices
+
+cache = set()
+
+
+class Robot:
+ def __get_name(self):
+ return ''.join(choices(ascii_uppercase, k=2) + choices(digits, k=3))
+
+ def reset(self):
+ while (name := self.__get_name()) in cache:
+ pass
+ cache.add(name)
+ self.name = name
+
+ def __init__(self):
+ self.reset()
+```
+We use a `set` for the cache as it has a low access time, and we don't need the preservation of order or the ability to be indexed.
+
+This way is merely one of the many to generate the name.
+Another way might be to use `randrange` along with `zfill` for the number part, and a double `random.choice` / `random.choice` on `itertools.product` to generate the letter part.
+This is the shortest way, and best utilizes the Python standard library.
+
+As we're using a `while` loop to check for the name generation, it's convenient to store the local `name` using the [walrus operator][walrus-operator].
+It's also possible to find the name before the loop and find it again inside the loop, but that would unnecessary repetition.
+A helper method ([private][private-helper-methods] in this case) makes your code cleaner, but it's equally valid to have the code in the loop itself:
+```python
+def reset(self):
+ while (name := ''.join(choices(ascii_uppercase, k=2) + choices(digits, k=3))) in cache:
+ pass
+ cache.add(name)
+ self.name = name
+```
+
+We call `reset` from `__init__` - it's syntactically valid to do it the other way round, but it's not considered good practice to call [dunder methods][dunder-methods] directly.
+
+This has almost no startup time and memory, apart from declaring an empty `set`.
+Note that the _generation_ time is the same as the mass generation approach, as a similar method is used.
+However, as the name is generated at the time of setting/resetting, the method time itself is higher.
+
+In the long run, if many names are generated, this is inefficient, since collisions will start being generated more often than unique names.
+
+[walrus-operator]: https://realpython.com/python-walrus-operator/
+[private-helper-methods]: https://www.geeksforgeeks.org/private-methods-in-python/
+[dunder-methods]: https://dbader.org/blog/python-dunder-methods
\ No newline at end of file
diff --git a/exercises/practice/robot-name/.approaches/name-on-the-fly/snippet.txt b/exercises/practice/robot-name/.approaches/name-on-the-fly/snippet.txt
new file mode 100644
index 00000000000..e6ab23e7be5
--- /dev/null
+++ b/exercises/practice/robot-name/.approaches/name-on-the-fly/snippet.txt
@@ -0,0 +1,8 @@
+cache = set()
+class Robot:
+ def reset(self):
+ while (name := ''.join(choices(ascii_uppercase, k=2) + choices(digits, k=3))) in cache:
+ pass
+ cache.add(name)
+ self.name = name
+ def __init__(self): self.reset()
\ No newline at end of file
diff --git a/exercises/practice/robot-simulator/.meta/template.j2 b/exercises/practice/robot-simulator/.meta/template.j2
index e7297734377..787ff40bb63 100644
--- a/exercises/practice/robot-simulator/.meta/template.j2
+++ b/exercises/practice/robot-simulator/.meta/template.j2
@@ -1,4 +1,7 @@
{%- import "generator_macros.j2" as macros with context -%}
+{{ macros.canonical_ref() }}
+
+{{ macros.header(imports=["Robot", "NORTH", "EAST", "SOUTH", "WEST"]) }}
{% macro test_case(case) -%}
{%- set input = case["input"] -%}
@@ -15,7 +18,6 @@
self.assertEqual(robot.direction, {{case["expected"]["direction"] | upper }})
{%- endmacro %}
-{{ macros.header(imports=["Robot", "NORTH", "EAST", "SOUTH", "WEST"]) }}
class {{ exercise | camel_case }}Test(unittest.TestCase):
{% for supercase in cases %}
diff --git a/exercises/practice/robot-simulator/robot_simulator_test.py b/exercises/practice/robot-simulator/robot_simulator_test.py
index ffb5728c301..69825c11186 100644
--- a/exercises/practice/robot-simulator/robot_simulator_test.py
+++ b/exercises/practice/robot-simulator/robot_simulator_test.py
@@ -1,3 +1,7 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/robot-simulator/canonical-data.json
+# File last updated on 2023-07-19
+
import unittest
from robot_simulator import (
@@ -8,8 +12,6 @@
WEST,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class RobotSimulatorTest(unittest.TestCase):
diff --git a/exercises/practice/roman-numerals/.docs/instructions.md b/exercises/practice/roman-numerals/.docs/instructions.md
index bb7e909dbf2..247ea0892e0 100644
--- a/exercises/practice/roman-numerals/.docs/instructions.md
+++ b/exercises/practice/roman-numerals/.docs/instructions.md
@@ -36,6 +36,6 @@ In Roman numerals 1990 is MCMXC:
2000=MM
8=VIII
-Learn more about [Roman numberals on Wikipedia][roman-numerals].
+Learn more about [Roman numerals on Wikipedia][roman-numerals].
[roman-numerals]: https://wiki.imperivm-romanvm.com/wiki/Roman_Numerals
diff --git a/exercises/practice/roman-numerals/.meta/template.j2 b/exercises/practice/roman-numerals/.meta/template.j2
index f85f619fa70..a972569f0f3 100644
--- a/exercises/practice/roman-numerals/.meta/template.j2
+++ b/exercises/practice/roman-numerals/.meta/template.j2
@@ -1,4 +1,6 @@
{%- import "generator_macros.j2" as macros with context -%}
+{{ macros.canonical_ref() }}
+
{{ macros.header(["roman"]) }}
class {{ exercise | camel_case }}Test(unittest.TestCase):
{% for case in cases -%}
diff --git a/exercises/practice/roman-numerals/roman_numerals_test.py b/exercises/practice/roman-numerals/roman_numerals_test.py
index 59e5e697fa2..d2120f9b151 100644
--- a/exercises/practice/roman-numerals/roman_numerals_test.py
+++ b/exercises/practice/roman-numerals/roman_numerals_test.py
@@ -1,10 +1,14 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/roman-numerals/canonical-data.json
+# File last updated on 2023-07-19
+
import unittest
from roman_numerals import (
roman,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
+
class RomanNumeralsTest(unittest.TestCase):
def test_1_is_i(self):
self.assertEqual(roman(1), "I")
diff --git a/exercises/practice/rotational-cipher/.meta/template.j2 b/exercises/practice/rotational-cipher/.meta/template.j2
index 5a84641528c..94a54cf6a86 100644
--- a/exercises/practice/rotational-cipher/.meta/template.j2
+++ b/exercises/practice/rotational-cipher/.meta/template.j2
@@ -1,5 +1,7 @@
{%- import "generator_macros.j2" as macros with context -%}
-{{ macros.header() }}
+{{ macros.canonical_ref() }}
+
+{{ macros.header()}}
class {{ exercise | camel_case }}Test(unittest.TestCase):
{% for case in cases %}
@@ -10,5 +12,3 @@ class {{ exercise | camel_case }}Test(unittest.TestCase):
self.assertEqual({{ case["property"] }}("{{ text }}", {{ shiftKey }}), "{{ expected }}")
{% endfor %}
-
-{{ macros.footer() }}
\ No newline at end of file
diff --git a/exercises/practice/rotational-cipher/rotational_cipher_test.py b/exercises/practice/rotational-cipher/rotational_cipher_test.py
index 88b64d6edb4..ca22735ef9b 100644
--- a/exercises/practice/rotational-cipher/rotational_cipher_test.py
+++ b/exercises/practice/rotational-cipher/rotational_cipher_test.py
@@ -1,11 +1,13 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/rotational-cipher/canonical-data.json
+# File last updated on 2023-07-19
+
import unittest
from rotational_cipher import (
rotate,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class RotationalCipherTest(unittest.TestCase):
def test_rotate_a_by_0_same_output_as_input(self):
@@ -40,7 +42,3 @@ def test_rotate_all_letters(self):
rotate("The quick brown fox jumps over the lazy dog.", 13),
"Gur dhvpx oebja sbk whzcf bire gur ynml qbt.",
)
-
-
-if __name__ == "__main__":
- unittest.main()
diff --git a/exercises/practice/run-length-encoding/.meta/template.j2 b/exercises/practice/run-length-encoding/.meta/template.j2
index 54a4a5be613..6bd93167bc3 100644
--- a/exercises/practice/run-length-encoding/.meta/template.j2
+++ b/exercises/practice/run-length-encoding/.meta/template.j2
@@ -1,4 +1,7 @@
{%- import "generator_macros.j2" as macros with context -%}
+{{ macros.canonical_ref() }}
+
+{{ macros.header(['encode','decode'])}}
{% macro test_case(case, tmod) -%}
{%- set input = case["input"] -%}
@@ -13,7 +16,6 @@
)
{%- endmacro %}
-{{ macros.header(['encode','decode'])}}
class {{ exercise | camel_case }}Test(unittest.TestCase):
{% for supercase in cases -%}
diff --git a/exercises/practice/run-length-encoding/run_length_encoding_test.py b/exercises/practice/run-length-encoding/run_length_encoding_test.py
index 9ac78f6d23c..8d65cb62e23 100644
--- a/exercises/practice/run-length-encoding/run_length_encoding_test.py
+++ b/exercises/practice/run-length-encoding/run_length_encoding_test.py
@@ -1,3 +1,7 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/run-length-encoding/canonical-data.json
+# File last updated on 2023-07-19
+
import unittest
from run_length_encoding import (
@@ -5,8 +9,6 @@
decode,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class RunLengthEncodingTest(unittest.TestCase):
def test_encode_empty_string(self):
diff --git a/exercises/practice/saddle-points/.docs/instructions.md b/exercises/practice/saddle-points/.docs/instructions.md
index 920ecffed98..c585568b462 100644
--- a/exercises/practice/saddle-points/.docs/instructions.md
+++ b/exercises/practice/saddle-points/.docs/instructions.md
@@ -1,25 +1,26 @@
# Instructions
-Detect saddle points in a matrix.
+Your task is to find the potential trees where you could build your tree house.
-So say you have a matrix like so:
+The data company provides the data as grids that show the heights of the trees.
+The rows of the grid represent the east-west direction, and the columns represent the north-south direction.
-```text
- 1 2 3
- |---------
-1 | 9 8 7
-2 | 5 3 2 <--- saddle point at row 2, column 1, with value 5
-3 | 6 6 7
-```
-
-It has a saddle point at row 2, column 1.
+An acceptable tree will be the largest in its row, while being the smallest in its column.
-It's called a "saddle point" because it is greater than or equal to every element in its row and less than or equal to every element in its column.
+A grid might not have any good trees at all.
+Or it might have one, or even several.
-A matrix may have zero or more saddle points.
+Here is a grid that has exactly one candidate tree.
-Your code should be able to provide the (possibly empty) list of all the saddle points for any given matrix.
+```text
+ 1 2 3 4
+ |-----------
+1 | 9 8 7 8
+2 | 5 3 2 4 <--- potential tree house at row 2, column 1, for tree with height 5
+3 | 6 6 7 1
+```
-The matrix can have a different number of rows and columns (Non square).
+- Row 2 has values 5, 3, 2, and 4. The largest value is 5.
+- Column 1 has values 9, 5, and 6. The smallest value is 5.
-Note that you may find other definitions of matrix saddle points online, but the tests for this exercise follow the above unambiguous definition.
+So the point at `[2, 1]` (row: 2, column: 1) is a great spot for a tree house.
diff --git a/exercises/practice/saddle-points/.docs/introduction.md b/exercises/practice/saddle-points/.docs/introduction.md
new file mode 100644
index 00000000000..34b2c77e0cf
--- /dev/null
+++ b/exercises/practice/saddle-points/.docs/introduction.md
@@ -0,0 +1,11 @@
+# Introduction
+
+You plan to build a tree house in the woods near your house so that you can watch the sun rise and set.
+
+You've obtained data from a local survey company that show the height of every tree in each rectangular section of the map.
+You need to analyze each grid on the map to find good trees for your tree house.
+
+A good tree is both:
+
+- taller than every tree to the east and west, so that you have the best possible view of the sunrises and sunsets.
+- shorter than every tree to the north and south, to minimize the amount of tree climbing.
diff --git a/exercises/practice/saddle-points/.meta/template.j2 b/exercises/practice/saddle-points/.meta/template.j2
index 35e4ed56b9b..d04e6d0e883 100644
--- a/exercises/practice/saddle-points/.meta/template.j2
+++ b/exercises/practice/saddle-points/.meta/template.j2
@@ -1,11 +1,7 @@
-"""Tests for the saddle-points exercise
+{%- import "generator_macros.j2" as macros with context -%}
+{{ macros.canonical_ref() }}
-Implementation note:
-The saddle_points function must validate the input matrix and raise a
-ValueError with a meaningful error message if the matrix turns out to be
-irregular.
-"""
-{% import "generator_macros.j2" as macros with context -%}
+{{ macros.header()}}
{% macro test_case(case) -%}
{%- set input = case["input"] -%}
@@ -29,7 +25,6 @@ irregular.
{% endif -%}
{% endmacro -%}
-{{ macros.header()}}
def sorted_points(point_list):
return sorted(point_list, key=lambda p: (p["row"], p["column"]))
diff --git a/exercises/practice/saddle-points/saddle_points_test.py b/exercises/practice/saddle-points/saddle_points_test.py
index 24c18e09b7f..78ddf2484d9 100644
--- a/exercises/practice/saddle-points/saddle_points_test.py
+++ b/exercises/practice/saddle-points/saddle_points_test.py
@@ -1,18 +1,13 @@
-"""Tests for the saddle-points exercise
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/saddle-points/canonical-data.json
+# File last updated on 2023-07-19
-Implementation note:
-The saddle_points function must validate the input matrix and raise a
-ValueError with a meaningful error message if the matrix turns out to be
-irregular.
-"""
import unittest
from saddle_points import (
saddle_points,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
def sorted_points(point_list):
return sorted(point_list, key=lambda p: (p["row"], p["column"]))
diff --git a/exercises/practice/satellite/.meta/template.j2 b/exercises/practice/satellite/.meta/template.j2
index 3bd41df23aa..d8ee854568a 100644
--- a/exercises/practice/satellite/.meta/template.j2
+++ b/exercises/practice/satellite/.meta/template.j2
@@ -1,5 +1,7 @@
{%- import "generator_macros.j2" as macros with context -%}
-{{ macros.header() }}
+{{ macros.canonical_ref() }}
+
+{{ macros.header()}}
class {{ exercise | camel_case }}Test(unittest.TestCase):
{% for case in cases -%}
diff --git a/exercises/practice/satellite/satellite_test.py b/exercises/practice/satellite/satellite_test.py
index 2eb329c2f96..f44a5384798 100644
--- a/exercises/practice/satellite/satellite_test.py
+++ b/exercises/practice/satellite/satellite_test.py
@@ -1,11 +1,13 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/satellite/canonical-data.json
+# File last updated on 2023-07-19
+
import unittest
from satellite import (
tree_from_traversals,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class SatelliteTest(unittest.TestCase):
def test_empty_tree(self):
diff --git a/exercises/practice/say/.docs/instructions.append.md b/exercises/practice/say/.docs/instructions.append.md
index aed8f067747..43365a7397a 100644
--- a/exercises/practice/say/.docs/instructions.append.md
+++ b/exercises/practice/say/.docs/instructions.append.md
@@ -12,6 +12,6 @@ To raise a `ValueError` with a message, write the message as an argument to the
# if the number is negative
raise ValueError("input out of range")
-# if the number is larger than 999,999,999,99
+# if the number is larger than 999,999,999,999
raise ValueError("input out of range")
```
diff --git a/exercises/practice/say/.meta/template.j2 b/exercises/practice/say/.meta/template.j2
index 77fa67a1ca3..81d61a694c7 100644
--- a/exercises/practice/say/.meta/template.j2
+++ b/exercises/practice/say/.meta/template.j2
@@ -1,12 +1,14 @@
{%- import "generator_macros.j2" as macros with context -%}
+{{ macros.canonical_ref() }}
+
+{{ macros.header()}}
{%- macro test_call(case) %}
{{ case["property"] }}(
{{ case["input"]["number"] }}
)
-{% endmacro -%}
+{% endmacro %}
-{{ macros.header() }}
class {{ exercise | camel_case }}Test(unittest.TestCase):
{% for case in cases -%}
diff --git a/exercises/practice/say/say_test.py b/exercises/practice/say/say_test.py
index 22deb5364cb..1b9cbdea929 100644
--- a/exercises/practice/say/say_test.py
+++ b/exercises/practice/say/say_test.py
@@ -1,11 +1,13 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/say/canonical-data.json
+# File last updated on 2023-07-19
+
import unittest
from say import (
say,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class SayTest(unittest.TestCase):
def test_zero(self):
diff --git a/exercises/practice/scale-generator/.meta/template.j2 b/exercises/practice/scale-generator/.meta/template.j2
index b65b5f09789..d802db09b4f 100644
--- a/exercises/practice/scale-generator/.meta/template.j2
+++ b/exercises/practice/scale-generator/.meta/template.j2
@@ -1,4 +1,7 @@
{%- import "generator_macros.j2" as macros with context -%}
+{{ macros.canonical_ref() }}
+
+{{ macros.header(["Scale"])}}
{% macro test_case(case) -%}
{%- set tonic = case["input"]["tonic"] -%}
@@ -19,12 +22,8 @@
{% endfor %}
{%- endmacro %}
-{{ macros.header(["Scale"])}}
class {{ exercise | camel_case }}Test(unittest.TestCase):
{% for supercase in cases %}
{{ test_supercase(supercase) }}
{% endfor %}
-
-
-{{ macros.footer() }}
diff --git a/exercises/practice/scale-generator/scale_generator_test.py b/exercises/practice/scale-generator/scale_generator_test.py
index 7edc118c778..c2346119b6d 100644
--- a/exercises/practice/scale-generator/scale_generator_test.py
+++ b/exercises/practice/scale-generator/scale_generator_test.py
@@ -1,11 +1,13 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/scale-generator/canonical-data.json
+# File last updated on 2023-07-19
+
import unittest
from scale_generator import (
Scale,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class ScaleGeneratorTest(unittest.TestCase):
@@ -78,7 +80,3 @@ def test_pentatonic(self):
def test_enigmatic(self):
expected = ["G", "G#", "B", "C#", "D#", "F", "F#", "G"]
self.assertEqual(Scale("G").interval("mAMMMmm"), expected)
-
-
-if __name__ == "__main__":
- unittest.main()
diff --git a/exercises/practice/scrabble-score/.meta/template.j2 b/exercises/practice/scrabble-score/.meta/template.j2
index f122b916b32..0688c940fdd 100644
--- a/exercises/practice/scrabble-score/.meta/template.j2
+++ b/exercises/practice/scrabble-score/.meta/template.j2
@@ -1,4 +1,8 @@
{%- import "generator_macros.j2" as macros with context -%}
+{{ macros.canonical_ref() }}
+
+{{ macros.header()}}
+
{% macro test_case(case) -%}
{%- set input = case["input"] -%}
def test_{{ case["description"] | to_snake }}(self):
@@ -7,12 +11,9 @@
{{ case["expected"] }}
)
{%- endmacro %}
-{{ macros.header()}}
class {{ exercise | camel_case }}Test(unittest.TestCase):
{% for case in cases -%}
{{ test_case(case) }}
{% endfor %}
-
-
-{{ macros.footer() }}
+
\ No newline at end of file
diff --git a/exercises/practice/scrabble-score/scrabble_score_test.py b/exercises/practice/scrabble-score/scrabble_score_test.py
index e8d7eff75ea..7121cf640e1 100644
--- a/exercises/practice/scrabble-score/scrabble_score_test.py
+++ b/exercises/practice/scrabble-score/scrabble_score_test.py
@@ -1,11 +1,13 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/scrabble-score/canonical-data.json
+# File last updated on 2023-07-19
+
import unittest
from scrabble_score import (
score,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class ScrabbleScoreTest(unittest.TestCase):
def test_lowercase_letter(self):
@@ -40,7 +42,3 @@ def test_empty_input(self):
def test_entire_alphabet_available(self):
self.assertEqual(score("abcdefghijklmnopqrstuvwxyz"), 87)
-
-
-if __name__ == "__main__":
- unittest.main()
diff --git a/exercises/practice/secret-handshake/.docs/instructions.md b/exercises/practice/secret-handshake/.docs/instructions.md
index 77136cf0f7b..d2120b9bf2e 100644
--- a/exercises/practice/secret-handshake/.docs/instructions.md
+++ b/exercises/practice/secret-handshake/.docs/instructions.md
@@ -43,5 +43,6 @@ jump, double blink
~~~~exercism/note
If you aren't sure what binary is or how it works, check out [this binary tutorial][intro-to-binary].
+
[intro-to-binary]: https://medium.com/basecs/bits-bytes-building-with-binary-13cb4289aafa
~~~~
diff --git a/exercises/practice/secret-handshake/.meta/config.json b/exercises/practice/secret-handshake/.meta/config.json
index cca237b478e..7972aa1f5a0 100644
--- a/exercises/practice/secret-handshake/.meta/config.json
+++ b/exercises/practice/secret-handshake/.meta/config.json
@@ -31,5 +31,5 @@
},
"blurb": "Given a decimal number, convert it to the appropriate sequence of events for a secret handshake.",
"source": "Bert, in Mary Poppins",
- "source_url": "https://www.imdb.com/title/tt0058331/quotes/qt0437047"
+ "source_url": "https://www.imdb.com/title/tt0058331/quotes/?item=qt0437047"
}
diff --git a/exercises/practice/secret-handshake/.meta/template.j2 b/exercises/practice/secret-handshake/.meta/template.j2
index 459e9c9875e..b45136a57c2 100644
--- a/exercises/practice/secret-handshake/.meta/template.j2
+++ b/exercises/practice/secret-handshake/.meta/template.j2
@@ -1,10 +1,10 @@
{%- import "generator_macros.j2" as macros with context -%}
-{{ macros.header() }}
+{{ macros.canonical_ref() }}
+
+{{ macros.header()}}
class {{ exercise | camel_case }}Test(unittest.TestCase):
{% for case in cases -%}
def test_{{ case["description"] | to_snake }}(self):
self.assertEqual({{ case["property"] }}("{{ plugins.to_binary(case["input"]["number"]) }}"), {{ case["expected"] }})
{% endfor %}
-
-{{ macros.footer() }}
diff --git a/exercises/practice/secret-handshake/secret_handshake_test.py b/exercises/practice/secret-handshake/secret_handshake_test.py
index 959c866981a..544da4e2718 100644
--- a/exercises/practice/secret-handshake/secret_handshake_test.py
+++ b/exercises/practice/secret-handshake/secret_handshake_test.py
@@ -1,11 +1,13 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/secret-handshake/canonical-data.json
+# File last updated on 2023-07-19
+
import unittest
from secret_handshake import (
commands,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class SecretHandshakeTest(unittest.TestCase):
def test_wink_for_1(self):
@@ -44,7 +46,3 @@ def test_reverse_all_possible_actions(self):
def test_do_nothing_for_zero(self):
self.assertEqual(commands("00000"), [])
-
-
-if __name__ == "__main__":
- unittest.main()
diff --git a/exercises/practice/series/.meta/template.j2 b/exercises/practice/series/.meta/template.j2
index 2e7f60e4fd2..c9ac185ab0c 100644
--- a/exercises/practice/series/.meta/template.j2
+++ b/exercises/practice/series/.meta/template.j2
@@ -1,5 +1,7 @@
{%- import "generator_macros.j2" as macros with context -%}
-{{ macros.header() }}
+{{ macros.canonical_ref() }}
+
+{{ macros.header()}}
class {{ exercise | camel_case }}Test(unittest.TestCase):
{% for case in cases -%}
diff --git a/exercises/practice/series/series_test.py b/exercises/practice/series/series_test.py
index 7f6de7a4669..5e0a33d9932 100644
--- a/exercises/practice/series/series_test.py
+++ b/exercises/practice/series/series_test.py
@@ -1,11 +1,13 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/series/canonical-data.json
+# File last updated on 2023-07-19
+
import unittest
from series import (
slices,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class SeriesTest(unittest.TestCase):
def test_slices_of_one_from_one(self):
diff --git a/exercises/practice/sgf-parsing/.meta/template.j2 b/exercises/practice/sgf-parsing/.meta/template.j2
index 7017a436480..3e968bec534 100644
--- a/exercises/practice/sgf-parsing/.meta/template.j2
+++ b/exercises/practice/sgf-parsing/.meta/template.j2
@@ -1,4 +1,7 @@
{%- import "generator_macros.j2" as macros with context -%}
+{{ macros.canonical_ref() }}
+
+{{ macros.header(["parse","SgfTree"])}}
{% macro escape_sequences(string) -%}
{{ string | replace("\\", "\\\\") | replace("\n", "\\n") | replace("\t", "\\t") }}
@@ -43,7 +46,6 @@
{% endfor -%} }
{%- endmacro -%}
-{{ macros.header(["parse","SgfTree"])}}
class {{ exercise | camel_case }}Test(unittest.TestCase):
{% for case in cases %}
diff --git a/exercises/practice/sgf-parsing/sgf_parsing_test.py b/exercises/practice/sgf-parsing/sgf_parsing_test.py
index b3d43ed09df..c33a5dbecff 100644
--- a/exercises/practice/sgf-parsing/sgf_parsing_test.py
+++ b/exercises/practice/sgf-parsing/sgf_parsing_test.py
@@ -1,3 +1,7 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/sgf-parsing/canonical-data.json
+# File last updated on 2023-07-19
+
import unittest
from sgf_parsing import (
@@ -5,8 +9,6 @@
SgfTree,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class SgfParsingTest(unittest.TestCase):
def test_empty_input(self):
diff --git a/exercises/practice/sieve/.docs/instructions.md b/exercises/practice/sieve/.docs/instructions.md
index ec14620ce45..3adf1d551be 100644
--- a/exercises/practice/sieve/.docs/instructions.md
+++ b/exercises/practice/sieve/.docs/instructions.md
@@ -18,11 +18,11 @@ Then you repeat the following steps:
You keep repeating these steps until you've gone through every number in your list.
At the end, all the unmarked numbers are prime.
-```exercism/note
+~~~~exercism/note
[Wikipedia's Sieve of Eratosthenes article][eratosthenes] has a useful graphic that explains the algorithm.
The tests don't check that you've implemented the algorithm, only that you've come up with the correct list of primes.
A good first test is to check that you do not use division or remainder operations.
[eratosthenes]: https://en.wikipedia.org/wiki/Sieve_of_Eratosthenes
-```
+~~~~
diff --git a/exercises/practice/sieve/.meta/template.j2 b/exercises/practice/sieve/.meta/template.j2
index e26e4e4c1ce..d12df86bb15 100644
--- a/exercises/practice/sieve/.meta/template.j2
+++ b/exercises/practice/sieve/.meta/template.j2
@@ -1,5 +1,7 @@
{%- import "generator_macros.j2" as macros with context -%}
-{{ macros.header() }}
+{{ macros.canonical_ref() }}
+
+{{ macros.header()}}
class {{ exercise | camel_case }}Test(unittest.TestCase):
{% for case in cases -%}
@@ -7,5 +9,3 @@ class {{ exercise | camel_case }}Test(unittest.TestCase):
self.assertEqual({{ case["property"] }}({{ case["input"]["limit"] }}), {{ case["expected"] }})
{% endfor %}
-
-{{ macros.footer() }}
diff --git a/exercises/practice/sieve/sieve_test.py b/exercises/practice/sieve/sieve_test.py
index d9fa67262b3..d9b88558316 100644
--- a/exercises/practice/sieve/sieve_test.py
+++ b/exercises/practice/sieve/sieve_test.py
@@ -1,11 +1,13 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/sieve/canonical-data.json
+# File last updated on 2023-07-19
+
import unittest
from sieve import (
primes,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class SieveTest(unittest.TestCase):
def test_no_primes_under_two(self):
@@ -194,7 +196,3 @@ def test_find_primes_up_to_1000(self):
997,
],
)
-
-
-if __name__ == "__main__":
- unittest.main()
diff --git a/exercises/practice/simple-cipher/.meta/template.j2 b/exercises/practice/simple-cipher/.meta/template.j2
index ca20aa30114..fa7483a5590 100644
--- a/exercises/practice/simple-cipher/.meta/template.j2
+++ b/exercises/practice/simple-cipher/.meta/template.j2
@@ -1,6 +1,9 @@
{%- import "generator_macros.j2" as macros with context -%}
+{{ macros.canonical_ref() }}
+
import re
{{ macros.header(imports=['Cipher']) }}
+
{%- macro convert_js(s) -%}
{{ s |
regex_replace("\\.substring\\((\\d+), ([^)]+)\\)", "[\\1:\\2]") |
@@ -59,5 +62,3 @@ class {{ cases["description"] | camel_case }}Test(unittest.TestCase):
{% endfor %}
{% endfor %}
-
-{{ macros.footer() }}
diff --git a/exercises/practice/simple-cipher/simple_cipher_test.py b/exercises/practice/simple-cipher/simple_cipher_test.py
index 07c0c3d5b5d..bc1efa9f86d 100644
--- a/exercises/practice/simple-cipher/simple_cipher_test.py
+++ b/exercises/practice/simple-cipher/simple_cipher_test.py
@@ -1,3 +1,7 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/simple-cipher/canonical-data.json
+# File last updated on 2023-07-20
+
import re
import unittest
@@ -5,8 +9,6 @@
Cipher,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class RandomKeyCipherTest(unittest.TestCase):
def test_can_encode(self):
@@ -64,7 +66,3 @@ def test_can_encode_messages_longer_than_the_key(self):
def test_can_decode_messages_longer_than_the_key(self):
cipher = Cipher("abc")
self.assertEqual(cipher.decode("iboaqcnecbfcr"), "iamapandabear")
-
-
-if __name__ == "__main__":
- unittest.main()
diff --git a/exercises/practice/simple-linked-list/.docs/hints.md b/exercises/practice/simple-linked-list/.docs/hints.md
index 4fd7f9ace08..1ecef83ea24 100644
--- a/exercises/practice/simple-linked-list/.docs/hints.md
+++ b/exercises/practice/simple-linked-list/.docs/hints.md
@@ -5,7 +5,7 @@
- This challenge is about creating a [_stack_][Baeldung: The Stack Data Structure] using a [singly linked list][singly linked list].
- Unlike stacks underpinned with `lists`, `collections.deque`, or `queue.LifoQueue`, we ask you create custom `Node` and `LinkedList` [`classes`][classes tutorial] to store and link elements.
-
+
- [Real Python: Linked Lists][Real Python Linked Lists], [Towards Data Science: Demystifying the Linked List][towards data science demystifying the linked list], and [ADS Stack in Python][Koder Dojo Coding an ADS Stack in Python] can be helpful to review for details on implementation.
- Your `LinkedList` should accept a `list` argument to its _constructor_, but should not use a `list` to store nodes or elements.
diff --git a/exercises/practice/simple-linked-list/.docs/instructions.append.md b/exercises/practice/simple-linked-list/.docs/instructions.append.md
index 8e565516c46..41db11df966 100644
--- a/exercises/practice/simple-linked-list/.docs/instructions.append.md
+++ b/exercises/practice/simple-linked-list/.docs/instructions.append.md
@@ -4,12 +4,12 @@
While `stacks` and `queues` can be implemented using `lists`, `collections.deque`, `queue.LifoQueue`, and `multiprocessing.Queue`, this exercise expects a ["Last in, First Out" (`LIFO`) stack][Baeldung: The Stack Data Structure] (_interactive example [here][LIFO Stack]_) using a _custom-made_ [singly linked list][singly linked list].
-
+
This should not be confused with a [`LIFO` stack using a dynamic array or list][LIFO Stack Array], which may use a `list` underneath.
Dynamic array based `stacks` have a different `head` position and different time complexity (Big-O) and memory footprint.
-
+
See these two Stack Overflow questions for some considerations: [Array-Based vs List-Based Stacks and Queues][Stack Overflow: Array-Based vs List-Based Stacks and Queues] and [Differences between Array Stack, Linked Stack, and Stack][Stack Overflow: What is the difference between Array Stack, Linked Stack, and Stack].
diff --git a/exercises/practice/simple-linked-list/.docs/instructions.md b/exercises/practice/simple-linked-list/.docs/instructions.md
index 4d845fac06c..04640b1fb03 100644
--- a/exercises/practice/simple-linked-list/.docs/instructions.md
+++ b/exercises/practice/simple-linked-list/.docs/instructions.md
@@ -1,15 +1,19 @@
# Instructions
-Write a simple linked list implementation that uses Elements and a List.
+Write a prototype of the music player application.
-The linked list is a fundamental data structure in computer science, often used in the implementation of other data structures.
-They're pervasive in functional programming languages, such as Clojure, Erlang, or Haskell, but far less common in imperative languages such as Ruby or Python.
+For the prototype, each song will simply be represented by a number.
+Given a range of numbers (the song IDs), create a singly linked list.
+
+Given a singly linked list, you should be able to reverse the list to play the songs in the opposite order.
-The simplest kind of linked list is a singly linked list.
-Each element in the list contains data and a "next" field pointing to the next element in the list of elements.
+~~~~exercism/note
+The linked list is a fundamental data structure in computer science, often used in the implementation of other data structures.
-This variant of linked lists is often used to represent sequences or push-down stacks (also called a LIFO stack; Last In, First Out).
+The simplest kind of linked list is a **singly** linked list.
+That means that each element (or "node") contains data, along with something that points to the next node in the list.
-As a first take, lets create a singly linked list to contain the range (1..10), and provide functions to reverse a linked list and convert to and from arrays.
+If you want to dig deeper into linked lists, check out [this article][intro-linked-list] that explains it using nice drawings.
-When implementing this in a language with built-in linked lists, implement your own abstract data type.
+[intro-linked-list]: https://medium.com/basecs/whats-a-linked-list-anyway-part-1-d8b7e6508b9d
+~~~~
diff --git a/exercises/practice/simple-linked-list/.docs/introduction.md b/exercises/practice/simple-linked-list/.docs/introduction.md
new file mode 100644
index 00000000000..0e1df72f9bf
--- /dev/null
+++ b/exercises/practice/simple-linked-list/.docs/introduction.md
@@ -0,0 +1,5 @@
+# Introduction
+
+You work for a music streaming company.
+
+You've been tasked with creating a playlist feature for your music player application.
diff --git a/exercises/practice/space-age/.meta/template.j2 b/exercises/practice/space-age/.meta/template.j2
index a7822ad6495..d939487f8a3 100644
--- a/exercises/practice/space-age/.meta/template.j2
+++ b/exercises/practice/space-age/.meta/template.j2
@@ -1,4 +1,6 @@
{%- import "generator_macros.j2" as macros with context -%}
+{{ macros.canonical_ref() }}
+
{{ macros.header(["SpaceAge"]) }}
class {{ exercise | camel_case }}Test(unittest.TestCase):
@@ -9,5 +11,4 @@ class {{ exercise | camel_case }}Test(unittest.TestCase):
self.assertEqual(SpaceAge({{ seconds }}).on_{{ planet | lower }}(), {{ case["expected"] }})
{% endfor %}
-
-{{ macros.footer() }}
+
\ No newline at end of file
diff --git a/exercises/practice/space-age/space_age_test.py b/exercises/practice/space-age/space_age_test.py
index b3f91ca0673..ddde365d6bf 100644
--- a/exercises/practice/space-age/space_age_test.py
+++ b/exercises/practice/space-age/space_age_test.py
@@ -1,11 +1,13 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/space-age/canonical-data.json
+# File last updated on 2023-07-19
+
import unittest
from space_age import (
SpaceAge,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class SpaceAgeTest(unittest.TestCase):
def test_age_on_earth(self):
@@ -31,7 +33,3 @@ def test_age_on_uranus(self):
def test_age_on_neptune(self):
self.assertEqual(SpaceAge(1821023456).on_neptune(), 0.35)
-
-
-if __name__ == "__main__":
- unittest.main()
diff --git a/exercises/practice/spiral-matrix/.meta/template.j2 b/exercises/practice/spiral-matrix/.meta/template.j2
index b501e6d4147..552b48831cf 100644
--- a/exercises/practice/spiral-matrix/.meta/template.j2
+++ b/exercises/practice/spiral-matrix/.meta/template.j2
@@ -1,5 +1,7 @@
{%- import "generator_macros.j2" as macros with context -%}
-{{ macros.header() }}
+{{ macros.canonical_ref() }}
+
+{{ macros.header()}}
class {{ exercise | camel_case }}Test(unittest.TestCase):
{% for case in cases -%}
@@ -7,5 +9,3 @@ class {{ exercise | camel_case }}Test(unittest.TestCase):
self.assertEqual({{ case["property"] | to_snake }}({{ case["input"]["size"] }}), {{ case["expected"] }})
{% endfor %}
-
-{{ macros.footer() }}
diff --git a/exercises/practice/spiral-matrix/spiral_matrix_test.py b/exercises/practice/spiral-matrix/spiral_matrix_test.py
index 1291342a892..49174455977 100644
--- a/exercises/practice/spiral-matrix/spiral_matrix_test.py
+++ b/exercises/practice/spiral-matrix/spiral_matrix_test.py
@@ -1,11 +1,13 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/spiral-matrix/canonical-data.json
+# File last updated on 2023-07-19
+
import unittest
from spiral_matrix import (
spiral_matrix,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class SpiralMatrixTest(unittest.TestCase):
def test_empty_spiral(self):
@@ -37,7 +39,3 @@ def test_spiral_of_size_5(self):
[13, 12, 11, 10, 9],
],
)
-
-
-if __name__ == "__main__":
- unittest.main()
diff --git a/exercises/practice/square-root/.meta/template.j2 b/exercises/practice/square-root/.meta/template.j2
index 9334317859f..9038eb171a0 100644
--- a/exercises/practice/square-root/.meta/template.j2
+++ b/exercises/practice/square-root/.meta/template.j2
@@ -1,4 +1,8 @@
{%- import "generator_macros.j2" as macros with context -%}
+{{ macros.canonical_ref() }}
+
+{{ macros.header()}}
+
{% macro test_case(case) -%}
{%- set input = case["input"] -%}
def test_{{ case["description"] | to_snake }}(self):
@@ -7,7 +11,6 @@
{{ case["expected"] }}
)
{%- endmacro %}
-{{ macros.header()}}
class {{ exercise | camel_case }}Test(unittest.TestCase):
{% for case in cases -%}
diff --git a/exercises/practice/square-root/square_root_test.py b/exercises/practice/square-root/square_root_test.py
index 635728fee45..8f94940f552 100644
--- a/exercises/practice/square-root/square_root_test.py
+++ b/exercises/practice/square-root/square_root_test.py
@@ -1,11 +1,13 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/square-root/canonical-data.json
+# File last updated on 2023-07-19
+
import unittest
from square_root import (
square_root,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class SquareRootTest(unittest.TestCase):
def test_root_of_1(self):
diff --git a/exercises/practice/strain/.docs/instructions.md b/exercises/practice/strain/.docs/instructions.md
index 370eb2216fd..3469ae6579d 100644
--- a/exercises/practice/strain/.docs/instructions.md
+++ b/exercises/practice/strain/.docs/instructions.md
@@ -1,9 +1,7 @@
# Instructions
-Implement the `keep` and `discard` operation on collections. Given a collection
-and a predicate on the collection's elements, `keep` returns a new collection
-containing those elements where the predicate is true, while `discard` returns
-a new collection containing those elements where the predicate is false.
+Implement the `keep` and `discard` operation on collections.
+Given a collection and a predicate on the collection's elements, `keep` returns a new collection containing those elements where the predicate is true, while `discard` returns a new collection containing those elements where the predicate is false.
For example, given the collection of numbers:
@@ -23,12 +21,9 @@ While your discard operation should produce:
Note that the union of keep and discard is all the elements.
-The functions may be called `keep` and `discard`, or they may need different
-names in order to not clash with existing functions or concepts in your
-language.
+The functions may be called `keep` and `discard`, or they may need different names in order to not clash with existing functions or concepts in your language.
## Restrictions
-Keep your hands off that filter/reject/whatchamacallit functionality
-provided by your standard library! Solve this one yourself using other
-basic tools instead.
+Keep your hands off that filter/reject/whatchamacallit functionality provided by your standard library!
+Solve this one yourself using other basic tools instead.
diff --git a/exercises/practice/strain/.meta/tests.toml b/exercises/practice/strain/.meta/tests.toml
new file mode 100644
index 00000000000..66ed1044bd6
--- /dev/null
+++ b/exercises/practice/strain/.meta/tests.toml
@@ -0,0 +1,66 @@
+# 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.
+
+[26af8c32-ba6a-4eb3-aa0a-ebd8f136e003]
+description = "keep on empty list returns empty list"
+include = false
+
+[f535cb4d-e99b-472a-bd52-9fa0ffccf454]
+description = "keeps everything"
+include = false
+
+[950b8e8e-f628-42a8-85e2-9b30f09cde38]
+description = "keeps nothing"
+include = false
+
+[92694259-6e76-470c-af87-156bdf75018a]
+description = "keeps first and last"
+include = false
+
+[938f7867-bfc7-449e-a21b-7b00cbb56994]
+description = "keeps neither first nor last"
+include = false
+
+[8908e351-4437-4d2b-a0f7-770811e48816]
+description = "keeps strings"
+include = false
+
+[2728036b-102a-4f1e-a3ef-eac6160d876a]
+description = "keeps lists"
+include = false
+
+[ef16beb9-8d84-451a-996a-14e80607fce6]
+description = "discard on empty list returns empty list"
+include = false
+
+[2f42f9bc-8e06-4afe-a222-051b5d8cd12a]
+description = "discards everything"
+include = false
+
+[ca990fdd-08c2-4f95-aa50-e0f5e1d6802b]
+description = "discards nothing"
+include = false
+
+[71595dae-d283-48ca-a52b-45fa96819d2f]
+description = "discards first and last"
+include = false
+
+[ae141f79-f86d-4567-b407-919eaca0f3dd]
+description = "discards neither first nor last"
+include = false
+
+[daf25b36-a59f-4f29-bcfe-302eb4e43609]
+description = "discards strings"
+include = false
+
+[a38d03f9-95ad-4459-80d1-48e937e4acaf]
+description = "discards lists"
+include = false
diff --git a/exercises/practice/sublist/.approaches/config.json b/exercises/practice/sublist/.approaches/config.json
new file mode 100644
index 00000000000..ce54db9c14e
--- /dev/null
+++ b/exercises/practice/sublist/.approaches/config.json
@@ -0,0 +1,21 @@
+{
+ "introduction": {
+ "authors": ["safwansamsudeen"]
+ },
+ "approaches": [
+ {
+ "uuid": "db47397a-4551-49e8-8775-7e7aad79a38b",
+ "slug": "list-manipulation",
+ "title": "List manipulation",
+ "blurb": "Manipulate and check lists to solve the exercise",
+ "authors": ["safwansamsudeen"]
+ },
+ {
+ "uuid": "61366160-c859-4d16-9085-171428209b8d",
+ "slug": "using-strings",
+ "title": "Using strings",
+ "blurb": "Convert the lists to string and use string manipulation to solve the exercise",
+ "authors": ["safwansamsudeen"]
+ }
+ ]
+}
diff --git a/exercises/practice/sublist/.approaches/introduction.md b/exercises/practice/sublist/.approaches/introduction.md
new file mode 100644
index 00000000000..42f991ef086
--- /dev/null
+++ b/exercises/practice/sublist/.approaches/introduction.md
@@ -0,0 +1,59 @@
+# Introduction
+There are two broad ways to solve Sublist.
+
+## General guidance
+To write the code, you need to branch out (probably with `if`) into the four different possible conditions, and return the appropriate name of the category.
+
+## Approach: list manipulation
+The direct approach would be to manipulate and check the given lists to solve this.
+This solution uses a helper function, which simplifies things, but the approach can be implemented without it.
+
+```python
+SUBLIST = 1
+SUPERLIST = 2
+EQUAL = 3
+UNEQUAL = 4
+
+def check_sub_sequences(list_one, list_two):
+ n1 = len(list_one)
+ n2 = len(list_two)
+ return any(list_two[i:i+n1] == list_one for i in range(n2 - n1 + 1))
+
+def sublist(list_one, list_two):
+ if list_one == list_two:
+ return EQUAL
+ if check_sub_sequences(list_one, list_two):
+ return SUBLIST
+ if check_sub_sequences(list_two, list_one):
+ return SUPERLIST
+ return UNEQUAL
+```
+
+Read more on the [detail of this approach][approach-list-manipulation].
+
+## Approach: using strings
+Another seemingly clever approach is to convert the lists to strings and then
+use the `in` operator to check for sub-sequences.
+**However, this does not work.**
+```python
+SUBLIST = 1
+SUPERLIST = 2
+EQUAL = 3
+UNEQUAL = 4
+
+def sublist(list_one, list_two):
+ list_one_check = (str(list_one).strip("[]") + ",")
+ list_two_check = (str(list_two).strip("[]") + ",")
+
+ if list_one_check == list_two_check:
+ return EQUAL
+ elif list_one_check in list_two_check:
+ return SUBLIST
+ elif list_two_check in list_one_check:
+ return SUPERLIST
+ return UNEQUAL
+```
+To understand more about this approach and **why it fails**, [read here][approach-using-strings].
+
+[approach-list-manipulation]: https://exercism.org/tracks/python/exercises/sublist/approaches/list-manipulation
+[approach-using-strings]: https://exercism.org/tracks/python/exercises/sublist/approaches/using-strings
diff --git a/exercises/practice/sublist/.approaches/list-manipulation/content.md b/exercises/practice/sublist/.approaches/list-manipulation/content.md
new file mode 100644
index 00000000000..ac374b730e7
--- /dev/null
+++ b/exercises/practice/sublist/.approaches/list-manipulation/content.md
@@ -0,0 +1,38 @@
+# List manipulation
+The direct approach would be to manipulate and check the given lists to solve this.
+This solution uses a helper function, which simplifies things, but the approach can be implemented without it.
+
+```python
+SUBLIST = 1
+SUPERLIST = 2
+EQUAL = 3
+UNEQUAL = 4
+
+def check_sub_sequences(list_one, list_two):
+ n1 = len(list_one)
+ n2 = len(list_two)
+ return any(list_two[i:i+n1] == list_one for i in range(n2 - n1 + 1))
+
+def sublist(list_one, list_two):
+ if list_one == list_two:
+ return EQUAL
+ if check_sub_sequences(list_one, list_two):
+ return SUBLIST
+ if check_sub_sequences(list_two, list_one):
+ return SUPERLIST
+ return UNEQUAL
+```
+
+We first check for equality using the `==` operator, if so, then we return `EQUAL`.
+A common way to do this differently would be to return `1` directly, but this is better practice as we [remove magic values][magic values].
+
+After that we call `check_sub_sequences` passing in `list_one` and `list_two`.
+In the helper function, we check if `any` of the possible sub-sequences in `list_two` of length `n1` (the length of the first list) are equal to the first list.
+If so, then we conclude that `list_one` is a `SUBLIST` of `list_two`.
+
+To find whether `list_one` is a `SUPERLIST` of `list_two`, we just reverse this process - pass in the lists in the opposite order.
+Thus, we check if `any` of the possible sub-sequences in `list_one` of length `n2` (the length of the second list) are equal to the second list.
+
+If none of the above conditions are true, we conclude that the two lists are unequal.
+
+[magic values]: https://stackoverflow.com/questions/47882/what-is-a-magic-number-and-why-is-it-bad
\ No newline at end of file
diff --git a/exercises/practice/sublist/.approaches/list-manipulation/snippet.txt b/exercises/practice/sublist/.approaches/list-manipulation/snippet.txt
new file mode 100644
index 00000000000..290f8cdd2b8
--- /dev/null
+++ b/exercises/practice/sublist/.approaches/list-manipulation/snippet.txt
@@ -0,0 +1,8 @@
+def sublist(list_one, list_two):
+ if list_one == list_two:
+ return EQUAL
+ if check_sub_sequences(list_one, list_two):
+ return SUBLIST
+ if check_sub_sequences(list_two, list_one):
+ return SUPERLIST
+ return UNEQUAL
\ No newline at end of file
diff --git a/exercises/practice/sublist/.approaches/using-strings/content.md b/exercises/practice/sublist/.approaches/using-strings/content.md
new file mode 100644
index 00000000000..ff960902dc9
--- /dev/null
+++ b/exercises/practice/sublist/.approaches/using-strings/content.md
@@ -0,0 +1,47 @@
+# Using strings
+~~~~exercism/caution
+**This approach does not work, and this document exists to explain that.**
+Please do not use it in your code.
+~~~~
+
+Another seemingly clever solution is to convert the lists to strings and then
+use the `in` operator to check for sub-sequences.
+Note that this approach, even if it worked, is not as performant as the
+previous one.
+```python
+SUBLIST = 1
+SUPERLIST = 2
+EQUAL = 3
+UNEQUAL = 4
+
+def sublist(list_one, list_two):
+ list_one_check = str(list_one).strip("[]")
+ list_two_check = str(list_two).strip("[]")
+
+ if list_one_check == list_two_check:
+ return EQUAL
+ elif list_one_check in list_two_check:
+ return SUBLIST
+ elif list_two_check in list_one_check:
+ return SUPERLIST
+ return UNEQUAL
+```
+Let's parse the code to see what it does.
+In this approach, we convert the lists to strings, so `[1, 2, 3]` becomes `"[1, 2, 3]"`, remove the brackets `"1, 2, 3"`, and add a comma `"1, 2, 3,"`.
+We check equality and then use the `in` operator to check for `SUBLIST` or `SUPERLIST`, and finally return `UNEQUAL`.
+
+We add a comma because, say, we call `sublist` with `[1, 2]` and `[1, 22]`. `"1, 2" in "1, 22"` evaluates to `True`, so
+the **function would wrongly mark it as `SUBLIST`**.
+
+This test can be overridden by changing the code like this:
+```python
+list_one_check = str(list_one).strip("[]") + ','
+list_two_check = str(list_two).strip("[]") + ','
+```
+Yet, the test case (which doesn't exist in the Exercism test suite) `["1", "2"]` and `["5", "'1', '2',", "7"]` would
+fail.
+
+Students can add any arbitrary string into the representation to try to "defeat" this test - `list_one_check = str
+(list_one) + TOKEN`. The test suite currently test `TOKEN = ''`, but not others.
+
+[gen-exp]: https://www.programiz.com/python-programming/generator
\ No newline at end of file
diff --git a/exercises/practice/sublist/.approaches/using-strings/snippet.txt b/exercises/practice/sublist/.approaches/using-strings/snippet.txt
new file mode 100644
index 00000000000..26fc3ec0ec7
--- /dev/null
+++ b/exercises/practice/sublist/.approaches/using-strings/snippet.txt
@@ -0,0 +1,8 @@
+# Failing approach
+def sublist(list_one, list_two):
+ list_one_check = str(list_one).strip("[]")
+ ...
+ elif list_one_check in list_two_check:
+ return SUBLIST
+ ...
+ return UNEQUAL
\ No newline at end of file
diff --git a/exercises/practice/sublist/.meta/template.j2 b/exercises/practice/sublist/.meta/template.j2
index 00c111f3fc7..ecd410bdaa1 100644
--- a/exercises/practice/sublist/.meta/template.j2
+++ b/exercises/practice/sublist/.meta/template.j2
@@ -1,10 +1,13 @@
{%- import "generator_macros.j2" as macros with context -%}
+{{ macros.canonical_ref() }}
+
+{{ macros.header(imports=["sublist", "SUBLIST", "SUPERLIST", "EQUAL", "UNEQUAL"]) }}
+
{% macro test_case(case) -%}
def test_{{ case["description"] | to_snake }}(self):
self.assertEqual({{ case["property"] }}({{ case["input"]["listOne"] }}, {{ case["input"]["listTwo"] }}),
{{ case["expected"] | upper }})
{%- endmacro %}
-{{ macros.header(imports=["sublist", "SUBLIST", "SUPERLIST", "EQUAL", "UNEQUAL"]) }}
class {{ exercise | camel_case }}Test(unittest.TestCase):
{% for case in cases -%}
diff --git a/exercises/practice/sublist/sublist.py b/exercises/practice/sublist/sublist.py
index 428d3aa656c..35410301d53 100644
--- a/exercises/practice/sublist/sublist.py
+++ b/exercises/practice/sublist/sublist.py
@@ -1,8 +1,7 @@
"""
This exercise stub and the test suite contain several enumerated constants.
-Since Python 2 does not have the enum module, the idiomatic way to write
-enumerated constants has traditionally been a NAME assigned to an arbitrary,
+Enumerated constants can be done with a NAME assigned to an arbitrary,
but unique value. An integer is traditionally used because it’s memory
efficient.
It is a common practice to export both constants and functions that work with
diff --git a/exercises/practice/sublist/sublist_test.py b/exercises/practice/sublist/sublist_test.py
index b3dc9c7bce1..af9a7799c10 100644
--- a/exercises/practice/sublist/sublist_test.py
+++ b/exercises/practice/sublist/sublist_test.py
@@ -1,3 +1,7 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/sublist/canonical-data.json
+# File last updated on 2023-07-19
+
import unittest
from sublist import (
@@ -8,8 +12,6 @@
UNEQUAL,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class SublistTest(unittest.TestCase):
def test_empty_lists(self):
diff --git a/exercises/practice/sum-of-multiples/.docs/instructions.md b/exercises/practice/sum-of-multiples/.docs/instructions.md
index ff7fdffd86a..d69f890e9d6 100644
--- a/exercises/practice/sum-of-multiples/.docs/instructions.md
+++ b/exercises/practice/sum-of-multiples/.docs/instructions.md
@@ -1,7 +1,27 @@
# Instructions
-Given a number, find the sum of all the unique multiples of particular numbers up to but not including that number.
+Your task is to write the code that calculates the energy points that get awarded to players when they complete a level.
-If we list all the natural numbers below 20 that are multiples of 3 or 5, we get 3, 5, 6, 9, 10, 12, 15, and 18.
+The points awarded depend on two things:
-The sum of these multiples is 78.
+- The level (a number) that the player completed.
+- The base value of each magical item collected by the player during that level.
+
+The energy points are awarded according to the following rules:
+
+1. For each magical item, take the base value and find all the multiples of that value that are less than the level number.
+2. Combine the sets of numbers.
+3. Remove any duplicates.
+4. Calculate the sum of all the numbers that are left.
+
+Let's look at an example:
+
+**The player completed level 20 and found two magical items with base values of 3 and 5.**
+
+To calculate the energy points earned by the player, we need to find all the unique multiples of these base values that are less than level 20.
+
+- Multiples of 3 less than 20: `{3, 6, 9, 12, 15, 18}`
+- Multiples of 5 less than 20: `{5, 10, 15}`
+- Combine the sets and remove duplicates: `{3, 5, 6, 9, 10, 12, 15, 18}`
+- Sum the unique multiples: `3 + 5 + 6 + 9 + 10 + 12 + 15 + 18 = 78`
+- Therefore, the player earns **78** energy points for completing level 20 and finding the two magical items with base values of 3 and 5.
diff --git a/exercises/practice/sum-of-multiples/.docs/introduction.md b/exercises/practice/sum-of-multiples/.docs/introduction.md
new file mode 100644
index 00000000000..69cabeed5ab
--- /dev/null
+++ b/exercises/practice/sum-of-multiples/.docs/introduction.md
@@ -0,0 +1,6 @@
+# Introduction
+
+You work for a company that makes an online, fantasy-survival game.
+
+When a player finishes a level, they are awarded energy points.
+The amount of energy awarded depends on which magical items the player found while exploring that level.
diff --git a/exercises/practice/sum-of-multiples/.meta/template.j2 b/exercises/practice/sum-of-multiples/.meta/template.j2
index 6ffa327ac1a..03574ec7e8a 100644
--- a/exercises/practice/sum-of-multiples/.meta/template.j2
+++ b/exercises/practice/sum-of-multiples/.meta/template.j2
@@ -1,4 +1,6 @@
{%- import "generator_macros.j2" as macros with context -%}
+{{ macros.canonical_ref() }}
+
{{ macros.header(["sum_of_multiples"]) }}
class {{ exercise | camel_case }}Test(unittest.TestCase):
@@ -7,5 +9,3 @@ class {{ exercise | camel_case }}Test(unittest.TestCase):
self.assertEqual({{ case["property"].replace("sum", "sum_of_multiples") }}({{ case["input"]["limit"] }}, {{ case["input"]["factors"] }}), {{ case["expected"] }})
{% endfor %}
-
-{{ macros.footer() }}
diff --git a/exercises/practice/sum-of-multiples/sum_of_multiples_test.py b/exercises/practice/sum-of-multiples/sum_of_multiples_test.py
index f7e8bfb5409..0057ee7a7f5 100644
--- a/exercises/practice/sum-of-multiples/sum_of_multiples_test.py
+++ b/exercises/practice/sum-of-multiples/sum_of_multiples_test.py
@@ -1,11 +1,13 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/sum-of-multiples/canonical-data.json
+# File last updated on 2023-07-19
+
import unittest
from sum_of_multiples import (
sum_of_multiples,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class SumOfMultiplesTest(unittest.TestCase):
def test_no_multiples_within_limit(self):
@@ -57,7 +59,3 @@ def test_solutions_using_include_exclude_must_extend_to_cardinality_greater_than
self,
):
self.assertEqual(sum_of_multiples(10000, [2, 3, 5, 7, 11]), 39614537)
-
-
-if __name__ == "__main__":
- unittest.main()
diff --git a/exercises/practice/tournament/.meta/template.j2 b/exercises/practice/tournament/.meta/template.j2
index 30ca2e94cd0..055b3a89d72 100644
--- a/exercises/practice/tournament/.meta/template.j2
+++ b/exercises/practice/tournament/.meta/template.j2
@@ -1,5 +1,7 @@
{%- import "generator_macros.j2" as macros with context -%}
-{{ macros.header() }}
+{{ macros.canonical_ref() }}
+
+{{ macros.header()}}
class {{ exercise | camel_case }}Test(unittest.TestCase):
{% for case in cases %}
diff --git a/exercises/practice/tournament/tournament_test.py b/exercises/practice/tournament/tournament_test.py
index 22a81667899..622983525dd 100644
--- a/exercises/practice/tournament/tournament_test.py
+++ b/exercises/practice/tournament/tournament_test.py
@@ -1,11 +1,13 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/tournament/canonical-data.json
+# File last updated on 2023-07-19
+
import unittest
from tournament import (
tally,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class TournamentTest(unittest.TestCase):
def test_just_the_header_if_no_input(self):
diff --git a/exercises/practice/transpose/.meta/template.j2 b/exercises/practice/transpose/.meta/template.j2
index ef724132e8c..e622947b106 100644
--- a/exercises/practice/transpose/.meta/template.j2
+++ b/exercises/practice/transpose/.meta/template.j2
@@ -1,5 +1,7 @@
{%- import "generator_macros.j2" as macros with context -%}
-{{ macros.header() }}
+{{ macros.canonical_ref() }}
+
+{{ macros.header()}}
class {{ exercise | camel_case }}Test(unittest.TestCase):
{% for case in cases -%}
diff --git a/exercises/practice/transpose/transpose_test.py b/exercises/practice/transpose/transpose_test.py
index 0a0f5c024fb..d3ab85ff9ff 100644
--- a/exercises/practice/transpose/transpose_test.py
+++ b/exercises/practice/transpose/transpose_test.py
@@ -1,11 +1,13 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/transpose/canonical-data.json
+# File last updated on 2023-07-19
+
import unittest
from transpose import (
transpose,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class TransposeTest(unittest.TestCase):
def test_empty_string(self):
diff --git a/exercises/practice/triangle/.meta/template.j2 b/exercises/practice/triangle/.meta/template.j2
index 8875bc51078..b196cfc717f 100644
--- a/exercises/practice/triangle/.meta/template.j2
+++ b/exercises/practice/triangle/.meta/template.j2
@@ -1,4 +1,6 @@
{%- import "generator_macros.j2" as macros with context -%}
+{{ macros.canonical_ref() }}
+
{{ macros.header(["equilateral", "isosceles", "scalene"]) }}
{% for case in cases -%}
@@ -9,4 +11,3 @@ class {{ case["description"] | camel_case }}Test(unittest.TestCase):
{% endfor %}
{% endfor %}
-{{ macros.footer() }}
diff --git a/exercises/practice/triangle/triangle_test.py b/exercises/practice/triangle/triangle_test.py
index 2de48d3372e..b279c83c325 100644
--- a/exercises/practice/triangle/triangle_test.py
+++ b/exercises/practice/triangle/triangle_test.py
@@ -1,3 +1,7 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/triangle/canonical-data.json
+# File last updated on 2023-07-19
+
import unittest
from triangle import (
@@ -6,8 +10,6 @@
scalene,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class EquilateralTriangleTest(unittest.TestCase):
def test_all_sides_are_equal(self):
@@ -76,7 +78,3 @@ def test_may_not_violate_triangle_inequality(self):
def test_sides_may_be_floats(self):
self.assertIs(scalene([0.5, 0.4, 0.6]), True)
-
-
-if __name__ == "__main__":
- unittest.main()
diff --git a/exercises/practice/trinary/.docs/instructions.md b/exercises/practice/trinary/.docs/instructions.md
index 3638ddb74b1..d38e3b5bbf4 100644
--- a/exercises/practice/trinary/.docs/instructions.md
+++ b/exercises/practice/trinary/.docs/instructions.md
@@ -1,15 +1,13 @@
# Instructions
-Convert a trinary number, represented as a string (e.g. '102012'), to its
-decimal equivalent using first principles.
+Convert a trinary number, represented as a string (e.g. '102012'), to its decimal equivalent using first principles.
-The program should consider strings specifying an invalid trinary as the
-value 0.
+The program should consider strings specifying an invalid trinary as the value 0.
Trinary numbers contain three symbols: 0, 1, and 2.
-The last place in a trinary number is the 1's place. The second to last
-is the 3's place, the third to last is the 9's place, etc.
+The last place in a trinary number is the 1's place.
+The second to last is the 3's place, the third to last is the 9's place, etc.
```shell
# "102012"
@@ -18,5 +16,4 @@ is the 3's place, the third to last is the 9's place, etc.
243 + 0 + 54 + 0 + 3 + 2 = 302
```
-If your language provides a method in the standard library to perform the
-conversion, pretend it doesn't exist and implement it yourself.
+If your language provides a method in the standard library to perform the conversion, pretend it doesn't exist and implement it yourself.
diff --git a/exercises/practice/trinary/.meta/config.json b/exercises/practice/trinary/.meta/config.json
index 104b505a620..da59ec6c571 100644
--- a/exercises/practice/trinary/.meta/config.json
+++ b/exercises/practice/trinary/.meta/config.json
@@ -26,5 +26,5 @@
]
},
"source": "All of Computer Science",
- "source_url": "http://www.wolframalpha.com/input/?i=binary&a=*C.binary-_*MathWorld-"
+ "source_url": "https://www.wolframalpha.com/examples/mathematics/numbers/base-conversions"
}
diff --git a/exercises/practice/twelve-days/.meta/template.j2 b/exercises/practice/twelve-days/.meta/template.j2
index e90fe713074..2baa27d2c42 100644
--- a/exercises/practice/twelve-days/.meta/template.j2
+++ b/exercises/practice/twelve-days/.meta/template.j2
@@ -1,5 +1,8 @@
{%- import "generator_macros.j2" as macros with context -%}
-{{ macros.header() }}
+{{ macros.canonical_ref() }}
+
+{{ macros.header()}}
+
{{ "# PLEASE TAKE NOTE: Expected result lists for these test cases use **implicit line joining.**" }}
{{ "# A new line in a result list below **does not** always equal a new list element." }}
{{ "# Check comma placement carefully!" }}
diff --git a/exercises/practice/twelve-days/twelve_days_test.py b/exercises/practice/twelve-days/twelve_days_test.py
index ec097cddb9c..b18c35e7302 100644
--- a/exercises/practice/twelve-days/twelve_days_test.py
+++ b/exercises/practice/twelve-days/twelve_days_test.py
@@ -1,10 +1,13 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/twelve-days/canonical-data.json
+# File last updated on 2023-07-19
+
import unittest
from twelve_days import (
recite,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
# PLEASE TAKE NOTE: Expected result lists for these test cases use **implicit line joining.**
# A new line in a result list below **does not** always equal a new list element.
# Check comma placement carefully!
diff --git a/exercises/practice/two-bucket/.meta/template.j2 b/exercises/practice/two-bucket/.meta/template.j2
index 02843791272..2cd31976eaa 100644
--- a/exercises/practice/two-bucket/.meta/template.j2
+++ b/exercises/practice/two-bucket/.meta/template.j2
@@ -1,11 +1,14 @@
{%- import "generator_macros.j2" as macros with context -%}
+{{ macros.canonical_ref() }}
+
+{{ macros.header()}}
+
{%- macro test_call(case) -%}
{{ case["property"] }}({{ case["input"]["bucketOne"] }},
{{ case["input"]["bucketTwo"] }},
{{ case["input"]["goal"] }},
"{{ case["input"]["startBucket"] }}")
-{%- endmacro -%}
-{{ macros.header() }}
+{%- endmacro %}
class {{ exercise | camel_case }}Test(unittest.TestCase):
{% for case in cases -%}
@@ -24,4 +27,4 @@ class {{ exercise | camel_case }}Test(unittest.TestCase):
{% endfor %}
-{{ macros.footer() }}
+{{ macros.utility() }}
\ No newline at end of file
diff --git a/exercises/practice/two-bucket/two_bucket_test.py b/exercises/practice/two-bucket/two_bucket_test.py
index 7fe7fac1a7c..b7d1cc01953 100644
--- a/exercises/practice/two-bucket/two_bucket_test.py
+++ b/exercises/practice/two-bucket/two_bucket_test.py
@@ -1,11 +1,13 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/two-bucket/canonical-data.json
+# File last updated on 2023-07-21
+
import unittest
from two_bucket import (
measure,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class TwoBucketTest(unittest.TestCase):
def test_measure_using_bucket_one_of_size_3_and_bucket_two_of_size_5_start_with_bucket_one(
@@ -52,7 +54,3 @@ def test_goal_larger_than_both_buckets_is_impossible(self):
# Utility functions
def assertRaisesWithMessage(self, exception):
return self.assertRaisesRegex(exception, r".+")
-
-
-if __name__ == "__main__":
- unittest.main()
diff --git a/exercises/practice/two-fer/.docs/instructions.md b/exercises/practice/two-fer/.docs/instructions.md
index a9bb4a3cd3c..37aa75297ea 100644
--- a/exercises/practice/two-fer/.docs/instructions.md
+++ b/exercises/practice/two-fer/.docs/instructions.md
@@ -17,9 +17,9 @@ One for you, one for me.
Here are some examples:
-|Name |Dialogue
-|:-------|:------------------
-|Alice |One for Alice, one for me.
-|Bohdan |One for Bohdan, one for me.
-| |One for you, one for me.
-|Zaphod |One for Zaphod, one for me.
+| Name | Dialogue |
+| :----- | :-------------------------- |
+| Alice | One for Alice, one for me. |
+| Bohdan | One for Bohdan, one for me. |
+| | One for you, one for me. |
+| Zaphod | One for Zaphod, one for me. |
diff --git a/exercises/practice/two-fer/.meta/template.j2 b/exercises/practice/two-fer/.meta/template.j2
index 51634eb1055..794d09ad19c 100644
--- a/exercises/practice/two-fer/.meta/template.j2
+++ b/exercises/practice/two-fer/.meta/template.j2
@@ -1,5 +1,7 @@
{%- import "generator_macros.j2" as macros with context -%}
-{{ macros.header() }}
+{{ macros.canonical_ref() }}
+
+{{ macros.header()}}
class {{ exercise | camel_case }}Test(unittest.TestCase):
{% for case in cases -%}
@@ -10,5 +12,3 @@ class {{ exercise | camel_case }}Test(unittest.TestCase):
self.assertEqual({{ case["property"] | to_snake }}("{{ case["input"]["name"] }}"), "{{ case["expected"] }}")
{% endif %}
{% endfor %}
-
-{{ macros.footer() }}
diff --git a/exercises/practice/two-fer/two_fer_test.py b/exercises/practice/two-fer/two_fer_test.py
index 540930daf3c..fa032f08e3f 100644
--- a/exercises/practice/two-fer/two_fer_test.py
+++ b/exercises/practice/two-fer/two_fer_test.py
@@ -1,11 +1,13 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/two-fer/canonical-data.json
+# File last updated on 2023-07-19
+
import unittest
from two_fer import (
two_fer,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class TwoFerTest(unittest.TestCase):
def test_no_name_given(self):
@@ -16,7 +18,3 @@ def test_a_name_given(self):
def test_another_name_given(self):
self.assertEqual(two_fer("Bob"), "One for Bob, one for me.")
-
-
-if __name__ == "__main__":
- unittest.main()
diff --git a/exercises/practice/variable-length-quantity/.meta/template.j2 b/exercises/practice/variable-length-quantity/.meta/template.j2
index 10b43cbdcc2..c95696ad483 100644
--- a/exercises/practice/variable-length-quantity/.meta/template.j2
+++ b/exercises/practice/variable-length-quantity/.meta/template.j2
@@ -1,4 +1,7 @@
{%- import "generator_macros.j2" as macros with context -%}
+{{ macros.canonical_ref() }}
+
+{{ macros.header()}}
{%- macro list_int_to_hex(integers) %}
[
@@ -6,9 +9,8 @@
{{ "0x{:x}".format(integer) }}{{- "," if not loop.last }}
{% endfor %}
]
-{% endmacro -%}
+{% endmacro %}
-{{ macros.header() }}
class {{ exercise | camel_case }}Test(unittest.TestCase):
{% for case in cases -%}
diff --git a/exercises/practice/variable-length-quantity/variable_length_quantity_test.py b/exercises/practice/variable-length-quantity/variable_length_quantity_test.py
index c6867dac90a..baeb2365430 100644
--- a/exercises/practice/variable-length-quantity/variable_length_quantity_test.py
+++ b/exercises/practice/variable-length-quantity/variable_length_quantity_test.py
@@ -1,3 +1,7 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/variable-length-quantity/canonical-data.json
+# File last updated on 2023-07-19
+
import unittest
from variable_length_quantity import (
@@ -5,8 +9,6 @@
encode,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class VariableLengthQuantityTest(unittest.TestCase):
def test_zero(self):
diff --git a/exercises/practice/word-count/.docs/instructions.md b/exercises/practice/word-count/.docs/instructions.md
index 8b7f03ede7a..064393c8a0f 100644
--- a/exercises/practice/word-count/.docs/instructions.md
+++ b/exercises/practice/word-count/.docs/instructions.md
@@ -1,31 +1,47 @@
# Instructions
-Given a phrase, count the occurrences of each _word_ in that phrase.
+Your task is to count how many times each word occurs in a subtitle of a drama.
-For the purposes of this exercise you can expect that a _word_ will always be one of:
+The subtitles from these dramas use only ASCII characters.
-1. A _number_ composed of one or more ASCII digits (ie "0" or "1234") OR
-2. A _simple word_ composed of one or more ASCII letters (ie "a" or "they") OR
-3. A _contraction_ of two _simple words_ joined by a single apostrophe (ie "it's" or "they're")
+The characters often speak in casual English, using contractions like _they're_ or _it's_.
+Though these contractions come from two words (e.g. _we are_), the contraction (_we're_) is considered a single word.
-When counting words you can assume the following rules:
+Words can be separated by any form of punctuation (e.g. ":", "!", or "?") or whitespace (e.g. "\t", "\n", or " ").
+The only punctuation that does not separate words is the apostrophe in contractions.
-1. The count is _case insensitive_ (ie "You", "you", and "YOU" are 3 uses of the same word)
-2. The count is _unordered_; the tests will ignore how words and counts are ordered
-3. Other than the apostrophe in a _contraction_ all forms of _punctuation_ are regarded as spaces
-4. The words can be separated by _any_ form of whitespace (ie "\t", "\n", " ")
+Numbers are considered words.
+If the subtitles say _It costs 100 dollars._ then _100_ will be its own word.
-For example, for the phrase `"That's the password: 'PASSWORD 123'!", cried the Special Agent.\nSo I fled.` the count would be:
+Words are case insensitive.
+For example, the word _you_ occurs three times in the following sentence:
+
+> You come back, you hear me? DO YOU HEAR ME?
+
+The ordering of the word counts in the results doesn't matter.
+
+Here's an example that incorporates several of the elements discussed above:
+
+- simple words
+- contractions
+- numbers
+- case insensitive words
+- punctuation (including apostrophes) to separate words
+- different forms of whitespace to separate words
+
+`"That's the password: 'PASSWORD 123'!", cried the Special Agent.\nSo I fled.`
+
+The mapping for this subtitle would be:
```text
-that's: 1
-the: 2
-password: 2
123: 1
-cried: 1
-special: 1
agent: 1
-so: 1
-i: 1
+cried: 1
fled: 1
+i: 1
+password: 2
+so: 1
+special: 1
+that's: 1
+the: 2
```
diff --git a/exercises/practice/word-count/.docs/introduction.md b/exercises/practice/word-count/.docs/introduction.md
new file mode 100644
index 00000000000..1654508e79d
--- /dev/null
+++ b/exercises/practice/word-count/.docs/introduction.md
@@ -0,0 +1,8 @@
+# Introduction
+
+You teach English as a foreign language to high school students.
+
+You've decided to base your entire curriculum on TV shows.
+You need to analyze which words are used, and how often they're repeated.
+
+This will let you choose the simplest shows to start with, and to gradually increase the difficulty as time passes.
diff --git a/exercises/practice/word-count/.meta/template.j2 b/exercises/practice/word-count/.meta/template.j2
index 2c91fdf963d..7f3a6223912 100644
--- a/exercises/practice/word-count/.meta/template.j2
+++ b/exercises/practice/word-count/.meta/template.j2
@@ -1,4 +1,8 @@
{%- import "generator_macros.j2" as macros with context -%}
+{{ macros.canonical_ref() }}
+
+{{ macros.header()}}
+
{% macro test_case(case) -%}
{%- set input = case["input"] -%}
def test_{{ case["description"] | to_snake }}(self):
@@ -7,7 +11,6 @@
{{ case["expected"] }}
)
{%- endmacro %}
-{{ macros.header()}}
class {{ exercise | camel_case }}Test(unittest.TestCase):
{% for case in cases -%}
@@ -21,6 +24,3 @@ class {{ exercise | camel_case }}Test(unittest.TestCase):
{{ test_case(case) }}
{% endfor %}
{%- endif %}
-
-
-{{ macros.footer() }}
diff --git a/exercises/practice/word-count/word_count_test.py b/exercises/practice/word-count/word_count_test.py
index b63a9eb357a..1bf0bdf6dc7 100644
--- a/exercises/practice/word-count/word_count_test.py
+++ b/exercises/practice/word-count/word_count_test.py
@@ -1,11 +1,13 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/word-count/canonical-data.json
+# File last updated on 2023-07-19
+
import unittest
from word_count import (
count_words,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class WordCountTest(unittest.TestCase):
def test_count_one_word(self):
@@ -121,7 +123,3 @@ def test_non_alphanumeric(self):
def test_multiple_apostrophes_ignored(self):
self.assertEqual(count_words("''hey''"), {"hey": 1})
-
-
-if __name__ == "__main__":
- unittest.main()
diff --git a/exercises/practice/word-search/.meta/template.j2 b/exercises/practice/word-search/.meta/template.j2
index 309a2fc1a22..14051f12b3b 100644
--- a/exercises/practice/word-search/.meta/template.j2
+++ b/exercises/practice/word-search/.meta/template.j2
@@ -1,4 +1,6 @@
{%- import "generator_macros.j2" as macros with context -%}
+{{ macros.canonical_ref() }}
+
{{ macros.header(imports=["WordSearch", "Point"]) }}
class {{ exercise | camel_case }}Test(unittest.TestCase):
@@ -20,6 +22,3 @@ class {{ exercise | camel_case }}Test(unittest.TestCase):
{%- endfor %}
{% endfor %}
-
-{{ macros.footer() }}
-
diff --git a/exercises/practice/word-search/word_search_test.py b/exercises/practice/word-search/word_search_test.py
index 6ee050418d8..d0cbd191d99 100644
--- a/exercises/practice/word-search/word_search_test.py
+++ b/exercises/practice/word-search/word_search_test.py
@@ -1,3 +1,7 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/word-search/canonical-data.json
+# File last updated on 2023-07-19
+
import unittest
from word_search import (
@@ -5,8 +9,6 @@
Point,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class WordSearchTest(unittest.TestCase):
def test_should_accept_an_initial_game_grid_and_a_target_search_word(self):
@@ -310,7 +312,3 @@ def test_should_not_wrap_around_horizontally_to_find_a_word(self):
def test_should_not_wrap_around_vertically_to_find_a_word(self):
puzzle = WordSearch(["s", "u", "r", "a", "b", "c", "t"])
self.assertIsNone(puzzle.search("rust"))
-
-
-if __name__ == "__main__":
- unittest.main()
diff --git a/exercises/practice/wordy/.meta/template.j2 b/exercises/practice/wordy/.meta/template.j2
index 00b70a8bb16..74ab335ff92 100644
--- a/exercises/practice/wordy/.meta/template.j2
+++ b/exercises/practice/wordy/.meta/template.j2
@@ -1,4 +1,8 @@
{%- import "generator_macros.j2" as macros with context -%}
+{{ macros.canonical_ref() }}
+
+{{ macros.header()}}
+
{% macro test_case(case) -%}
def test_{{ case["description"] | to_snake }}(self):
{%- set question = case["input"]["question"] %}
@@ -11,7 +15,6 @@
self.assertEqual({{ case["property"] }}("{{ question }}"), {{ case["expected"] }})
{%- endif %}
{%- endmacro %}
-{{ macros.header() }}
class {{ exercise | camel_case }}Test(unittest.TestCase):
{% for case in cases -%}
diff --git a/exercises/practice/wordy/wordy_test.py b/exercises/practice/wordy/wordy_test.py
index 3f85ed41f16..ffcaf49aed4 100644
--- a/exercises/practice/wordy/wordy_test.py
+++ b/exercises/practice/wordy/wordy_test.py
@@ -1,11 +1,13 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/wordy/canonical-data.json
+# File last updated on 2023-07-19
+
import unittest
from wordy import (
answer,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class WordyTest(unittest.TestCase):
def test_just_a_number(self):
diff --git a/exercises/practice/yacht/.approaches/config.json b/exercises/practice/yacht/.approaches/config.json
new file mode 100644
index 00000000000..86d37075b8b
--- /dev/null
+++ b/exercises/practice/yacht/.approaches/config.json
@@ -0,0 +1,28 @@
+{
+ "introduction": {
+ "authors": ["safwansamsudeen"]
+ },
+ "approaches": [
+ {
+ "uuid": "3593cfe3-5cab-4141-b0a2-329148a66bb6",
+ "slug": "functions",
+ "title": "Lambdas with Functions",
+ "blurb": "Use lambdas with functions",
+ "authors": ["safwansamsudeen"]
+ },
+ {
+ "uuid": "eccd1e1e-6c88-4823-9b25-944eccaa92e7",
+ "slug": "if-structure",
+ "title": "If structure",
+ "blurb": "Use an if structure",
+ "authors": ["safwansamsudeen"]
+ },
+ {
+ "uuid": "72079791-e51f-4825-ad94-3b7516c631cc",
+ "slug": "structural-pattern-matching",
+ "title": "Structural Pattern Matching",
+ "blurb": "Use structural pattern matching",
+ "authors": ["safwansamsudeen"]
+ }
+ ]
+}
diff --git a/exercises/practice/yacht/.approaches/functions/content.md b/exercises/practice/yacht/.approaches/functions/content.md
new file mode 100644
index 00000000000..2c6bfe527df
--- /dev/null
+++ b/exercises/practice/yacht/.approaches/functions/content.md
@@ -0,0 +1,72 @@
+## Approach: Using Lambdas with Functions
+Each bit of functionality for each category can be encoded in an anonymous function (otherwise known as a [`lambda` expression][lambda] or lambda form), and the constant name set to that function.
+
+In `score`, we call the category (as it now points to a function) passing in `dice` as an argument.
+
+```python
+def digits(num):
+ return lambda dice: dice.count(num) * num
+
+YACHT = lambda dice: 50 if len(set(dice)) == 1 else 0
+ONES = digits(1)
+TWOS = digits(2)
+THREES = digits(3)
+FOURS = digits(4)
+FIVES = digits(5)
+SIXES = digits(6)
+FULL_HOUSE = lambda dice: sum(dice) if len(set(dice)) == 2 and dice.count(dice[0]) in [2, 3] else 0
+FOUR_OF_A_KIND = lambda dice: 4 * dice[1] if dice[0] == dice[3] or dice[1] == dice[4] else 0
+LITTLE_STRAIGHT = lambda dice: 30 if sorted(dice) == [1, 2, 3, 4, 5] else 0
+BIG_STRAIGHT = lambda dice: 30 if sorted(dice) == [2, 3, 4, 5, 6] else 0
+CHOICE = sum
+
+def score(dice, category):
+ return category(dice)
+```
+
+
+Instead of setting each constant in `ONES` through `SIXES` to a separate function, we create a function `digits` that returns a function, using [closures][closures] transparently.
+
+For `LITTLE_STRAIGHT` and `BIG_STRAIGHT`, we first sort the dice and then check it against the hard-coded value.
+Another way to solve this would be to check if `sum(dice) == 20 and len(set(dice)) == 5` (15 in `LITTLE_STRAIGHT`).
+In `CHOICE`, `lambda number : sum(number)` is shortened to just `sum`.
+
+In `FULL_HOUSE`, we create a `set` to remove the duplicates and check the set's length along with the individual counts.
+For `FOUR_OF_A_KIND`, we check if the first and the fourth element are the same or the second and the last element are the same - if so, there are (at least) four of the same number in the array.
+
+This solution is a succinct way to solve the exercise, although some of the one-liners can get a little long and hard to read.
+Additionally, [PEP8][pep8] does not recommend assigning constant or variable names to `lambda` expressions, so it is a better practice to use `def`:
+```python
+def digits(num):
+ return lambda dice: dice.count(num) * num
+
+def YACHT(dice): return 50 if len(set(dice)) == 1 else 0
+ONES = digits(1)
+TWOS = digits(2)
+THREES = digits(3)
+FOURS = digits(4)
+FIVES = digits(5)
+SIXES = digits(6)
+def FULL_HOUSE(dice): return sum(dice) if len(set(dice)) == 2 and dice.count(dice[0]) in [2, 3] else 0
+def FOUR_OF_A_KIND(dice): return 4 * sorted(dice)[1] if len(set(dice)) < 3 and dice.count(dice[0]) in (1, 4, 5) else 0
+def LITTLE_STRAIGHT(dice): return 30 if sorted(dice) == [1, 2, 3, 4, 5] else 0
+def BIG_STRAIGHT(dice): return 30 if sorted(dice) == [2, 3, 4, 5, 6] else 0
+CHOICE = sum
+
+def score(dice, category):
+ return category(dice)
+```
+
+As you can see from the examples, the [ternary operator][ternary-operator] (_or ternary form_) is crucial in solving the exercise using one liners.
+As functions are being used, it might be a better strategy to spread the code over multiple lines to improve readability.
+```python
+def YACHT(dice):
+ if dice.count(dice[0]) == len(dice):
+ return 50
+ return 0
+```
+
+[closures]: https://www.programiz.com/python-programming/closure
+[ternary-operator]: https://www.tutorialspoint.com/ternary-operator-in-python
+[lambda]: https://docs.python.org/3/howto/functional.html?highlight=lambda#small-functions-and-the-lambda-expression
+[pep8]: https://peps.python.org/pep-0008/
\ No newline at end of file
diff --git a/exercises/practice/yacht/.approaches/functions/snippet.txt b/exercises/practice/yacht/.approaches/functions/snippet.txt
new file mode 100644
index 00000000000..34d270ad895
--- /dev/null
+++ b/exercises/practice/yacht/.approaches/functions/snippet.txt
@@ -0,0 +1,8 @@
+def digits(num):
+ return lambda dice: dice.count(num) * num
+YACHT = lambda x: 50 if x.count(x[0]) == len(x) else 0
+ONES = digits(1)
+FULL_HOUSE = lambda x: sum(x) if len(set(x)) == 2 and x.count(x[0]) in [2, 3] else 0
+LITTLE_STRAIGHT = lambda x: 30 if sorted(x) == [1, 2, 3, 4, 5] else 0
+def score(dice, category):
+ return category(dice)
\ No newline at end of file
diff --git a/exercises/practice/yacht/.approaches/if-structure/content.md b/exercises/practice/yacht/.approaches/if-structure/content.md
new file mode 100644
index 00000000000..581f31d1928
--- /dev/null
+++ b/exercises/practice/yacht/.approaches/if-structure/content.md
@@ -0,0 +1,50 @@
+# If structure
+
+The constants here can be set to random, null, or numeric values, and an `if` structure inside the `score` function can determine the code to be executed.
+
+As one-liners aren't necessary here, we can spread out the code to make it look neater:
+```python
+ONES = 1
+TWOS = 2
+THREES = 3
+FOURS = 4
+FIVES = 5
+SIXES = 6
+FULL_HOUSE = 'FULL_HOUSE'
+FOUR_OF_A_KIND = 'FOUR_OF_A_KIND'
+LITTLE_STRAIGHT = 'LITTLE_STRAIGHT'
+BIG_STRAIGHT = 'BIG_STRAIGHT'
+CHOICE = 'CHOICE'
+YACHT = 'YACHT'
+
+def score(dice, category):
+ if category in (1,2,3,4,5,6):
+ return dice.count(category) * category
+ elif category == 'FULL_HOUSE':
+ if len(set(dice)) == 2 and dice.count(dice[0]) in [2, 3]:
+ return sum(dice) or 0
+ elif category == 'FOUR_OF_A_KIND':
+ if dice[0] == dice[3] or dice[1] == dice[4]:
+ return dice[1] * 4 or 0
+ elif category == 'LITTLE_STRAIGHT':
+ if sorted(dice) == [1, 2, 3, 4, 5]:
+ return 30 or 0
+ elif category == 'BIG_STRAIGHT':
+ if sorted(dice) == [2, 3, 4, 5, 6]:
+ return 30 or 0
+ elif category == 'YACHT':
+ if all(num == dice[0] for num in dice):
+ return 50
+ elif category == 'CHOICE':
+ return sum(dice)
+ return 0
+```
+Note that the code inside the `if` statements themselves can differ, but the key idea here is to use `if` and `elif` to branch out the code, and return `0` at the end if nothing else has been returned.
+The `if` condition itself can be different, with people commonly checking if `category == ONES` as opposed to `category == 'ONES'` (or whatever the dummy value is).
+
+This may not be an ideal way to solve the exercise, as the code is rather long and convoluted.
+However, it is a valid (_and fast_) solution.
+Using [structural pattern matching][structural pattern matching], introduced in Python 3.10, could shorten and clarify the code in this situation.
+Pulling some logic out of the `score` function and into additional "helper" functions could also help.
+
+[structural pattern matching]: https://peps.python.org/pep-0636/
\ No newline at end of file
diff --git a/exercises/practice/yacht/.approaches/if-structure/snippet.txt b/exercises/practice/yacht/.approaches/if-structure/snippet.txt
new file mode 100644
index 00000000000..fb590cc155b
--- /dev/null
+++ b/exercises/practice/yacht/.approaches/if-structure/snippet.txt
@@ -0,0 +1,8 @@
+ONES = 1
+YACHT = 'YACHT'
+def score(dice, category):
+ if category == 'ONES':
+ ...
+ elif category == 'FULL_HOUSE':
+ ...
+ return 0
\ No newline at end of file
diff --git a/exercises/practice/yacht/.approaches/introduction.md b/exercises/practice/yacht/.approaches/introduction.md
new file mode 100644
index 00000000000..5a37d16881b
--- /dev/null
+++ b/exercises/practice/yacht/.approaches/introduction.md
@@ -0,0 +1,76 @@
+# Introduction
+Yacht in Python can be solved in many ways. The most intuitive approach is to use an `if` structure.
+Alternatively, you can create functions and set their names to the constant names.
+
+## General guidance
+The main thing in this exercise is to map a category (_here defined as constants in the stub file_) to a function or a standalone piece of code.
+While mapping generally reminds us of dictionaries, here the constants are global.
+This indicates that the most idiomatic approach is not using a `dict`.
+Adhering to the principles of DRY is important - don't repeat yourself if you can help it, especially in the `ONES` through `SIXES` categories!
+
+## Approach: functions
+Each bit of functionality for each category can be encoded in a function, and the constant name set to that function.
+This can be done by assigning the constant name to a `lambda` or creating a one-line function using the constant as a function name.
+```python
+def digits(num):
+ return lambda dice: dice.count(num) * num
+YACHT = lambda dice: 50 if dice.count(dice[0]) == len(dice) else 0
+ONES = digits(1)
+TWOS = digits(2)
+THREES = digits(3)
+FOURS = digits(4)
+FIVES = digits(5)
+SIXES = digits(6)
+FULL_HOUSE = lambda dice: sum(dice) if len(set(dice)) == 2 and dice.count(dice[0]) in [2, 3] else 0
+FOUR_OF_A_KIND = lambda dice: 4 * dice[1] if dice[0] == dice[3] or dice[1] == dice[4] else 0
+LITTLE_STRAIGHT = lambda dice: 30 if sorted(dice) == [1, 2, 3, 4, 5] else 0
+BIG_STRAIGHT = lambda dice: 30 if sorted(dice) == [2, 3, 4, 5, 6] else 0
+CHOICE = sum
+def score(dice, category):
+ return category(dice)
+```
+This is a very succinct way to solve the exercise, although some one-liners get a little long.
+For more information on this approach, read [this document][approach-functions].
+
+## Approach: if structure
+The constants can be set to random, null, or numeric values, and an `if` structure inside `score` determines the code to be executed.
+As one-liners aren't necessary here, we can spread out the code to make it look neater:
+```python
+ONES = 1
+TWOS = 2
+THREES = 3
+FOURS = 4
+FIVES = 5
+SIXES = 6
+FULL_HOUSE = 'FULL_HOUSE'
+FOUR_OF_A_KIND = 'FOUR_OF_A_KIND'
+LITTLE_STRAIGHT = 'LITTLE_STRAIGHT'
+BIG_STRAIGHT = 'BIG_STRAIGHT'
+CHOICE = 'CHOICE'
+YACHT = 'YACHT'
+def score(dice, category):
+ if category in (1,2,3,4,5,6):
+ return dice.count(category) * category
+ elif category == 'FULL_HOUSE':
+ if len(set(dice)) == 2 and dice.count(dice[0]) in [2, 3]:
+ return sum(dice) or 0
+ elif category == 'FOUR_OF_A_KIND':
+ if dice[0] == dice[3] or dice[1] == dice[4]:
+ return dice[1] * 4 or 0
+ elif category == 'LITTLE_STRAIGHT':
+ if sorted(dice) == [1, 2, 3, 4, 5]:
+ return 30 or 0
+ elif category == 'BIG_STRAIGHT':
+ if sorted(dice) == [2, 3, 4, 5, 6]:
+ return 30 or 0
+ elif category == 'YACHT':
+ if all(num == dice[0] for num in dice):
+ return 50
+ elif category == 'CHOICE':
+ return sum(dice)
+ return 0
+```
+Read more on this approach [here][approach-if-structure].
+
+[approach-functions]: https://exercism.org/tracks/python/exercises/yacht/approaches/functions
+[approach-if-structure]: https://exercism.org/tracks/python/exercises/yacht/approaches/if-structure
diff --git a/exercises/practice/yacht/.approaches/structural-pattern-matching/content.md b/exercises/practice/yacht/.approaches/structural-pattern-matching/content.md
new file mode 100644
index 00000000000..b49bb6340bd
--- /dev/null
+++ b/exercises/practice/yacht/.approaches/structural-pattern-matching/content.md
@@ -0,0 +1,55 @@
+# Structural Pattern Matching
+
+Another very interesting approach is to use [structural pattern matching][structural pattern matching].
+Existing in Python since 3.10, this feature allows for neater code than traditional if structures.
+
+By and large, we reuse the code from the [if structure approach][approach-if-structure].
+We set the constants to random values and check for them in the `match` structure.
+`category` is the "subject", and in every other line, we check it against a "pattern".
+```python
+ONES = 1
+TWOS = 2
+THREES = 3
+FOURS = 4
+FIVES = 5
+SIXES = 6
+FULL_HOUSE = 'FULL_HOUSE'
+FOUR_OF_A_KIND = 'FOUR_OF_A_KIND'
+LITTLE_STRAIGHT = 'LITTLE_STRAIGHT'
+BIG_STRAIGHT = 'BIG_STRAIGHT'
+CHOICE = 'CHOICE'
+YACHT = 'YACHT'
+
+def score(dice, category):
+ match category:
+ case 1 | 2 | 3 | 4 | 5 | 6:
+ return dice.count(category) * category
+ case 'FULL_HOUSE' if len(set(dice)) == 2 and dice.count(dice[0]) in [2, 3]:
+ return sum(dice)
+ case 'FOUR_OF_A_KIND' if dice[0] == dice[3] or dice[1] == dice[4]:
+ return dice[1] * 4
+ case 'LITTLE_STRAIGHT' if sorted(dice) == [1, 2, 3, 4, 5]:
+ return 30
+ case 'BIG_STRAIGHT' if sorted(dice) == [2, 3, 4, 5, 6]:
+ return 30
+ case 'YACHT' if all(num == dice[0] for num in dice):
+ return 50
+ case 'CHOICE':
+ return sum(dice)
+ case _:
+ return 0
+```
+For the first pattern, we utilize "or patterns", using the `|` operator.
+This checks whether the subject is any of the provided patterns.
+
+In the next five patterns, we check an additional condition along with the pattern matching.
+Finally, we use the wildcard operator `_` to match anything.
+As the compiler checks the patterns (`case`s) in order, `return 0` will be executed if none of the other patterns match.
+
+Note that the conditions might differ, but the patterns must have hard coded values - that is, you can't say `case ONES ...` instead of `case 1 ...`.
+This will capture the category and lead to unexpected behavior.
+
+This code is much clenaer than the corresponding `if` structure code.
+
+[structural pattern matching]: https://peps.python.org/pep-0636/
+[approach-if-structure]: https://exercism.org/tracks/python/exercises/yacht/approaches/if-structure
\ No newline at end of file
diff --git a/exercises/practice/yacht/.approaches/structural-pattern-matching/snippet.txt b/exercises/practice/yacht/.approaches/structural-pattern-matching/snippet.txt
new file mode 100644
index 00000000000..4ed99824d8e
--- /dev/null
+++ b/exercises/practice/yacht/.approaches/structural-pattern-matching/snippet.txt
@@ -0,0 +1,8 @@
+ONES = 1
+YACHT = 'YACHT'
+def score(dice, category):
+ match category:
+ case 1 | 2 | 3 | 4 | 5 | 6:
+ return dice.count(category) * category
+ case _:
+ return 0
\ No newline at end of file
diff --git a/exercises/practice/yacht/.meta/template.j2 b/exercises/practice/yacht/.meta/template.j2
index 4086f512fc0..af604a42f90 100644
--- a/exercises/practice/yacht/.meta/template.j2
+++ b/exercises/practice/yacht/.meta/template.j2
@@ -1,10 +1,9 @@
{%- import "generator_macros.j2" as macros with context -%}
-import unittest
+{{ macros.canonical_ref() }}
+import unittest
import {{ exercise }}
-{{ macros.canonical_ref() }}
-
class {{ exercise | camel_case }}Test(unittest.TestCase):
{% for case in cases -%}
def test_{{ case["description"] | to_snake }}(self):
@@ -16,5 +15,3 @@ class {{ exercise | camel_case }}Test(unittest.TestCase):
{{ case["expected"] }})
{% endfor %}
-
-{{ macros.footer() }}
\ No newline at end of file
diff --git a/exercises/practice/yacht/yacht_test.py b/exercises/practice/yacht/yacht_test.py
index 5c262c88856..fd2f87ad1f1 100644
--- a/exercises/practice/yacht/yacht_test.py
+++ b/exercises/practice/yacht/yacht_test.py
@@ -1,9 +1,10 @@
-import unittest
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/yacht/canonical-data.json
+# File last updated on 2023-07-19
+import unittest
import yacht
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class YachtTest(unittest.TestCase):
def test_yacht(self):
@@ -92,7 +93,3 @@ def test_choice(self):
def test_yacht_as_choice(self):
self.assertEqual(yacht.score([2, 2, 2, 2, 2], yacht.CHOICE), 10)
-
-
-if __name__ == "__main__":
- unittest.main()
diff --git a/exercises/practice/zebra-puzzle/.meta/template.j2 b/exercises/practice/zebra-puzzle/.meta/template.j2
index 6b068c7e401..493b7ba7ee4 100644
--- a/exercises/practice/zebra-puzzle/.meta/template.j2
+++ b/exercises/practice/zebra-puzzle/.meta/template.j2
@@ -1,10 +1,10 @@
{%- import "generator_macros.j2" as macros with context -%}
-{{ macros.header() }}
+{{ macros.canonical_ref() }}
+
+{{ macros.header()}}
class {{ exercise | camel_case }}Test(unittest.TestCase):
{% for case in cases -%}
def test_{{ case["description"] | to_snake }}(self):
self.assertEqual({{ case["property"] | to_snake }}(), "{{ case["expected"] }}")
{% endfor %}
-
-{{ macros.footer() }}
diff --git a/exercises/practice/zebra-puzzle/zebra_puzzle_test.py b/exercises/practice/zebra-puzzle/zebra_puzzle_test.py
index 034d4cccf4d..fd2a331b185 100644
--- a/exercises/practice/zebra-puzzle/zebra_puzzle_test.py
+++ b/exercises/practice/zebra-puzzle/zebra_puzzle_test.py
@@ -1,3 +1,7 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/zebra-puzzle/canonical-data.json
+# File last updated on 2023-07-19
+
import unittest
from zebra_puzzle import (
@@ -5,8 +9,6 @@
owns_zebra,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class ZebraPuzzleTest(unittest.TestCase):
def test_resident_who_drinks_water(self):
@@ -14,7 +16,3 @@ def test_resident_who_drinks_water(self):
def test_resident_who_owns_zebra(self):
self.assertEqual(owns_zebra(), "Japanese")
-
-
-if __name__ == "__main__":
- unittest.main()
diff --git a/exercises/practice/zipper/.meta/template.j2 b/exercises/practice/zipper/.meta/template.j2
index 9f239bc1510..5d291d77f0a 100644
--- a/exercises/practice/zipper/.meta/template.j2
+++ b/exercises/practice/zipper/.meta/template.j2
@@ -1,4 +1,7 @@
{%- import "generator_macros.j2" as macros with context -%}
+{{ macros.canonical_ref() }}
+
+{{ macros.header (imports=["Zipper"]) }}
{%- macro test_case(case) %}
{%- set input = case["input"] -%}
@@ -9,7 +12,7 @@
{%- else %}
{{ expected_value(input, expected) }}
{%- endif %}
-{%- endmacro -%}
+{% endmacro %}
{%- macro expected_value(input, expected) -%}
initial = {{ input["initialTree"] }}
@@ -44,13 +47,10 @@
{%- for op in operations -%}
.{{ op["operation"] }}({{ op["item"] }})
{%- endfor %}
-{%- endmacro -%}
+{%- endmacro %}
-{{ macros.header (imports=["Zipper"]) }}
class {{ exercise | camel_case }}Test(unittest.TestCase):
{%- for case in cases %}
{{ test_case(case) }}
{%- endfor %}
-
-{{ macros.footer() }}
diff --git a/exercises/practice/zipper/zipper_test.py b/exercises/practice/zipper/zipper_test.py
index 5883e80df6c..702f6ccbcf9 100644
--- a/exercises/practice/zipper/zipper_test.py
+++ b/exercises/practice/zipper/zipper_test.py
@@ -1,11 +1,13 @@
+# These tests are auto-generated with test data from:
+# https://github.com/exercism/problem-specifications/tree/main/exercises/zipper/canonical-data.json
+# File last updated on 2023-07-19
+
import unittest
from zipper import (
Zipper,
)
-# Tests adapted from `problem-specifications//canonical-data.json`
-
class ZipperTest(unittest.TestCase):
def test_data_is_retained(self):
@@ -315,7 +317,3 @@ def test_different_paths_to_same_zipper(self):
expected = Zipper.from_tree(final).right().to_tree()
self.assertEqual(result, expected)
-
-
-if __name__ == "__main__":
- unittest.main()
diff --git a/exercises/shared/.docs/help.md b/exercises/shared/.docs/help.md
index 0e105b02d94..ef95bd6193b 100644
--- a/exercises/shared/.docs/help.md
+++ b/exercises/shared/.docs/help.md
@@ -3,6 +3,7 @@
Below are some resources for getting help if you run into trouble:
- [The PSF](https://www.python.org) hosts Python downloads, documentation, and community resources.
+- [The Exercism Community on Discord](https://exercism.org/r/discord)
- [Python Community on Discord](https://pythondiscord.com/) is a very helpful and active community.
- [/r/learnpython/](https://www.reddit.com/r/learnpython/) is a subreddit designed for Python learners.
- [#python on Libera.chat](https://www.python.org/community/irc/) this is where the core developers for the language hang out and get work done.
diff --git a/pylintrc b/pylintrc
index 745e6f039af..09795978bc4 100644
--- a/pylintrc
+++ b/pylintrc
@@ -341,11 +341,6 @@ known-standard-library=
# Force import order to recognize a module as part of a third party library.
known-third-party=enchant, absl
-# Analyse import fallback blocks. This can be used to support both Python 2 and
-# 3 compatible code, which means that the block might have code that exists
-# only in one or another interpreter, leading to false positives when analysed.
-analyse-fallback-blocks=no
-
[CLASSES]
diff --git a/reference/exercise-concepts/rna-transcription.md b/reference/exercise-concepts/rna-transcription.md
index b2b12946817..004ded95110 100644
--- a/reference/exercise-concepts/rna-transcription.md
+++ b/reference/exercise-concepts/rna-transcription.md
@@ -2,7 +2,7 @@
## Example implementation
-Modified from the existing [example.py](https://github.com/exercism/python/blob/master/exercises/rna-transcription/example.py) to remove Python 2 compatiblity noise:
+Taken from the existing [example.py](https://github.com/exercism/python/blob/main/exercises/practice/rna-transcription/.meta/example.py):
```python
DNA_TO_RNA = str.maketrans("AGCT", "UCGA")
diff --git a/reference/track_exercises_overview.md b/reference/track_exercises_overview.md
index f7a04168033..761f2c47644 100644
--- a/reference/track_exercises_overview.md
+++ b/reference/track_exercises_overview.md
@@ -11,126 +11,128 @@
Practice Exercises with Difficulty, Solutions, and Mentor Notes
-| Exercise | Difficulty | Solutions | Prereqs | Practices | Mentor Notes | Jinja? | Approaches? |
-| ------------------------------------------------------------------------------------------------------------------------------------------ | ------------------ | ------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------ | ----------------------------------------------------------------------------------------------------------------- | ----------------------------------------------------------------------------------------------------------------- | ---------------------------------------------------------------------------------------------------------------------- | ------------------------------------ | ----------- |
-| [**Hello World**](https://github.com/exercism/python/blob/main/exercises/practice/hello-world/.docs/instructions.md) | 🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/hello-world/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/hello-world/solutions?passed_head_tests=true) | NONE | `basics` | | ✅ | ❌ |
-| [Acronym](https://github.com/exercism/python/blob/main/exercises/practice/acronym/.docs/instructions.md) | 🔹🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/acronym/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/acronym/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L337) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L330) | [acronym](https://github.com/exercism/website-copy/tree/main/tracks/python/exercises/acronym/) | ✅ | ❌ |
-| [Affine Cipher](https://github.com/exercism/python/blob/main/exercises/practice/affine-cipher/.docs/instructions.md) | 🔹🔹🔹🔹🔹🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/affine-cipher/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/affine-cipher/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1174) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1173) | | ✅ | ❌ |
-| [All Your Base](https://github.com/exercism/python/blob/main/exercises/practice/all-your-base/.docs/instructions.md) | 🔹🔹🔹🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/all-your-base/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/all-your-base/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1394) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1393) | | ✅ | ❌ |
-| [Allergies](https://github.com/exercism/python/blob/main/exercises/practice/allergies/.docs/instructions.md) | 🔹🔹🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/allergies/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/allergies/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L701) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L700) | [allergies](https://github.com/exercism/website-copy/tree/main/tracks/python/exercises/allergies/) | ✅ | ❌ |
-| [Alphametics](https://github.com/exercism/python/blob/main/exercises/practice/alphametics/.docs/instructions.md) | 🔹🔹🔹🔹🔹🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/alphametics/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/alphametics/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1935) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1934) | | ✅ | ❌ |
-| [Anagram](https://github.com/exercism/python/blob/main/exercises/practice/anagram/.docs/instructions.md) | 🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/anagram/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/anagram/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L577) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L576) | | ✅ | ❌ |
-| [Armstrong Numbers](https://github.com/exercism/python/blob/main/exercises/practice/armstrong-numbers/.docs/instructions.md) | 🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/armstrong-numbers/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/armstrong-numbers/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L512) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L511) | | ✅ | ❌ |
-| [Atbash Cipher](https://github.com/exercism/python/blob/main/exercises/practice/atbash-cipher/.docs/instructions.md) | 🔹🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/atbash-cipher/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/atbash-cipher/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1102) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1101) | | ✅ | ❌ |
-| [Bank Account](https://github.com/exercism/python/blob/main/exercises/practice/bank-account/.docs/instructions.md) | 🔹🔹🔹🔹🔹🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/bank-account/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/bank-account/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L2207) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L2206) | | ❌ | ❌ |
-| [Binary Search Tree](https://github.com/exercism/python/blob/main/exercises/practice/binary-search-tree/.docs/instructions.md) | 🔹🔹🔹🔹🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/binary-search-tree/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/binary-search-tree/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1157) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1156) | | ✅ | ❌ |
-| [Binary Search](https://github.com/exercism/python/blob/main/exercises/practice/binary-search/.docs/instructions.md) | 🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/binary-search/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/binary-search/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1192) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1191) | [binary-search](https://github.com/exercism/website-copy/tree/main/tracks/python/exercises/binary-search/) | ✅ | ❌ |
-| [Bob](https://github.com/exercism/python/blob/main/exercises/practice/bob/.docs/instructions.md) | 🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/bob/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/bob/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L715) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L714) | [bob](https://github.com/exercism/website-copy/tree/main/tracks/python/exercises/bob/) | ✅ | ✅ |
-| [Book Store](https://github.com/exercism/python/blob/main/exercises/practice/book-store/.docs/instructions.md) | 🔹🔹🔹🔹🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/book-store/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/book-store/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L445) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L437) | | ✅ | ❌ |
-| [Bottle Song](https://github.com/exercism/python/blob/main/exercises/practice/bottle-song/.docs/instructions.md) | 🔹🔹🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/bottle-song/.meta/example.py)┋[most⭐](https://exercism.org/tracks/python/exercises/bottle-song/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/main/config.json/#LC1012) | [config.json](https://github.com/exercism/python/blob/main/config.json#LC1012) | | ✅ | ❌ |
-| [Bowling](https://github.com/exercism/python/blob/main/exercises/practice/bowling/.docs/instructions.md) | 🔹🔹🔹🔹🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/bowling/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/bowling/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1553) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1552) | | ✅ | ❌ |
-| [Change](https://github.com/exercism/python/blob/main/exercises/practice/change/.docs/instructions.md) | 🔹🔹🔹🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/change/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/change/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1412) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1411) | | ✅ | ❌ |
-| [Circular Buffer](https://github.com/exercism/python/blob/main/exercises/practice/circular-buffer/.docs/instructions.md) | 🔹🔹🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/circular-buffer/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/circular-buffer/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1475) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1469) | | ✅ | ❌ |
-| [Clock](https://github.com/exercism/python/blob/main/exercises/practice/clock/.docs/instructions.md) | 🔹🔹🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/clock/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/clock/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L394) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L389) | [clock](https://github.com/exercism/website-copy/tree/main/tracks/python/exercises/clock/) | ✅ | ❌ |
-| [Collatz Conjecture](https://github.com/exercism/python/blob/main/exercises/practice/collatz-conjecture/.docs/instructions.md) | 🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/collatz-conjecture/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/collatz-conjecture/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L593) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L592) | | ✅ | ❌ |
-| [Complex Numbers](https://github.com/exercism/python/blob/main/exercises/practice/complex-numbers/.docs/instructions.md) | 🔹🔹🔹🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/complex-numbers/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/complex-numbers/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L799) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L792) | | ✅ | ❌ |
-| [Connect](https://github.com/exercism/python/blob/main/exercises/practice/connect/.docs/instructions.md) | 🔹🔹🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/connect/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/connect/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L960) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L959) | | ✅ | ❌ |
-| [Crypto Square](https://github.com/exercism/python/blob/main/exercises/practice/crypto-square/.docs/instructions.md) | 🔹🔹🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/crypto-square/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/crypto-square/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1263) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1262) | | ✅ | ❌ |
-| [Darts](https://github.com/exercism/python/blob/main/exercises/practice/darts/.docs/instructions.md) | 🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/darts/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/darts/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L2199) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L2198) | | ✅ | ❌ |
-| [Diamond](https://github.com/exercism/python/blob/main/exercises/practice/diamond/.docs/instructions.md) | 🔹🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/diamond/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/diamond/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1696) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1695) | | ✅ | ❌ |
-| [Difference Of Squares](https://github.com/exercism/python/blob/main/exercises/practice/difference-of-squares/.docs/instructions.md) | 🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/difference-of-squares/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/difference-of-squares/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L601) | NONE | | ✅ | ❌ |
-| [Diffie Hellman](https://github.com/exercism/python/blob/main/exercises/practice/diffie-hellman/.docs/instructions.md) | 🔹🔹🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/diffie-hellman/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/diffie-hellman/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1956) | NONE | | ✅ | ❌ |
-| [Dnd Character](https://github.com/exercism/python/blob/main/exercises/practice/dnd-character/.docs/instructions.md) | 🔹🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/dnd-character/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/dnd-character/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L2078) | NONE | | ✅ | ❌ |
-| [Dominoes](https://github.com/exercism/python/blob/main/exercises/practice/dominoes/.docs/instructions.md) | 🔹🔹🔹🔹🔹🔹🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/dominoes/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/dominoes/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1767) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1755) | | ✅ | ❌ |
-| [Dot Dsl](https://github.com/exercism/python/blob/main/exercises/practice/dot-dsl/.docs/instructions.md) | 🔹🔹🔹🔹🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/dot-dsl/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/dot-dsl/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1434) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1427) | | ❌ | ❌ |
-| [Etl](https://github.com/exercism/python/blob/main/exercises/practice/etl/.docs/instructions.md) | 🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/etl/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/etl/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1118) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1117) | | ✅ | ❌ |
-| [Flatten Array](https://github.com/exercism/python/blob/main/exercises/practice/flatten-array/.docs/instructions.md) | 🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/flatten-array/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/flatten-array/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1126) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1125) | | ✅ | ❌ |
-| [Food Chain](https://github.com/exercism/python/blob/main/exercises/practice/food-chain/.docs/instructions.md) | 🔹🔹🔹🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/food-chain/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/food-chain/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1737) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1731) | | ✅ | ❌ |
-| [Forth](https://github.com/exercism/python/blob/main/exercises/practice/forth/.docs/instructions.md) | 🔹🔹🔹🔹🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/forth/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/forth/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1571) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1570) | | ✅ | ❌ |
-| [Gigasecond](https://github.com/exercism/python/blob/main/exercises/practice/gigasecond/.docs/instructions.md) | 🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/gigasecond/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/gigasecond/solutions?passed_head_tests=true) | | NONE | | ✅ | ❌ |
-| [Go Counting](https://github.com/exercism/python/blob/main/exercises/practice/go-counting/.docs/instructions.md) | 🔹🔹🔹🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/go-counting/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/go-counting/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L868) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L867) | | ✅ | ❌ |
-| [Grade School](https://github.com/exercism/python/blob/main/exercises/practice/grade-school/.docs/instructions.md) | 🔹🔹🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/grade-school/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/grade-school/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L364) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L363) | [grade-school](https://github.com/exercism/website-copy/tree/main/tracks/python/exercises/grade-school/) | ✅ | ❌ |
-| [Grains](https://github.com/exercism/python/blob/main/exercises/practice/grains/.docs/instructions.md) | 🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/grains/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/grains/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L678) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L677) | | ✅ | ✅ |
-| [Grep](https://github.com/exercism/python/blob/main/exercises/practice/grep/.docs/instructions.md) | 🔹🔹🔹🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/grep/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/grep/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1536) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1528) | | ✅ | ❌ |
-| [Hamming](https://github.com/exercism/python/blob/main/exercises/practice/hamming/.docs/instructions.md) | 🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/hamming/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/hamming/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L259) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L254) | [hamming](https://github.com/exercism/website-copy/tree/main/tracks/python/exercises/hamming/) | ✅ | ❌ |
-| [Hangman](https://github.com/exercism/python/blob/main/exercises/practice/hangman/.docs/instructions.md) | 🔹🔹🔹🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/hangman/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/hangman/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L2221) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L2220) | | ❌ | ❌ |
-| [High Scores](https://github.com/exercism/python/blob/main/exercises/practice/high-scores/.docs/instructions.md) | 🔹 🔹🔹🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/high-scores/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/high-scores/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L226) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L225) | [high-scores](https://github.com/exercism/website-copy/tree/main/tracks/python/exercises/high-scores/) | ✅ | ❌ |
-| [House](https://github.com/exercism/python/blob/main/exercises/practice/house/.docs/instructions.md) | 🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/house/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/house/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1279) | NONE | | ✅ | ❌ |
-| [Isbn Verifier](https://github.com/exercism/python/blob/main/exercises/practice/isbn-verifier/.docs/instructions.md) | 🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/isbn-verifier/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/isbn-verifier/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L609) | NONE | | ✅ | ❌ |
-| [Isogram](https://github.com/exercism/python/blob/main/exercises/practice/isogram/.docs/instructions.md) | 🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/isogram/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/isogram/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L273) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L272) | [isogram](https://github.com/exercism/website-copy/tree/main/tracks/python/exercises/isogram/) | ✅ | ✅ |
-| [Kindergarten Garden](https://github.com/exercism/python/blob/main/exercises/practice/kindergarten-garden/.docs/instructions.md) | 🔹🔹🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/kindergarten-garden/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/kindergarten-garden/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L350) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L344) | [kindergarten-garden](https://github.com/exercism/website-copy/tree/main/tracks/python/exercises/kindergarten-garden/) | ✅ | ❌ |
-| [Knapsack](https://github.com/exercism/python/blob/main/exercises/practice/knapsack/.docs/instructions.md) | 🔹🔹🔹🔹🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/knapsack/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/knapsack/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1453) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1452) | | ✅ | ❌ |
-| [Largest Series Product](https://github.com/exercism/python/blob/main/exercises/practice/largest-series-product/.docs/instructions.md) | 🔹🔹🔹🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/largest-series-product/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/largest-series-product/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L945) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L939) | | ✅ | ❌ |
-| [Leap](https://github.com/exercism/python/blob/main/exercises/practice/leap/.docs/instructions.md) | 🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/leap/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/leap/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L2103) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L2102) | [leap](https://github.com/exercism/website-copy/tree/main/tracks/python/exercises/leap/) | ✅ | ✅ |
-| [Ledger](https://github.com/exercism/python/blob/main/exercises/practice/ledger/.docs/instructions.md) | 🔹🔹🔹🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/ledger/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/ledger/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1590) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1589) | | ❌ | ❌ |
-| [Linked List](https://github.com/exercism/python/blob/main/exercises/practice/linked-list/.docs/instructions.md) | 🔹🔹🔹🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/linked-list/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/linked-list/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1379) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1371) | | ❌ | ❌ |
-| [List Ops](https://github.com/exercism/python/blob/main/exercises/practice/list-ops/.docs/instructions.md) | 🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/list-ops/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/list-ops/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1294) | NONE | | ✅ | ❌ |
-| [Luhn](https://github.com/exercism/python/blob/main/exercises/practice/luhn/.docs/instructions.md) | 🔹🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/luhn/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/luhn/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L372) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L371) | [luhn](https://github.com/exercism/website-copy/tree/main/tracks/python/exercises/luhn/) | ✅ | ❌ |
-| [Markdown](https://github.com/exercism/python/blob/main/exercises/practice/markdown/.docs/instructions.md) | 🔹🔹🔹🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/markdown/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/markdown/solutions?passed_head_tests=true) | | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L401) | [markdown](https://github.com/exercism/website-copy/tree/main/tracks/python/exercises/markdown/) | ✅ | ❌ |
-| [Matching Brackets](https://github.com/exercism/python/blob/main/exercises/practice/matching-brackets/.docs/instructions.md) | 🔹🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/matching-brackets/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/matching-brackets/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L728) | NONE | [matching-brackets](https://github.com/exercism/website-copy/tree/main/tracks/python/exercises/matching-brackets/) | ✅ | ❌ |
-| [Matrix](https://github.com/exercism/python/blob/main/exercises/practice/matrix/.docs/instructions.md) | 🔹🔹🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/matrix/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/matrix/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1714) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1713) | [matrix](https://github.com/exercism/website-copy/tree/main/tracks/python/exercises/matrix/) | ✅ | ❌ |
-| [Meetup](https://github.com/exercism/python/blob/main/exercises/practice/meetup/.docs/instructions.md) | 🔹🔹🔹🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/meetup/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/meetup/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L818) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L812) | | ✅ | ❌ |
-| [Minesweeper](https://github.com/exercism/python/blob/main/exercises/practice/minesweeper/.docs/instructions.md) | 🔹🔹🔹🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/minesweeper/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/minesweeper/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L981) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L980) | | ✅ | ❌ |
-| [Nth Prime](https://github.com/exercism/python/blob/main/exercises/practice/nth-prime/.docs/instructions.md) | 🔹🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/nth-prime/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/nth-prime/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1814) | NONE | | ✅ | ❌ |
-| [Ocr Numbers](https://github.com/exercism/python/blob/main/exercises/practice/ocr-numbers/.docs/instructions.md) | 🔹🔹🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/ocr-numbers/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/ocr-numbers/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L997) | NONE | | ✅ | ❌ |
-| [Paasio](https://github.com/exercism/python/blob/main/exercises/practice/paasio/.docs/instructions.md) | 🔹🔹🔹🔹🔹🔹🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/paasio/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/paasio/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1917) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1906) | | ❌ | ❌ |
-| [Palindrome Products](https://github.com/exercism/python/blob/main/exercises/practice/palindrome-products/.docs/instructions.md) | 🔹🔹🔹🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/palindrome-products/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/palindrome-products/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L626) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L625) | | ✅ | ❌ |
-| [Pangram](https://github.com/exercism/python/blob/main/exercises/practice/pangram/.docs/instructions.md) | 🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/pangram/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/pangram/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L463) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L462) | | ✅ | ✅ |
-| [Perfect Numbers](https://github.com/exercism/python/blob/main/exercises/practice/perfect-numbers/.docs/instructions.md) | 🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/perfect-numbers/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/perfect-numbers/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L527) | NONE | | ✅ | ❌ |
-| [Phone Number](https://github.com/exercism/python/blob/main/exercises/practice/phone-number/.docs/instructions.md) | 🔹🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/phone-number/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/phone-number/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L547) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L542) | | ✅ | ❌ |
-| [Pig Latin](https://github.com/exercism/python/blob/main/exercises/practice/pig-latin/.docs/instructions.md) | 🔹🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/pig-latin/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/pig-latin/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1832) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1831) | | ✅ | ✅ |
-| [Poker](https://github.com/exercism/python/blob/main/exercises/practice/poker/.docs/instructions.md) | 🔹🔹🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/poker/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/poker/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1016) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1015) | | ✅ | ❌ |
-| [Pov](https://github.com/exercism/python/blob/main/exercises/practice/pov/.docs/instructions.md) | 🔹🔹🔹🔹🔹🔹🔹🔹🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/pov/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/pov/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1677) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1676) | | ✅ | ❌ |
-| [Prime Factors](https://github.com/exercism/python/blob/main/exercises/practice/prime-factors/.docs/instructions.md) | 🔹🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/prime-factors/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/prime-factors/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L686) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L685) | | ✅ | ❌ |
-| [Protein Translation](https://github.com/exercism/python/blob/main/exercises/practice/protein-translation/.docs/instructions.md) | 🔹🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/protein-translation/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/protein-translation/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L496) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L495) | | ✅ | ❌ |
-| [Proverb](https://github.com/exercism/python/blob/main/exercises/practice/proverb/.docs/instructions.md) | 🔹🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/proverb/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/proverb/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/main/config.json#LC661) | [config.json](https://github.com/exercism/python/blob/main/config.json#L661) | | ✅ | ❌ |
-| [Pythagorean Triplet](https://github.com/exercism/python/blob/main/exercises/practice/pythagorean-triplet/.docs/instructions.md) | 🔹🔹🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/pythagorean-triplet/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/pythagorean-triplet/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L745) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L744) | | ✅ | ❌ |
-| [Queen Attack](https://github.com/exercism/python/blob/main/exercises/practice/queen-attack/.docs/instructions.md) | 🔹🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/queen-attack/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/queen-attack/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1302) | NONE | | ✅ | ❌ |
-| [Rail Fence Cipher](https://github.com/exercism/python/blob/main/exercises/practice/rail-fence-cipher/.docs/instructions.md) | 🔹🔹🔹🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/rail-fence-cipher/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/rail-fence-cipher/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1849) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1848) | | ✅ | ❌ |
-| [Raindrops](https://github.com/exercism/python/blob/main/exercises/practice/raindrops/.docs/instructions.md) | 🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/raindrops/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/raindrops/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L210) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L209) | [raindrops](https://github.com/exercism/website-copy/tree/main/tracks/python/exercises/raindrops/) | ✅ | ❌ |
-| [Rational Numbers](https://github.com/exercism/python/blob/main/exercises/practice/rational-numbers/.docs/instructions.md) | 🔹🔹🔹🔹🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/rational-numbers/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/rational-numbers/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L2240) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L2239) | | ✅ | ❌ |
-| [React](https://github.com/exercism/python/blob/main/exercises/practice/react/.docs/instructions.md) | 🔹🔹🔹🔹🔹🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/react/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/react/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L890) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L884) | | ❌ | ❌ |
-| [Rectangles](https://github.com/exercism/python/blob/main/exercises/practice/rectangles/.docs/instructions.md) | 🔹🔹🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/rectangles/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/rectangles/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1032) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1031) | | ✅ | ❌ |
-| [Resistor Color Trio](https://github.com/exercism/python/blob/main/exercises/practice/resistor-color-trio/.docs/instructions.md) | 🔹🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/resistor-color-trio/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/resistor-color-trio/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/main/config.json#LC631) | [config.json](https://github.com/exercism/python/blob/main/config.json#L631) | | ✅ | ❌ |
-| [Resistor Color Duo](https://github.com/exercism/python/blob/main/exercises/practice/resistor-color-duo/.docs/instructions.md) | 🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/resistor-color-duo/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/resistor-color-duo/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L2119) | NONE | | ✅ | ❌ |
-| [Resistor Color](https://github.com/exercism/python/blob/main/exercises/practice/resistor-color/.docs/instructions.md) | 🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/resistor-color/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/resistor-color/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L2111) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L2110) | | ✅ | ❌ |
-| [Rest Api](https://github.com/exercism/python/blob/main/exercises/practice/rest-api/.docs/instructions.md) | 🔹🔹🔹🔹🔹🔹🔹🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/rest-api/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/rest-api/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1795) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1787) | | ✅ | ❌ |
-| [Reverse String](https://github.com/exercism/python/blob/main/exercises/practice/reverse-string/.docs/instructions.md) | 🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/reverse-string/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/reverse-string/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L2133) | NONE | [reverse-string](https://github.com/exercism/website-copy/tree/main/tracks/python/exercises/reverse-string/) | ✅ | ❌ |
-| [Rna Transcription](https://github.com/exercism/python/blob/main/exercises/practice/rna-transcription/.docs/instructions.md) | 🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/rna-transcription/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/rna-transcription/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L2149) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L2148) | | ✅ | ✅ |
-| [Robot Name](https://github.com/exercism/python/blob/main/exercises/practice/robot-name/.docs/instructions.md) | 🔹🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/robot-name/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/robot-name/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L479) | NONE | | ❌ | ❌ |
-| [Robot Simulator](https://github.com/exercism/python/blob/main/exercises/practice/robot-simulator/.docs/instructions.md) | 🔹🔹🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/robot-simulator/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/robot-simulator/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1324) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1315) | | ✅ | ❌ |
-| [Roman Numerals](https://github.com/exercism/python/blob/main/exercises/practice/roman-numerals/.docs/instructions.md) | 🔹🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/roman-numerals/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/roman-numerals/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1340) | NONE | | ✅ | ❌ |
-| [Rotational Cipher](https://github.com/exercism/python/blob/main/exercises/practice/rotational-cipher/.docs/instructions.md) | 🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/rotational-cipher/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/rotational-cipher/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1209) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1208) | | ✅ | ❌ |
-| [Run Length Encoding](https://github.com/exercism/python/blob/main/exercises/practice/run-length-encoding/.docs/instructions.md) | 🔹🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/run-length-encoding/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/run-length-encoding/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1493) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1492) | | ✅ | ❌ |
-| [Saddle Points](https://github.com/exercism/python/blob/main/exercises/practice/saddle-points/.docs/instructions.md) | 🔹🔹🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/saddle-points/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/saddle-points/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L649) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L643) | | ✅ | ❌ |
-| [Satellite](https://github.com/exercism/python/blob/main/exercises/practice/satellite/.docs/instructions.md) | 🔹🔹🔹🔹🔹🔹🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/satellite/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/satellite/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1640) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1634) | | ✅ | ❌ |
-| [Say](https://github.com/exercism/python/blob/main/exercises/practice/say/.docs/instructions.md) | 🔹🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/say/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/say/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1052) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1051) | | ✅ | ❌ |
-| [Scale Generator](https://github.com/exercism/python/blob/main/exercises/practice/scale-generator/.docs/instructions.md) | 🔹🔹🔹🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/scale-generator/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/scale-generator/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1084) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1083) | | ✅ | ❌ |
-| [Scrabble Score](https://github.com/exercism/python/blob/main/exercises/practice/scrabble-score/.docs/instructions.md) | 🔹🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/scrabble-score/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/scrabble-score/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L316) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L315) | [scrabble-score](https://github.com/exercism/website-copy/tree/main/tracks/python/exercises/scrabble-score/) | ✅ | ❌ |
-| [Secret Handshake](https://github.com/exercism/python/blob/main/exercises/practice/secret-handshake/.docs/instructions.md) | 🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/secret-handshake/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/secret-handshake/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L924) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L923) | | ✅ | ❌ |
-| [Series](https://github.com/exercism/python/blob/main/exercises/practice/series/.docs/instructions.md) | 🔹🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/series/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/series/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L562) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L561) | | ✅ | ❌ |
-| [Sgf Parsing](https://github.com/exercism/python/blob/main/exercises/practice/sgf-parsing/.docs/instructions.md) | 🔹🔹🔹🔹🔹🔹🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/sgf-parsing/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/sgf-parsing/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L2261) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L2255) | | ✅ | ❌ |
-| [Sieve](https://github.com/exercism/python/blob/main/exercises/practice/sieve/.docs/instructions.md) | 🔹🔹🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/sieve/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/sieve/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L836) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L835) | | ✅ | ❌ |
-| [Simple Cipher](https://github.com/exercism/python/blob/main/exercises/practice/simple-cipher/.docs/instructions.md) | 🔹🔹🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/simple-cipher/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/simple-cipher/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L761) | NONE | | ✅ | ❌ |
-| [Simple Linked List](https://github.com/exercism/python/blob/main/exercises/practice/simple-linked-list/.docs/instructions.md) | 🔹🔹🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/simple-linked-list/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/simple-linked-list/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1357) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1356) | | ❌ | ❌ |
-| [Space Age](https://github.com/exercism/python/blob/main/exercises/practice/space-age/.docs/instructions.md) | 🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/space-age/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/space-age/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L2164) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L2163) | | ✅ | ❌ |
-| [Spiral Matrix](https://github.com/exercism/python/blob/main/exercises/practice/spiral-matrix/.docs/instructions.md) | 🔹🔹🔹🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/spiral-matrix/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/spiral-matrix/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1714) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1713) | | ✅ | ❌ |
-| [Sublist](https://github.com/exercism/python/blob/main/exercises/practice/sublist/.docs/instructions.md) | 🔹🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/sublist/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/sublist/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1141) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1140) | | ✅ | ❌ |
-| [Sum Of Multiples](https://github.com/exercism/python/blob/main/exercises/practice/sum-of-multiples/.docs/instructions.md) | 🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/sum-of-multiples/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/sum-of-multiples/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L778) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L777) | [sum-of-multiples](https://github.com/exercism/website-copy/tree/main/tracks/python/exercises/sum-of-multiples/) | ✅ | ❌ |
-| [Tournament](https://github.com/exercism/python/blob/main/exercises/practice/tournament/.docs/instructions.md) | 🔹🔹🔹🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/tournament/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/tournament/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L421) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L409) | | ✅ | ❌ |
-| [Transpose](https://github.com/exercism/python/blob/main/exercises/practice/transpose/.docs/instructions.md) | 🔹🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/transpose/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/transpose/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1511) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1510) | | ✅ | ❌ |
-| [Tree Building](https://github.com/exercism/python/blob/main/exercises/practice/tree-building/.docs/instructions.md) | 🔹🔹🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/tree-building/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/tree-building/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L852) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L851) | | ❌ | ❌ |
-| [Triangle](https://github.com/exercism/python/blob/main/exercises/practice/triangle/.docs/instructions.md) | 🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/triangle/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/triangle/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L664) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L663) | | ✅ | ❌ |
-| [Twelve Days](https://github.com/exercism/python/blob/main/exercises/practice/twelve-days/.docs/instructions.md) | 🔹🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/twelve-days/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/twelve-days/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L281) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L280) | [twelve-days](https://github.com/exercism/website-copy/tree/main/tracks/python/exercises/twelve-days/) | ✅ | ❌ |
-| [Two Bucket](https://github.com/exercism/python/blob/main/exercises/practice/two-bucket/.docs/instructions.md) | 🔹🔹🔹🔹🔹🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/two-bucket/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/two-bucket/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1244) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1243) | | ✅ | ❌ |
-| [Two Fer](https://github.com/exercism/python/blob/main/exercises/practice/two-fer/.docs/instructions.md) | 🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/two-fer/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/two-fer/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L202) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L201) | [two-fer](https://github.com/exercism/website-copy/tree/main/tracks/python/exercises/two-fer/) | ✅ | ❌ |
-| [Variable Length Quantity](https://github.com/exercism/python/blob/main/exercises/practice/variable-length-quantity/.docs/instructions.md) | 🔹🔹🔹🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/variable-length-quantity/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/variable-length-quantity/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1226) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1225) | | ✅ | ❌ |
-| [Word Count](https://github.com/exercism/python/blob/main/exercises/practice/word-count/.docs/instructions.md) | 🔹🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/word-count/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/word-count/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L302) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L296) | [word-count](https://github.com/exercism/website-copy/tree/main/tracks/python/exercises/word-count/) | ✅ | ❌ |
-| [Word Search](https://github.com/exercism/python/blob/main/exercises/practice/word-search/.docs/instructions.md) | 🔹🔹🔹🔹🔹🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/word-search/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/word-search/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1616) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1606) | | ✅ | ❌ |
-| [Wordy](https://github.com/exercism/python/blob/main/exercises/practice/wordy/.docs/instructions.md) | 🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/wordy/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/wordy/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1069) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1068) | | ✅ | ✅ |
-| [Yacht](https://github.com/exercism/python/blob/main/exercises/practice/yacht/.docs/instructions.md) | 🔹🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/yacht/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/yacht/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L2180) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L2179) | | ✅ | ❌ |
-| [Zebra Puzzle](https://github.com/exercism/python/blob/main/exercises/practice/zebra-puzzle/.docs/instructions.md) | 🔹🔹🔹🔹🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/zebra-puzzle/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/zebra-puzzle/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1866) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1865) | | ✅ | ❌ |
-| [Zipper](https://github.com/exercism/python/blob/main/exercises/practice/zipper/.docs/instructions.md) | 🔹🔹🔹🔹🔹🔹 | [example](https://github.com/exercism/python/blob/main/exercises/practice/zipper/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/zipper/solutions?passed_head_tests=true) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1659) | [config.json](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1658) | | ✅ | ❌ |
+| Exercise | Difficulty | Solutions | Prereqs | Practices | Hints? | Approaches? | Mentor Notes | Appends? | Jinja? |
+|-------------------------------------------------------------------------------------------------------------------------------------------- |:----------: |------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- |---------------------------------------------------------------------------------------------------------- |---------------------------------------------------------------------------------------------------------- |-------------------------------------------------------------------------------------------------------- |------------------------------------------------------------------------------------------------------- |------------------------------------------------------------------------------------------------------ |---------------------------------------------------------------------------------------------------------------------------- |----------------------------------------------------------------------------------------------------------------- |
+| [**Hello World**](https://github.com/exercism/python/blob/main/exercises/practice/hello-world/.docs/instructions.md) | 1 | NA | NONE | NONE | NA | NA | NA | NA | NA |
+| [Acronym](https://github.com/exercism/python/blob/main/exercises/practice/acronym/.docs/instructions.md) | 2 | [example](https://github.com/exercism/python/blob/main/exercises/practice/acronym/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/acronym/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L337) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L330) | | ✔ | [✔](https://github.com/exercism/website-copy/tree/main/tracks/python/exercises/acronym/) | [✔](https://github.com/exercism/python/blob/main/exercises/practice/acronym/.docs/instructions.append.md) | [✔](https://github.com/exercism/python/blob/main/exercises/practice/acronym/.meta/template.j2) |
+| [Affine Cipher](https://github.com/exercism/python/blob/main/exercises/practice/affine-cipher/.docs/instructions.md) | 6 | [example](https://github.com/exercism/python/blob/main/exercises/practice/affine-cipher/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/affine-cipher/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1174) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1173) | | | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/affine-cipher/.docs/instructions.append.md) | [✔](https://github.com/exercism/python/blob/main/exercises/practice/affine-cipher/.meta/template.j2) |
+| [All Your Base](https://github.com/exercism/python/blob/main/exercises/practice/all-your-base/.docs/instructions.md) | 4 | [example](https://github.com/exercism/python/blob/main/exercises/practice/all-your-base/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/all-your-base/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1394) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1393) | | | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/all-your-base/.docs/instructions.append.md) | [✔](https://github.com/exercism/python/blob/main/exercises/practice/all-your-base/.meta/template.j2) |
+| [Allergies](https://github.com/exercism/python/blob/main/exercises/practice/allergies/.docs/instructions.md) | 3 | [example](https://github.com/exercism/python/blob/main/exercises/practice/allergies/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/allergies/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L701) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L700) | | | [✔](https://github.com/exercism/website-copy/tree/main/tracks/python/exercises/allergies/) | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/allergies/.meta/template.j2) |
+| [Alphametics](https://github.com/exercism/python/blob/main/exercises/practice/alphametics/.docs/instructions.md) | 6 | [example](https://github.com/exercism/python/blob/main/exercises/practice/alphametics/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/alphametics/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1935) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1934) | | | | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/alphametics/.meta/template.j2) |
+| [Anagram](https://github.com/exercism/python/blob/main/exercises/practice/anagram/.docs/instructions.md) | 1 | [example](https://github.com/exercism/python/blob/main/exercises/practice/anagram/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/anagram/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L577) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L576) | | ✔ | | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/anagram/.meta/template.j2) |
+| [Armstrong Numbers](https://github.com/exercism/python/blob/main/exercises/practice/armstrong-numbers/.docs/instructions.md) | 1 | [example](https://github.com/exercism/python/blob/main/exercises/practice/armstrong-numbers/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/armstrong-numbers/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L512) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L511) | | ✔ | [✔](https://github.com/exercism/website-copy/tree/main/tracks/python/exercises/armstrong-numbers/) | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/armstrong-numbers/.meta/template.j2) |
+| [Atbash Cipher](https://github.com/exercism/python/blob/main/exercises/practice/atbash-cipher/.docs/instructions.md) | 2 | [example](https://github.com/exercism/python/blob/main/exercises/practice/atbash-cipher/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/atbash-cipher/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1102) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1101) | | | | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/atbash-cipher/.meta/template.j2) |
+| [Bank Account](https://github.com/exercism/python/blob/main/exercises/practice/bank-account/.docs/instructions.md) | 6 | [example](https://github.com/exercism/python/blob/main/exercises/practice/bank-account/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/bank-account/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L2207) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L2206) | | | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/bank-account/.docs/instructions.append.md) | [✔](https://github.com/exercism/python/blob/main/exercises/practice/bank-account/.meta/template.j2) |
+| [Binary Search Tree](https://github.com/exercism/python/blob/main/exercises/practice/binary-search-tree/.docs/instructions.md) | 5 | [example](https://github.com/exercism/python/blob/main/exercises/practice/binary-search-tree/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/binary-search-tree/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1157) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1156) | | | | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/binary-search-tree/.meta/template.j2) |
+| [Binary Search](https://github.com/exercism/python/blob/main/exercises/practice/binary-search/.docs/instructions.md) | 1 | [example](https://github.com/exercism/python/blob/main/exercises/practice/binary-search/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/binary-search/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1192) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1191) | | | [✔](https://github.com/exercism/website-copy/tree/main/tracks/python/exercises/binary-search/) | [✔](https://github.com/exercism/python/blob/main/exercises/practice/binary-search/.docs/instructions.append.md) | [✔](https://github.com/exercism/python/blob/main/exercises/practice/binary-search/.meta/template.j2) |
+| [Bob](https://github.com/exercism/python/blob/main/exercises/practice/bob/.docs/instructions.md) | 1 | [example](https://github.com/exercism/python/blob/main/exercises/practice/bob/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/bob/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L715) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L714) | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/bob/.approaches/) | [✔](https://github.com/exercism/website-copy/tree/main/tracks/python/exercises/bob/) | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/bob/.meta/template.j2) |
+| [Book Store](https://github.com/exercism/python/blob/main/exercises/practice/book-store/.docs/instructions.md) | 5 | [example](https://github.com/exercism/python/blob/main/exercises/practice/book-store/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/book-store/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L445) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L437) | | ✔ | | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/book-store/.meta/template.j2) |
+| [Bottle Song](https://github.com/exercism/python/blob/main/exercises/practice/bottle-song/.docs/instructions.md) | 3 | [example](https://github.com/exercism/python/blob/main/exercises/practice/bottle-song/.meta/example.py)┋[most⭐](https://exercism.org/tracks/python/exercises/bottle-song/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/main/config.json/#LC1012) | [⚙⚙](https://github.com/exercism/python/blob/main/config.json#LC1012) | | | | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/bottle-song/.meta/template.j2) |
+| [Bowling](https://github.com/exercism/python/blob/main/exercises/practice/bowling/.docs/instructions.md) | 5 | [example](https://github.com/exercism/python/blob/main/exercises/practice/bowling/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/bowling/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1553) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1552) | | | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/bowling/.docs/instructions.append.md) | [✔](https://github.com/exercism/python/blob/main/exercises/practice/bowling/.meta/template.j2) |
+| [Change](https://github.com/exercism/python/blob/main/exercises/practice/change/.docs/instructions.md) | 4 | [example](https://github.com/exercism/python/blob/main/exercises/practice/change/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/change/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1412) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1411) | | | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/change/.docs/instructions.append.md) | [✔](https://github.com/exercism/python/blob/main/exercises/practice/change/.meta/template.j2) |
+| [Circular Buffer](https://github.com/exercism/python/blob/main/exercises/practice/circular-buffer/.docs/instructions.md) | 3 | [example](https://github.com/exercism/python/blob/main/exercises/practice/circular-buffer/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/circular-buffer/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1475) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1469) | | | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/circular-buffer/.docs/instructions.append.md) | [✔](https://github.com/exercism/python/blob/main/exercises/practice/circular-buffer/.meta/template.j2) |
+| [Clock](https://github.com/exercism/python/blob/main/exercises/practice/clock/.docs/instructions.md) | 3 | [example](https://github.com/exercism/python/blob/main/exercises/practice/clock/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/clock/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L394) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L389) | | | [✔](https://github.com/exercism/website-copy/tree/main/tracks/python/exercises/clock/) | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/clock/.meta/template.j2) |
+| [Collatz Conjecture](https://github.com/exercism/python/blob/main/exercises/practice/collatz-conjecture/.docs/instructions.md) | 1 | [example](https://github.com/exercism/python/blob/main/exercises/practice/collatz-conjecture/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/collatz-conjecture/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L593) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L592) | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/collatz-conjecture/.approaches/) | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/collatz-conjecture/.docs/instructions.append.md) | [✔](https://github.com/exercism/python/blob/main/exercises/practice/collatz-conjecture/.meta/template.j2) |
+| [Complex Numbers](https://github.com/exercism/python/blob/main/exercises/practice/complex-numbers/.docs/instructions.md) | 4 | [example](https://github.com/exercism/python/blob/main/exercises/practice/complex-numbers/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/complex-numbers/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L799) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L792) | | | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/complex-numbers/.docs/instructions.append.md) | [✔](https://github.com/exercism/python/blob/main/exercises/practice/complex-numbers/.meta/template.j2) |
+| [Connect](https://github.com/exercism/python/blob/main/exercises/practice/connect/.docs/instructions.md) | 3 | [example](https://github.com/exercism/python/blob/main/exercises/practice/connect/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/connect/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L960) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L959) | | | | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/connect/.meta/template.j2) |
+| [Crypto Square](https://github.com/exercism/python/blob/main/exercises/practice/crypto-square/.docs/instructions.md) | 3 | [example](https://github.com/exercism/python/blob/main/exercises/practice/crypto-square/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/crypto-square/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1263) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1262) | | | | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/crypto-square/.meta/template.j2) |
+| [Darts](https://github.com/exercism/python/blob/main/exercises/practice/darts/.docs/instructions.md) | 1 | [example](https://github.com/exercism/python/blob/main/exercises/practice/darts/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/darts/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L2199) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L2198) | [✔](https://github.com/exercism/python/blob/main/exercises/practice/darts/.docs/hints.md) | ✔ | [✔](https://github.com/exercism/website-copy/tree/main/tracks/python/exercises/darts/) | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/darts/.meta/template.j2) |
+| [Diamond](https://github.com/exercism/python/blob/main/exercises/practice/diamond/.docs/instructions.md) | 2 | [example](https://github.com/exercism/python/blob/main/exercises/practice/diamond/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/diamond/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1696) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1695) | | | | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/diamond/.meta/template.j2) |
+| [Difference Of Squares](https://github.com/exercism/python/blob/main/exercises/practice/difference-of-squares/.docs/instructions.md) | 1 | [example](https://github.com/exercism/python/blob/main/exercises/practice/difference-of-squares/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/difference-of-squares/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L601) | NONE | | | | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/difference-of-squares/.meta/template.j2) |
+| [Dnd Character](https://github.com/exercism/python/blob/main/exercises/practice/dnd-character/.docs/instructions.md) | 2 | [example](https://github.com/exercism/python/blob/main/exercises/practice/dnd-character/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/dnd-character/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L2078) | NONE | | | [✔](https://github.com/exercism/website-copy/tree/main/tracks/python/exercises/dnd-character/) | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/dnd-character/.meta/template.j2) |
+| [Dominoes](https://github.com/exercism/python/blob/main/exercises/practice/dominoes/.docs/instructions.md) | 7 | [example](https://github.com/exercism/python/blob/main/exercises/practice/dominoes/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/dominoes/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1767) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1755) | | | | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/dominoes/.meta/template.j2) |
+| [Dot Dsl](https://github.com/exercism/python/blob/main/exercises/practice/dot-dsl/.docs/instructions.md) | 5 | [example](https://github.com/exercism/python/blob/main/exercises/practice/dot-dsl/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/dot-dsl/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1434) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1427) | | | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/dot-dsl/.docs/instructions.append.md) | |
+| [Etl](https://github.com/exercism/python/blob/main/exercises/practice/etl/.docs/instructions.md) | 1 | [example](https://github.com/exercism/python/blob/main/exercises/practice/etl/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/etl/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1118) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1117) | | ✔ | | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/etl/.meta/template.j2) |
+| [Flatten Array](https://github.com/exercism/python/blob/main/exercises/practice/flatten-array/.docs/instructions.md) | 1 | [example](https://github.com/exercism/python/blob/main/exercises/practice/flatten-array/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/flatten-array/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1126) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1125) | | | | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/flatten-array/.meta/template.j2) |
+| [Food Chain](https://github.com/exercism/python/blob/main/exercises/practice/food-chain/.docs/instructions.md) | 4 | [example](https://github.com/exercism/python/blob/main/exercises/practice/food-chain/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/food-chain/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1737) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1731) | | | | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/food-chain/.meta/template.j2) |
+| [Forth](https://github.com/exercism/python/blob/main/exercises/practice/forth/.docs/instructions.md) | 5 | [example](https://github.com/exercism/python/blob/main/exercises/practice/forth/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/forth/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1571) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1570) | | | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/forth/.docs/instructions.append.md) | [✔](https://github.com/exercism/python/blob/main/exercises/practice/forth/.meta/template.j2) |
+| [Gigasecond](https://github.com/exercism/python/blob/main/exercises/practice/gigasecond/.docs/instructions.md) | 1 | [example](https://github.com/exercism/python/blob/main/exercises/practice/gigasecond/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/gigasecond/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/main/config.json#L450) | NONE | [✔](https://github.com/exercism/python/blob/main/exercises/practice/gigasecond/.docs/hints.md) | ✔ | [✔](https://github.com/exercism/website-copy/tree/main/tracks/python/exercises/gigasecond/) | [✔](https://github.com/exercism/python/blob/main/exercises/practice/gigasecond/.docs/instructions.append.md) | [✔](https://github.com/exercism/python/blob/main/exercises/practice/gigasecond/.meta/template.j2) |
+| [Go Counting](https://github.com/exercism/python/blob/main/exercises/practice/go-counting/.docs/instructions.md) | 4 | [example](https://github.com/exercism/python/blob/main/exercises/practice/go-counting/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/go-counting/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L868) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L867) | | | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/go-counting/.docs/instructions.append.md) | [✔](https://github.com/exercism/python/blob/main/exercises/practice/go-counting/.meta/template.j2) |
+| [Grade School](https://github.com/exercism/python/blob/main/exercises/practice/grade-school/.docs/instructions.md) | 3 | [example](https://github.com/exercism/python/blob/main/exercises/practice/grade-school/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/grade-school/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L364) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L363) | | | [✔](https://github.com/exercism/website-copy/tree/main/tracks/python/exercises/grade-school/) | [✔](https://github.com/exercism/python/blob/main/exercises/practice/grade-school/.docs/instructions.append.md) | [✔](https://github.com/exercism/python/blob/main/exercises/practice/grade-school/.meta/template.j2) |
+| [Grains](https://github.com/exercism/python/blob/main/exercises/practice/grains/.docs/instructions.md) | 1 | [example](https://github.com/exercism/python/blob/main/exercises/practice/grains/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/grains/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L678) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L677) | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/grains/.approaches/) | [✔](https://github.com/exercism/website-copy/tree/main/tracks/python/exercises/grains/) | [✔](https://github.com/exercism/python/blob/main/exercises/practice/grains/.docs/instructions.append.md) | [✔](https://github.com/exercism/python/blob/main/exercises/practice/grains/.meta/template.j2) |
+| [Grep](https://github.com/exercism/python/blob/main/exercises/practice/grep/.docs/instructions.md) | 4 | [example](https://github.com/exercism/python/blob/main/exercises/practice/grep/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/grep/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1536) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1528) | | | | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/grep/.meta/template.j2) |
+| [Hamming](https://github.com/exercism/python/blob/main/exercises/practice/hamming/.docs/instructions.md) | 1 | [example](https://github.com/exercism/python/blob/main/exercises/practice/hamming/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/hamming/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L259) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L254) | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/hamming/.approaches/) | [✔](https://github.com/exercism/website-copy/tree/main/tracks/python/exercises/hamming/) | [✔](https://github.com/exercism/python/blob/main/exercises/practice/hamming/.docs/instructions.append.md) | [✔](https://github.com/exercism/python/blob/main/exercises/practice/hamming/.meta/template.j2) |
+| [Hangman](https://github.com/exercism/python/blob/main/exercises/practice/hangman/.docs/instructions.md) | 4 | [example](https://github.com/exercism/python/blob/main/exercises/practice/hangman/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/hangman/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L2221) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L2220) | | | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/hangman/.docs/instructions.append.md) | |
+| [High Scores](https://github.com/exercism/python/blob/main/exercises/practice/high-scores/.docs/instructions.md) | 4 | [example](https://github.com/exercism/python/blob/main/exercises/practice/high-scores/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/high-scores/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L226) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L225) | | | [✔](https://github.com/exercism/website-copy/tree/main/tracks/python/exercises/high-scores/) | [✔](https://github.com/exercism/python/blob/main/exercises/practice/high-scores/.docs/instructions.append.md) | [✔](https://github.com/exercism/python/blob/main/exercises/practice/high-scores/.meta/template.j2) |
+| [House](https://github.com/exercism/python/blob/main/exercises/practice/house/.docs/instructions.md) | 1 | [example](https://github.com/exercism/python/blob/main/exercises/practice/house/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/house/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1279) | NONE | | ✔ | | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/house/.meta/template.j2) |
+| [Isbn Verifier](https://github.com/exercism/python/blob/main/exercises/practice/isbn-verifier/.docs/instructions.md) | 1 | [example](https://github.com/exercism/python/blob/main/exercises/practice/isbn-verifier/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/isbn-verifier/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L609) | NONE | | ✔ | [✔](https://github.com/exercism/website-copy/tree/main/tracks/python/exercises/isbn-verifier/) | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/isbn-verifier/.meta/template.j2) |
+| [Isogram](https://github.com/exercism/python/blob/main/exercises/practice/isogram/.docs/instructions.md) | 1 | [example](https://github.com/exercism/python/blob/main/exercises/practice/isogram/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/isogram/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L273) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L272) | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/isogram/.approaches/) | [✔](https://github.com/exercism/website-copy/tree/main/tracks/python/exercises/isogram/) | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/isogram/.meta/template.j2) |
+| [Isogram](https://github.com/exercism/python/blob/main/exercises/practice/killer-sudoku-helper/.docs/instructions.md) | 4 | [example](https://github.com/exercism/python/blob/main/exercises/practice/killer-sudoku-helper/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/killer-sudodu-helper/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/main/config.json#L1385) | [⚙⚙](https://github.com/exercism/python/blob/main/config.json#L1384) | | | | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/killer-sudoku-helper/.meta/template.j2) |
+| [Kindergarten Garden](https://github.com/exercism/python/blob/main/exercises/practice/kindergarten-garden/.docs/instructions.md) | 3 | [example](https://github.com/exercism/python/blob/main/exercises/practice/kindergarten-garden/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/kindergarten-garden/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L350) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L344) | | | [✔](https://github.com/exercism/website-copy/tree/main/tracks/python/exercises/kindergarten-garden/) | [✔](https://github.com/exercism/python/blob/main/exercises/practice/kindergarten-garden/.docs/instructions.append.md) | [✔](https://github.com/exercism/python/blob/main/exercises/practice/kindergarten-garden/.meta/template.j2) |
+| [Knapsack](https://github.com/exercism/python/blob/main/exercises/practice/knapsack/.docs/instructions.md) | 5 | [example](https://github.com/exercism/python/blob/main/exercises/practice/knapsack/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/knapsack/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1453) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1452) | | | | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/knapsack/.meta/template.j2) |
+| [Largest Series Product](https://github.com/exercism/python/blob/main/exercises/practice/largest-series-product/.docs/instructions.md) | 4 | [example](https://github.com/exercism/python/blob/main/exercises/practice/largest-series-product/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/largest-series-product/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L945) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L939) | | ✔ | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/largest-series-product/.docs/instructions.append.md) | [✔](https://github.com/exercism/python/blob/main/exercises/practice/largest-series-product/.meta/template.j2) |
+| [Leap](https://github.com/exercism/python/blob/main/exercises/practice/leap/.docs/instructions.md) | 1 | [example](https://github.com/exercism/python/blob/main/exercises/practice/leap/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/leap/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L2103) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L2102) | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/leap/.approaches/) | [✔](https://github.com/exercism/website-copy/tree/main/tracks/python/exercises/leap/) | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/leap/.meta/template.j2) |
+| [Ledger](https://github.com/exercism/python/blob/main/exercises/practice/ledger/.docs/instructions.md) | 4 | [example](https://github.com/exercism/python/blob/main/exercises/practice/ledger/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/ledger/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1590) | | | | | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/ledger/.meta/template.j2) |
+| [Linked List](https://github.com/exercism/python/blob/main/exercises/practice/linked-list/.docs/instructions.md) | 4 | [example](https://github.com/exercism/python/blob/main/exercises/practice/linked-list/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/linked-list/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1379) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1371) | | | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/linked-list/.docs/instructions.append.md) | [✔](https://github.com/exercism/python/blob/main/exercises/practice/linked-list/.meta/template.j2) |
+| [List Ops](https://github.com/exercism/python/blob/main/exercises/practice/list-ops/.docs/instructions.md) | 1 | [example](https://github.com/exercism/python/blob/main/exercises/practice/list-ops/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/list-ops/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1294) | NONE | | | | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/list-ops/.meta/template.j2) |
+| [Luhn](https://github.com/exercism/python/blob/main/exercises/practice/luhn/.docs/instructions.md) | 2 | [example](https://github.com/exercism/python/blob/main/exercises/practice/luhn/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/luhn/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L372) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L371) | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/luhn/.approaches/) | [✔](https://github.com/exercism/website-copy/tree/main/tracks/python/exercises/luhn/) | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/luhn/.meta/template.j2) |
+| [Markdown](https://github.com/exercism/python/blob/main/exercises/practice/markdown/.docs/instructions.md) | 4 | [example](https://github.com/exercism/python/blob/main/exercises/practice/markdown/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/markdown/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/main/config.json#L1418) | [⚙⚙](https://github.com/exercism/python/blob/main/config.json#L1417) | | | [✔](https://github.com/exercism/website-copy/tree/main/tracks/python/exercises/markdown/) | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/markdown/.meta/template.j2) |
+| [Matching Brackets](https://github.com/exercism/python/blob/main/exercises/practice/matching-brackets/.docs/instructions.md) | 2 | [example](https://github.com/exercism/python/blob/main/exercises/practice/matching-brackets/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/matching-brackets/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L728) | NONE | | | [✔](https://github.com/exercism/website-copy/tree/main/tracks/python/exercises/matching-brackets/) | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/matching-brackets/.meta/template.j2) |
+| [Matrix](https://github.com/exercism/python/blob/main/exercises/practice/matrix/.docs/instructions.md) | 3 | [example](https://github.com/exercism/python/blob/main/exercises/practice/matrix/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/matrix/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1714) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1713) | | ✔ | [✔](https://github.com/exercism/website-copy/tree/main/tracks/python/exercises/matrix/) | [✔](https://github.com/exercism/python/blob/main/exercises/practice/matrix/.docs/instructions.append.md) | [✔](https://github.com/exercism/python/blob/main/exercises/practice/matrix/.meta/template.j2) |
+| [Meetup](https://github.com/exercism/python/blob/main/exercises/practice/meetup/.docs/instructions.md) | 4 | [example](https://github.com/exercism/python/blob/main/exercises/practice/meetup/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/meetup/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L818) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L812) | | ✔ | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/meetup/.docs/instructions.append.md) | [✔](https://github.com/exercism/python/blob/main/exercises/practice/meetup/.meta/template.j2) |
+| [Minesweeper](https://github.com/exercism/python/blob/main/exercises/practice/minesweeper/.docs/instructions.md) | 4 | [example](https://github.com/exercism/python/blob/main/exercises/practice/minesweeper/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/minesweeper/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L981) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L980) | | | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/minesweeper/.docs/instructions.append.md) | [✔](https://github.com/exercism/python/blob/main/exercises/practice/minesweeper/.meta/template.j2) |
+| [Nth Prime](https://github.com/exercism/python/blob/main/exercises/practice/nth-prime/.docs/instructions.md) | 2 | [example](https://github.com/exercism/python/blob/main/exercises/practice/nth-prime/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/nth-prime/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1814) | NONE | | | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/nth-prime/.docs/instructions.append.md) | [✔](https://github.com/exercism/python/blob/main/exercises/practice/nth-prime/.meta/template.j2) |
+| [Ocr Numbers](https://github.com/exercism/python/blob/main/exercises/practice/ocr-numbers/.docs/instructions.md) | 3 | [example](https://github.com/exercism/python/blob/main/exercises/practice/ocr-numbers/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/ocr-numbers/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L997) | NONE | | | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/ocr-numbers/.docs/instructions.append.md) | [✔](https://github.com/exercism/python/blob/main/exercises/practice/ocr-numbers/.meta/template.j2) |
+| [Paasio](https://github.com/exercism/python/blob/main/exercises/practice/paasio/.docs/instructions.md) | 7 | [example](https://github.com/exercism/python/blob/main/exercises/practice/paasio/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/paasio/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1917) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1906) | | | | | |
+| [Palindrome Products](https://github.com/exercism/python/blob/main/exercises/practice/palindrome-products/.docs/instructions.md) | 4 | [example](https://github.com/exercism/python/blob/main/exercises/practice/palindrome-products/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/palindrome-products/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L626) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L625) | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/palindrome-products/.approaches/) | [✔](https://github.com/exercism/website-copy/tree/main/tracks/python/exercises/palindrome-products/) | [✔](https://github.com/exercism/python/blob/main/exercises/practice/palindrome-products/.docs/instructions.append.md) | [✔](https://github.com/exercism/python/blob/main/exercises/practice/palindrome-products/.meta/template.j2) |
+| [Pangram](https://github.com/exercism/python/blob/main/exercises/practice/pangram/.docs/instructions.md) | 1 | [example](https://github.com/exercism/python/blob/main/exercises/practice/pangram/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/pangram/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L463) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L462) | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/pangram/.approaches/) | [✔](https://github.com/exercism/website-copy/tree/main/tracks/python/exercises/pangram/) | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/pangram/.meta/template.j2) |
+| [Pascals Triangle](https://github.com/exercism/python/blob/main/exercises/practice/pascals-triangle/.docs/instructions.md) | 4 | [example](https://github.com/exercism/python/blob/main/exercises/practice/pascals-triangle/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/pascals-triangle/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/main/config.json#L1300) | [⚙⚙](https://github.com/exercism/python/blob/main/config.json#L1299) | [✔](https://github.com/exercism/python/blob/main/exercises/practice/pascals-triangle/.docs/hints.md) | ✔ | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/pascals-triangle/.docs/instructions.append.md) | [✔](https://github.com/exercism/python/blob/main/exercises/practice/pascals-triangle/.meta/template.j2) |
+| [Perfect Numbers](https://github.com/exercism/python/blob/main/exercises/practice/perfect-numbers/.docs/instructions.md) | 1 | [example](https://github.com/exercism/python/blob/main/exercises/practice/perfect-numbers/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/perfect-numbers/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L527) | NONE | | ✔ | [✔](https://github.com/exercism/website-copy/tree/main/tracks/python/exercises/perfect-numbers/) | [✔](https://github.com/exercism/python/blob/main/exercises/practice/perfect-numbers/.docs/instructions.append.md) | [✔](https://github.com/exercism/python/blob/main/exercises/practice/perfect-numbers/.meta/template.j2) |
+| [Phone Number](https://github.com/exercism/python/blob/main/exercises/practice/phone-number/.docs/instructions.md) | 2 | [example](https://github.com/exercism/python/blob/main/exercises/practice/phone-number/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/phone-number/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L547) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L542) | | | [✔](https://github.com/exercism/website-copy/tree/main/tracks/python/exercises/phone-numbers/) | [✔](https://github.com/exercism/python/blob/main/exercises/practice/phone-number/.docs/instructions.append.md) | [✔](https://github.com/exercism/python/blob/main/exercises/practice/phone-number/.meta/template.j2) |
+| [Pig Latin](https://github.com/exercism/python/blob/main/exercises/practice/pig-latin/.docs/instructions.md) | 2 | [example](https://github.com/exercism/python/blob/main/exercises/practice/pig-latin/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/pig-latin/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1832) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1831) | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/pig-latin/.approaches/) | | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/pig-latin/.meta/template.j2) |
+| [Poker](https://github.com/exercism/python/blob/main/exercises/practice/poker/.docs/instructions.md) | 3 | [example](https://github.com/exercism/python/blob/main/exercises/practice/poker/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/poker/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1016) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1015) | | | | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/poker/.meta/template.j2) |
+| [Pov](https://github.com/exercism/python/blob/main/exercises/practice/pov/.docs/instructions.md) | 9 | [example](https://github.com/exercism/python/blob/main/exercises/practice/pov/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/pov/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1677) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1676) | | | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/pov/.docs/instructions.append.md) | [✔](https://github.com/exercism/python/blob/main/exercises/practice/pov/.meta/template.j2) |
+| [Prime Factors](https://github.com/exercism/python/blob/main/exercises/practice/prime-factors/.docs/instructions.md) | 2 | [example](https://github.com/exercism/python/blob/main/exercises/practice/prime-factors/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/prime-factors/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L686) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L685) | | | | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/prime-factors/.meta/template.j2) |
+| [Protein Translation](https://github.com/exercism/python/blob/main/exercises/practice/protein-translation/.docs/instructions.md) | 2 | [example](https://github.com/exercism/python/blob/main/exercises/practice/protein-translation/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/protein-translation/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L496) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L495) | | ✔ | | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/protein-translation/.meta/template.j2) |
+| [Proverb](https://github.com/exercism/python/blob/main/exercises/practice/proverb/.docs/instructions.md) | 2 | [example](https://github.com/exercism/python/blob/main/exercises/practice/proverb/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/proverb/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/main/config.json#LC661) | [⚙⚙](https://github.com/exercism/python/blob/main/config.json#L661) | | ✔ | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/proverb/.docs/instructions.append.md) | [✔](https://github.com/exercism/python/blob/main/exercises/practice/proverb/.meta/template.j2) |
+| [Pythagorean Triplet](https://github.com/exercism/python/blob/main/exercises/practice/pythagorean-triplet/.docs/instructions.md) | 3 | [example](https://github.com/exercism/python/blob/main/exercises/practice/pythagorean-triplet/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/pythagorean-triplet/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L745) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L744) | | | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/pythagorean-triplet/.docs/instructions.append.md) | [✔](https://github.com/exercism/python/blob/main/exercises/practice/pythagorean-triplet/.meta/template.j2) |
+| [Queen Attack](https://github.com/exercism/python/blob/main/exercises/practice/queen-attack/.docs/instructions.md) | 2 | [example](https://github.com/exercism/python/blob/main/exercises/practice/queen-attack/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/queen-attack/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1302) | NONE | | | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/queen-attack/.docs/instructions.append.md) | [✔](https://github.com/exercism/python/blob/main/exercises/practice/queen-attack/.meta/template.j2) |
+| [Rail Fence Cipher](https://github.com/exercism/python/blob/main/exercises/practice/rail-fence-cipher/.docs/instructions.md) | 4 | [example](https://github.com/exercism/python/blob/main/exercises/practice/rail-fence-cipher/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/rail-fence-cipher/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1849) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1848) | | | | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/rail-fence-cipher/.meta/template.j2) |
+| [Raindrops](https://github.com/exercism/python/blob/main/exercises/practice/raindrops/.docs/instructions.md) | 1 | [example](https://github.com/exercism/python/blob/main/exercises/practice/raindrops/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/raindrops/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L210) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L209) | | ✔ | [✔](https://github.com/exercism/website-copy/tree/main/tracks/python/exercises/raindrops/) | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/raindrops/.meta/template.j2) |
+| [Rational Numbers](https://github.com/exercism/python/blob/main/exercises/practice/rational-numbers/.docs/instructions.md) | 5 | [example](https://github.com/exercism/python/blob/main/exercises/practice/rational-numbers/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/rational-numbers/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L2240) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L2239) | | | | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/rational-numbers/.meta/template.j2) |
+| [React](https://github.com/exercism/python/blob/main/exercises/practice/react/.docs/instructions.md) | 6 | [example](https://github.com/exercism/python/blob/main/exercises/practice/react/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/react/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L890) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L884) | | | | | |
+| [Rectangles](https://github.com/exercism/python/blob/main/exercises/practice/rectangles/.docs/instructions.md) | 3 | [example](https://github.com/exercism/python/blob/main/exercises/practice/rectangles/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/rectangles/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1032) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1031) | | | | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/rectangles/.meta/template.j2) |
+| [Resistor Color Trio](https://github.com/exercism/python/blob/main/exercises/practice/resistor-color-trio/.docs/instructions.md) | 2 | [example](https://github.com/exercism/python/blob/main/exercises/practice/resistor-color-trio/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/resistor-color-trio/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/main/config.json#LC631) | [⚙⚙](https://github.com/exercism/python/blob/main/config.json#L631) | | ✔ | | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/resistor-color-trio/.meta/template.j2) |
+| [Resistor Color Duo](https://github.com/exercism/python/blob/main/exercises/practice/resistor-color-duo/.docs/instructions.md) | 1 | [example](https://github.com/exercism/python/blob/main/exercises/practice/resistor-color-duo/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/resistor-color-duo/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L2119) | NONE | | ✔ | | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/resistor-color-duo/.meta/template.j2) |
+| [Resistor Color](https://github.com/exercism/python/blob/main/exercises/practice/resistor-color/.docs/instructions.md) | 1 | [example](https://github.com/exercism/python/blob/main/exercises/practice/resistor-color/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/resistor-color/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L2111) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L2110) | | | | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/resistor-color/.meta/template.j2) |
+| [Rest Api](https://github.com/exercism/python/blob/main/exercises/practice/rest-api/.docs/instructions.md) | 8 | [example](https://github.com/exercism/python/blob/main/exercises/practice/rest-api/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/rest-api/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1795) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1787) | | | | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/rest-api/.meta/template.j2) |
+| [Reverse String](https://github.com/exercism/python/blob/main/exercises/practice/reverse-string/.docs/instructions.md) | 1 | [example](https://github.com/exercism/python/blob/main/exercises/practice/reverse-string/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/reverse-string/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L2133) | NONE | | ✔ | [✔](https://github.com/exercism/website-copy/tree/main/tracks/python/exercises/reverse-string/) | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/reverse-string/.meta/template.j2) |
+| [Rna Transcription](https://github.com/exercism/python/blob/main/exercises/practice/rna-transcription/.docs/instructions.md) | 1 | [example](https://github.com/exercism/python/blob/main/exercises/practice/rna-transcription/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/rna-transcription/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L2149) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L2148) | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/rna-transcription/.approaches/) | [✔](https://github.com/exercism/website-copy/tree/main/tracks/python/exercises/rna-transcription/) | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/rna-transcription/.meta/template.j2) |
+| [Robot Name](https://github.com/exercism/python/blob/main/exercises/practice/robot-name/.docs/instructions.md) | 2 | [example](https://github.com/exercism/python/blob/main/exercises/practice/robot-name/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/robot-name/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L479) | NONE | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/robot-name/.approaches/) | [✔](https://github.com/exercism/website-copy/tree/main/tracks/python/exercises/robot-name/) | | |
+| [Robot Simulator](https://github.com/exercism/python/blob/main/exercises/practice/robot-simulator/.docs/instructions.md) | 3 | [example](https://github.com/exercism/python/blob/main/exercises/practice/robot-simulator/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/robot-simulator/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1324) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1315) | | | | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/robot-simulator/.meta/template.j2) |
+| [Roman Numerals](https://github.com/exercism/python/blob/main/exercises/practice/roman-numerals/.docs/instructions.md) | 2 | [example](https://github.com/exercism/python/blob/main/exercises/practice/roman-numerals/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/roman-numerals/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1340) | NONE | | | | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/roman-numerals/.meta/template.j2) |
+| [Rotational Cipher](https://github.com/exercism/python/blob/main/exercises/practice/rotational-cipher/.docs/instructions.md) | 1 | [example](https://github.com/exercism/python/blob/main/exercises/practice/rotational-cipher/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/rotational-cipher/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1209) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1208) | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/rotational-cipher/.approaches/) | | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/rotational-cipher/.meta/template.j2) |
+| [Run Length Encoding](https://github.com/exercism/python/blob/main/exercises/practice/run-length-encoding/.docs/instructions.md) | 2 | [example](https://github.com/exercism/python/blob/main/exercises/practice/run-length-encoding/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/run-length-encoding/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1493) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1492) | | ✔ | | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/run-length-encoding/.meta/template.j2) |
+| [Saddle Points](https://github.com/exercism/python/blob/main/exercises/practice/saddle-points/.docs/instructions.md) | 3 | [example](https://github.com/exercism/python/blob/main/exercises/practice/saddle-points/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/saddle-points/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L649) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L643) | | ✔ | [✔](https://github.com/exercism/website-copy/tree/main/tracks/python/exercises/saddle-points/) | [✔](https://github.com/exercism/python/blob/main/exercises/practice/saddle-points/.docs/instructions.append.md) | [✔](https://github.com/exercism/python/blob/main/exercises/practice/saddle-points/.meta/template.j2) |
+| [Satellite](https://github.com/exercism/python/blob/main/exercises/practice/satellite/.docs/instructions.md) | 7 | [example](https://github.com/exercism/python/blob/main/exercises/practice/satellite/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/satellite/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1640) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1634) | | | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/satellite/.docs/instructions.append.md) | [✔](https://github.com/exercism/python/blob/main/exercises/practice/satellite/.meta/template.j2) |
+| [Say](https://github.com/exercism/python/blob/main/exercises/practice/say/.docs/instructions.md) | 2 | [example](https://github.com/exercism/python/blob/main/exercises/practice/say/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/say/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1052) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1051) | | ✔ | | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/say/.meta/template.j2) |
+| [Scale Generator](https://github.com/exercism/python/blob/main/exercises/practice/scale-generator/.docs/instructions.md) | 4 | [example](https://github.com/exercism/python/blob/main/exercises/practice/scale-generator/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/scale-generator/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1084) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1083) | | | | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/scale-generator/.meta/template.j2) |
+| [Scrabble Score](https://github.com/exercism/python/blob/main/exercises/practice/scrabble-score/.docs/instructions.md) | 2 | [example](https://github.com/exercism/python/blob/main/exercises/practice/scrabble-score/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/scrabble-score/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L316) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L315) | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/scrabble-score/.approaches/) | [✔](https://github.com/exercism/website-copy/tree/main/tracks/python/exercises/scrabble-score/) | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/scrabble-score/.meta/template.j2) |
+| [Secret Handshake](https://github.com/exercism/python/blob/main/exercises/practice/secret-handshake/.docs/instructions.md) | 1 | [example](https://github.com/exercism/python/blob/main/exercises/practice/secret-handshake/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/secret-handshake/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L924) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L923) | | ✔ | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/secret-handshake/.docs/instructions.append.md) | [✔](https://github.com/exercism/python/blob/main/exercises/practice/secret-handshake/.meta/template.j2) |
+| [Series](https://github.com/exercism/python/blob/main/exercises/practice/series/.docs/instructions.md) | 2 | [example](https://github.com/exercism/python/blob/main/exercises/practice/series/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/series/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L562) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L561) | | ✔ | [✔](https://github.com/exercism/website-copy/tree/main/tracks/python/exercises/series/) | [✔](https://github.com/exercism/python/blob/main/exercises/practice/series/.docs/instructions.append.md) | [✔](https://github.com/exercism/python/blob/main/exercises/practice/series/.meta/template.j2) |
+| [Sgf Parsing](https://github.com/exercism/python/blob/main/exercises/practice/sgf-parsing/.docs/instructions.md) | 7 | [example](https://github.com/exercism/python/blob/main/exercises/practice/sgf-parsing/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/sgf-parsing/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L2261) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L2255) | | | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/sgf-parsing/.docs/instructions.append.md) | [✔](https://github.com/exercism/python/blob/main/exercises/practice/sgf-parsing/.meta/template.j2) |
+| [Sieve](https://github.com/exercism/python/blob/main/exercises/practice/sieve/.docs/instructions.md) | 3 | [example](https://github.com/exercism/python/blob/main/exercises/practice/sieve/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/sieve/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L836) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L835) | | | | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/sieve/.meta/template.j2) |
+| [Simple Cipher](https://github.com/exercism/python/blob/main/exercises/practice/simple-cipher/.docs/instructions.md) | 3 | [example](https://github.com/exercism/python/blob/main/exercises/practice/simple-cipher/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/simple-cipher/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L761) | NONE | | | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/simple-cipher/.docs/instructions.append.md) | [✔](https://github.com/exercism/python/blob/main/exercises/practice/simple-cipher/.meta/template.j2) |
+| [Simple Linked List](https://github.com/exercism/python/blob/main/exercises/practice/simple-linked-list/.docs/instructions.md) | 3 | [example](https://github.com/exercism/python/blob/main/exercises/practice/simple-linked-list/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/simple-linked-list/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1357) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1356) | [✔](https://github.com/exercism/python/blob/main/exercises/practice/simple-linked-list/.docs/hints.md) | | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/simple-linked-list/.docs/instructions.append.md) | |
+| [Space Age](https://github.com/exercism/python/blob/main/exercises/practice/space-age/.docs/instructions.md) | 1 | [example](https://github.com/exercism/python/blob/main/exercises/practice/space-age/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/space-age/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L2164) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L2163) | | ✔ | [✔](https://github.com/exercism/website-copy/tree/main/tracks/python/exercises/space-age/) | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/space-age/.meta/template.j2) |
+| [Spiral Matrix](https://github.com/exercism/python/blob/main/exercises/practice/spiral-matrix/.docs/instructions.md) | 4 | [example](https://github.com/exercism/python/blob/main/exercises/practice/spiral-matrix/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/spiral-matrix/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1714) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1713) | | | | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/spiral-matrix/.meta/template.j2) |
+| [Spiral Matrix](https://github.com/exercism/python/blob/main/exercises/practice/square-root/.docs/instructions.md) | 2 | [example](https://github.com/exercism/python/blob/main/exercises/practice/square-root/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/square-root/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/main/config.json#L609) | [⚙⚙](https://github.com/exercism/python/blob/main/config.json#L608) | | | | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/square-root/.meta/template.j2) |
+| [Sublist](https://github.com/exercism/python/blob/main/exercises/practice/sublist/.docs/instructions.md) | 2 | [example](https://github.com/exercism/python/blob/main/exercises/practice/sublist/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/sublist/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1141) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1140) | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/sublist/.approaches/) | | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/sublist/.meta/template.j2) |
+| [Sum Of Multiples](https://github.com/exercism/python/blob/main/exercises/practice/sum-of-multiples/.docs/instructions.md) | 1 | [example](https://github.com/exercism/python/blob/main/exercises/practice/sum-of-multiples/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/sum-of-multiples/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L778) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L777) | | ✔ | [✔](https://github.com/exercism/website-copy/tree/main/tracks/python/exercises/sum-of-multiples/) | [✔](https://github.com/exercism/python/blob/main/exercises/practice/sum-of-multiples/.docs/instructions.append.md) | [✔](https://github.com/exercism/python/blob/main/exercises/practice/sum-of-multiples/.meta/template.j2) |
+| [Tournament](https://github.com/exercism/python/blob/main/exercises/practice/tournament/.docs/instructions.md) | 4 | [example](https://github.com/exercism/python/blob/main/exercises/practice/tournament/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/tournament/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L421) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L409) | | | | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/tournament/.meta/template.j2) |
+| [Transpose](https://github.com/exercism/python/blob/main/exercises/practice/transpose/.docs/instructions.md) | 2 | [example](https://github.com/exercism/python/blob/main/exercises/practice/transpose/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/transpose/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1511) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1510) | | | | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/transpose/.meta/template.j2) |
+| [Tree Building](https://github.com/exercism/python/blob/main/exercises/practice/tree-building/.docs/instructions.md) | 3 | [example](https://github.com/exercism/python/blob/main/exercises/practice/tree-building/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/tree-building/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L852) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L851) | | | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/tree-building/.docs/instructions.append.md) | |
+| [Triangle](https://github.com/exercism/python/blob/main/exercises/practice/triangle/.docs/instructions.md) | 1 | [example](https://github.com/exercism/python/blob/main/exercises/practice/triangle/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/triangle/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L664) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L663) | | ✔ | [✔](https://github.com/exercism/website-copy/tree/main/tracks/python/exercises/triangle/) | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/triangle/.meta/template.j2) |
+| [Twelve Days](https://github.com/exercism/python/blob/main/exercises/practice/twelve-days/.docs/instructions.md) | 2 | [example](https://github.com/exercism/python/blob/main/exercises/practice/twelve-days/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/twelve-days/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L281) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L280) | [✔](https://github.com/exercism/python/blob/main/exercises/practice/twelve-days/.docs/hints.md) | | [✔](https://github.com/exercism/website-copy/tree/main/tracks/python/exercises/twelve-days/) | [✔](https://github.com/exercism/python/blob/main/exercises/practice/twelve-days/.docs/instructions.append.md) | [✔](https://github.com/exercism/python/blob/main/exercises/practice/twelve-days/.meta/template.j2) |
+| [Two Bucket](https://github.com/exercism/python/blob/main/exercises/practice/two-bucket/.docs/instructions.md) | 6 | [example](https://github.com/exercism/python/blob/main/exercises/practice/two-bucket/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/two-bucket/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1244) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1243) | | | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/two-bucket/.docs/instructions.append.md) | [✔](https://github.com/exercism/python/blob/main/exercises/practice/two-bucket/.meta/template.j2) |
+| [Two Fer](https://github.com/exercism/python/blob/main/exercises/practice/two-fer/.docs/instructions.md) | 1 | [example](https://github.com/exercism/python/blob/main/exercises/practice/two-fer/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/two-fer/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L202) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L201) | | | [✔](https://github.com/exercism/website-copy/tree/main/tracks/python/exercises/two-fer/) | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/two-fer/.meta/template.j2) |
+| [Variable Length Quantity](https://github.com/exercism/python/blob/main/exercises/practice/variable-length-quantity/.docs/instructions.md) | 4 | [example](https://github.com/exercism/python/blob/main/exercises/practice/variable-length-quantity/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/variable-length-quantity/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1226) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1225) | | | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/variable-length-quantity/.docs/instructions.append.md) | [✔](https://github.com/exercism/python/blob/main/exercises/practice/variable-length-quantity/.meta/template.j2) |
+| [Word Count](https://github.com/exercism/python/blob/main/exercises/practice/word-count/.docs/instructions.md) | 2 | [example](https://github.com/exercism/python/blob/main/exercises/practice/word-count/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/word-count/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L302) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L296) | [✔](https://github.com/exercism/python/blob/main/exercises/practice/word-count/.docs/hints.md) | ✔ | [✔](https://github.com/exercism/website-copy/tree/main/tracks/python/exercises/word-count/) | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/word-count/.meta/template.j2) |
+| [Word Search](https://github.com/exercism/python/blob/main/exercises/practice/word-search/.docs/instructions.md) | 6 | [example](https://github.com/exercism/python/blob/main/exercises/practice/word-search/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/word-search/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1616) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1606) | | | | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/word-search/.meta/template.j2) |
+| [Wordy](https://github.com/exercism/python/blob/main/exercises/practice/wordy/.docs/instructions.md) | 1 | [example](https://github.com/exercism/python/blob/main/exercises/practice/wordy/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/wordy/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1069) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1068) | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/wordy/.approaches/) | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/wordy/.docs/instructions.append.md) | [✔](https://github.com/exercism/python/blob/main/exercises/practice/wordy/.meta/template.j2) |
+| [Yacht](https://github.com/exercism/python/blob/main/exercises/practice/yacht/.docs/instructions.md) | 2 | [example](https://github.com/exercism/python/blob/main/exercises/practice/yacht/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/yacht/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L2180) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L2179) | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/yacht/.approaches/) | | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/yacht/.meta/template.j2) |
+| [Zebra Puzzle](https://github.com/exercism/python/blob/main/exercises/practice/zebra-puzzle/.docs/instructions.md) | 5 | [example](https://github.com/exercism/python/blob/main/exercises/practice/zebra-puzzle/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/zebra-puzzle/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1866) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1865) | | | | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/zebra-puzzle/.meta/template.j2) |
+| [Zipper](https://github.com/exercism/python/blob/main/exercises/practice/zipper/.docs/instructions.md) | 6 | [example](https://github.com/exercism/python/blob/main/exercises/practice/zipper/.meta/example.py)┋[most⭐](https://exercism.io/tracks/python/exercises/zipper/solutions?passed_head_tests=true) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1659) | [⚙⚙](https://github.com/exercism/python/blob/64396fd483c6c6770c1313b71cb4d972e5ab9819/config.json#L1658) | | | | | [✔](https://github.com/exercism/python/blob/main/exercises/practice/zipper/.meta/template.j2) |
@@ -138,17 +140,17 @@
| Exercise | Difficulty |
| -------------------------------------------------------------------------------------------------------------------------------------------- | ---------- |
-| [Accumulate](https://github.com/exercism/python/blob/main/exercises/practice/accumulate/.docs/instructions.md) | 🔹🔹 |
-| [Beer Song](https://github.com/exercism/python/blob/main/exercises/practice/beer-song/.docs/instructions.md) | 🔹🔹🔹 |
-| [Binary](https://github.com/exercism/python/blob/main/exercises/practice/binary/.docs/instructions.md) | 🔹🔹🔹 |
-| [Error Handling](https://github.com/exercism/python/blob/main/exercises/practice/error-handling/.docs/instructions.md) | 🔹🔹🔹 |
-| [Hexadecimal](https://github.com/exercism/python/blob/main/exercises/practice/hexadecimal/.docs/instructions.md) | 🔹🔹🔹 |
-| [Nucleotide Count](https://github.com/exercism/python/blob/main/exercises/practice/nucleotide-count/.docs/instructions.md) | 🔹🔹 |
-| [Parallel Letter Frequency](https://github.com/exercism/python/blob/main/exercises/practice/parallel-letter-frequency/.docs/instructions.md) | 🔹🔹🔹 |
-| [Pascal's Triangle](https://github.com/exercism/python/blob/main/exercises/practice/pascals-triangle/.docs/instructions.md) | 🔹🔹🔹 |
-| [Point Mutations](https://github.com/exercism/python/blob/main/exercises/practice/point-mutations/.docs/instructions.md) | 🔹🔹🔹 |
-| [Trinary](https://github.com/exercism/python/blob/main/exercises/practice/trinary/.docs/instructions.md) | 🔹🔹🔹🔹 |
-| [Custom Set](https://github.com/exercism/python/blob/main/exercises/practice/custom-set/.docs/instructions.md) | 🔹🔹🔹🔹🔹 |
+| [Accumulate](https://github.com/exercism/python/blob/main/exercises/practice/accumulate/.docs/instructions.md) | 2 |
+| [Beer Song](https://github.com/exercism/python/blob/main/exercises/practice/beer-song/.docs/instructions.md) | 3 |
+| [Binary](https://github.com/exercism/python/blob/main/exercises/practice/binary/.docs/instructions.md) |3 |
+| [Diffie-Hellman](https://github.com/exercism/python/blob/main/exercises/practice/diffie-hellman/.docs/instructions.md) |3 |
+| [Error Handling](https://github.com/exercism/python/blob/main/exercises/practice/error-handling/.docs/instructions.md) | 3 |
+| [Hexadecimal](https://github.com/exercism/python/blob/main/exercises/practice/hexadecimal/.docs/instructions.md) | 3 |
+| [Nucleotide Count](https://github.com/exercism/python/blob/main/exercises/practice/nucleotide-count/.docs/instructions.md) | 2 |
+| [Parallel Letter Frequency](https://github.com/exercism/python/blob/main/exercises/practice/parallel-letter-frequency/.docs/instructions.md) | 3 |
+| [Point Mutations](https://github.com/exercism/python/blob/main/exercises/practice/point-mutations/.docs/instructions.md) |3 |
+| [Trinary](https://github.com/exercism/python/blob/main/exercises/practice/trinary/.docs/instructions.md) | 4 |
+| [Custom Set](https://github.com/exercism/python/blob/main/exercises/practice/custom-set/.docs/instructions.md) | 5 |
@@ -198,99 +200,125 @@
-| Status | Concept | About&Intro | Exercise | Design Doc or Issue | Stub
Docstring Level |
-| :--------------------------------------------: | :--------------------------------------------------------------------------------------------------------------------------- | :--------------------------------------------: | :---------------------------------------------------------------------------------------------------------------------------- | :--------------------------------------------------------------------------------------------------------------- | :---------------------- |
-| 
| [basics](https://github.com/exercism/python/blob/main/concepts/basics) | | [Guidos Gorgeous Lasagna](https://github.com/exercism/python/tree/main/tree/main/exercises/concept/guidos-gorgeous-lasagna) | [`.meta`folder](https://github.com/exercism/python/tree/main/exercises/concept/guidos-gorgeous-lasagna/.meta) | Full |
-| | [bools](https://github.com/exercism/python/blob/main/concepts/bools) | | [Ghost Gobble Arcade Game](https://github.com/exercism/python/tree/main/tree/main/exercises/concept/ghost-gobble-arcade-game) | [`.meta`folder](https://github.com/exercism/python/tree/main/exercises/concept/ghost-gobble-arcade-game/.meta) | Full |
-| | [numbers](https://github.com/exercism/python/blob/main/concepts/numbers) | | [Currency Exchange](https://github.com/exercism/python/tree/main/exercises/concept/currency-exchange) | [`.meta`folder](https://github.com/exercism/python/tree/main/exercises/concept/currency-exchange/.meta) | Full |
-| 
| [complex-numbers](https://github.com/exercism/python/blob/main/concepts/complex-numbers) | | ~ | [#2208](https://github.com/exercism/v3/issues/2208) | TBD |
-| | [conditionals](https://github.com/exercism/python/blob/main/concepts/conditionals) | | [Meltdown Mitigation ](https://github.com/exercism/python/tree/main/exercises/concept/meltdown-mitigation) | [`.meta`folder](https://github.com/exercism/python/tree/main/exercises/concept/meltdown-mitigation/.meta) | Full |
-| | [comparisons](https://github.com/exercism/python/blob/main/concepts/comparisons) | | [Black Jack](https://github.com/exercism/python/tree/main/exercises/concept/black-jack) | [`.meta`folder](https://github.com/exercism/python/tree/main/exercises/concept/black-jack/.meta) | Full |
-| | [strings](https://github.com/exercism/python/blob/main/concepts/strings) | | [Litte Sister's Vocab](https://github.com/exercism/python/tree/main/exercises/concept/little-sisters-vocab) | [`.meta`folder](https://github.com/exercism/python/tree/main/exercises/concept/little-sisters-vocab/.meta) | Full |
-| | [string-methods](https://github.com/exercism/python/blob/main/concepts/string-methods) | | [Litte Sister's Essay](https://github.com/exercism/python/tree/main/exercises/concept/little-sisters-essay) | [`.meta`folder](https://github.com/exercism/python/tree/main/exercises/concept/little-sisters-essay/.meta) | Full |
-| 
| [string-formatting](https://github.com/exercism/python/blob/main/concepts/string-formatting) | | [Pretty Leaflet ](https://github.com/exercism/python/tree/main/exercises/concept/pretty-leaflet) | [`.meta`folder](https://github.com/exercism/python/tree/main/exercises/concept/pretty-leaflet/.meta) | Full |
-| | [lists](https://github.com/exercism/python/blob/main/concepts/lists) | | [Card Games](https://github.com/exercism/python/tree/main/exercises/concept/card-games) | [`.meta`folder](https://github.com/exercism/python/tree/main/exercises/concept/card-games/.meta) | Full |
-| | [list-methods](https://github.com/exercism/python/blob/main/concepts/list-methods) | | [Chaitanas Colossal Coaster](https://github.com/exercism/python/tree/main/exercises/concept/chaitanas-colossal-coaster) | [`.meta`folder](https://github.com/exercism/python/tree/main/exercises/concept/chaitanas-colossal-coaster/.meta) | Full |
-| | [loops](https://github.com/exercism/python/blob/main/concepts/loops) | | [Making the Grade](https://github.com/exercism/python/tree/main/exercises/concept/making-the-grade) | [`.meta`folder](https://github.com/exercism/python/tree/main/exercises/concept/making-the-grade/.meta) | Full |
-| | [tuples](https://github.com/exercism/python/blob/main/concepts/tuples) | | [Tisbury Treasure Hunt](https://github.com/exercism/python/tree/main/exercises/concept/tisbury-treasure-hunt) | [`.meta`folder](https://github.com/exercism/python/tree/main/exercises/concept/tisbury-treasure-hunt/.meta) | Full |
-| | [sequences](https://github.com/exercism/python/blob/main/concepts/sequences) | | ~ | [#2290](https://github.com/exercism/python/issues/2290) | TBD |
-| | [dicts](https://github.com/exercism/python/blob/main/concepts/dicts) | | [Inventory Management](https://github.com/exercism/python/tree/main/exercises/concept/inventory-management) | [`.meta`folder](https://github.com/exercism/python/tree/main/exercises/concept/inventory-management) | Full |
-| | [dict-methods](https://github.com/exercism/python/blob/main/concepts/dict-methods) | | ~ | [#2348](https://github.com/exercism/python/issues/2348) | |
-| | [sets](https://github.com/exercism/python/blob/main/concepts/sets) | | [Cater Waiter ](https://github.com/exercism/python/tree/main/exercises/concept/cater-waiter) | [`.meta`folder](https://github.com/exercism/python/tree/main/exercises/concept/cater-waiter/.meta) | Full |
-| | [list-comprehensions](https://github.com/exercism/python/blob/main/concepts/list-comprehensions) | | ~ | [#2295](https://github.com/exercism/python/issues/2295) | |
-| | [other-comprehensions](https://github.com/exercism/python/blob/main/concepts/other-comprehensions) | | ~ | [#2294](https://github.com/exercism/python/issues/2294) | |
-| | [classes](https://github.com/exercism/python/blob/main/concepts/classes) | | [Ellen's Alien Game](https://github.com/exercism/python/tree/main/exercises/concept/ellens-alien-game) | [`.meta`folder](https://github.com/exercism/python/tree/main/exercises/concept/ellens-alien-game/.meta) | Minimal |
-| | [generators](https://github.com/exercism/python/blob/main/concepts/generators) | | Plane Tickets | [PR#2729](https://github.com/exercism/python/pull/2729)/[#2293](https://github.com/exercism/python/issues/2293) | Minimal |
-| | [generator-expressions](https://github.com/exercism/python/blob/main/concepts/generator-expressions) | | ~ | [#2292](https://github.com/exercism/python/issues/2292) | |
-| | [iterators](https://github.com/exercism/python/blob/main/concepts/iterators) | | ~ | [#2367](https://github.com/exercism/python/issues/2367) | TBD |
-| | [functions](https://github.com/exercism/python/blob/main/concepts/functions) | | ~ | [#2353](https://github.com/exercism/python/issues/2353) | |
-| | [unpacking-and-multiple-assignment](https://github.com/exercism/python/blob/main/concepts/unpacking-and-multiple-assignment) | | ~ | [#2360](https://github.com/exercism/python/issues/2360) | |
-| | [raising-and-handling-errors](https://github.com/exercism/python/blob/main/concepts/raising-and-handling-errors) | | ~ | TBD | |
-| | [itertools](https://github.com/exercism/python/blob/main/concepts/itertools) | | ~ | [#2368](https://github.com/exercism/python/issues/2368) | |
-| | [with-statement](https://github.com/exercism/python/blob/main/concepts/with-statement) | | ~ | [#2369](https://github.com/exercism/python/issues/2369) | |
-| | [enums](https://github.com/exercism/python/blob/main/concepts/enums) | | [Log Levels](https://github.com/exercism/python/tree/main/exercises/concept/log-levels) | [`.meta`folder](https://github.com/exercism/python/tree/main/exercises/concept/log-levels) | Minimal |
-| | [none](https://github.com/exercism/python/blob/main/concepts/none) | | [Restaurant Rozalynn](https://github.com/exercism/python/tree/main/exercises/concept/restaurant-rozalynn) | [`.meta`folder](https://github.com/exercism/python/tree/main/exercises/concept/restaurant-rozalynn/.meta) | Minimal |
-| | [decorators](https://github.com/exercism/python/blob/main/concepts/decorators) | | ~ | [#2356](https://github.com/exercism/python/issues/2356) | |
-| | [rich-comparisons](https://github.com/exercism/python/blob/main/concepts/rich-comparisons) | | ~ | [#2287](https://github.com/exercism/python/issues/2287) | |
-| | [function-arguments](https://github.com/exercism/python/blob/main/concepts/function-arguments) | | ~ | [#2354](https://github.com/exercism/python/issues/2354) | |
-| | [class-customization](https://github.com/exercism/python/blob/main/concepts/class-customization) | | ~ | [#2350](https://github.com/exercism/python/issues/2350) | |
-| | [class-inheritance](https://github.com/exercism/python/blob/main/concepts/class-inheritance) | | ~ | [#2351](https://github.com/exercism/python/issues/2351) | |
-| | [user-defined-errors](https://github.com/exercism/python/blob/main/concepts/user-defined-errors) | | ~ | TBD | |
-| | [context-manager-customization](https://github.com/exercism/python/blob/main/concepts/context-manager-customization) | | ~ | [#2370](https://github.com/exercism/python/issues/2370) | |
-| | [higher-order-functions](https://github.com/exercism/python/blob/main/concepts/higher-order-functions) | | ~ | [#2355](https://github.com/exercism/python/issues/2355) | |
-| | [functional-tools](https://github.com/exercism/python/blob/main/concepts/functional-tools) | | ~ | [#2359](https://github.com/exercism/python/issues/2359) | |
-| | [functools](https://github.com/exercism/python/blob/main/concepts/functools) | | ~ | [#2366](https://github.com/exercism/python/issues/2366) | |
-| | [anonymous-functions](https://github.com/exercism/python/blob/main/concepts) | | ~ | [#2357](https://github.com/exercism/python/issues/2357) | |
-| | [descriptors](https://github.com/exercism/python/blob/main/concepts/descriptors) | | ~ | [#2365](https://github.com/exercism/python/issues/2365) | |
-| 
| [aliasing](https://github.com/exercism/python/blob/main/concepts) | | ~ | TBD | |
-| | [binary data](https://github.com/exercism/python/blob/main/concepts/binary-data) | | ~ | TBD | |
-| | [bitflags](https://github.com/exercism/python/blob/main/concepts/bitflags) | | ~ | TBD | |
-| | [bitwise-operators](https://github.com/exercism/python/blob/main/concepts/bitwise-operators) | | ~ | TBD | |
-| | [bytes](https://github.com/exercism/python/blob/main/concepts/bytes) | | ~ | TBD | |
-| | [class-composition](https://github.com/exercism/python/blob/main/concepts/class-composition) | | ~ | [#2352](https://github.com/exercism/python/issues/2352) | |
-| | [class-interfaces](https://github.com/exercism/python/blob/main/concepts/class-interfaces) | | ~ | TBD | |
-| | [collections](https://github.com/exercism/python/blob/main/concepts/collections) | | ~ | TBD | |
-| | [dataclasses-and-namedtuples](https://github.com/exercism/python/blob/main/concepts/dataclasses-and-namedtuples) | | ~ | [#2361](https://github.com/exercism/python/issues/2361) | |
-| | [import](https://github.com/exercism/python/blob/main/concepts/import) | | ~ | ON HOLD | |
-| | [memoryview](https://github.com/exercism/python/blob/main/concepts/memoryview) | | ~ | TBD | |
-| | [operator-overloading](https://github.com/exercism/python/blob/main/concepts/operator-overloading) | | ~ | TBD | |
-| | [regular-expressions](https://github.com/exercism/python/blob/main/concepts/regular-expressions) | | ~ | TBD | |
-| | [string-methods-splitting](https://github.com/exercism/python/blob/main/concepts/string-methods-splitting) | | ~ | TBD | |
-| | [testing](https://github.com/exercism/python/blob/main/concepts/testing) | | ~ | TBD | |
-| | [text-processing](https://github.com/exercism/python/blob/main/concepts/text-processing) | | ~ | TBD | |
-| | [type-hinting](https://github.com/exercism/python/blob/main/concepts/type-hinting) | | ~ | TBD | |
-| | [unicode-regular-expressions](https://github.com/exercism/python/blob/main/concepts/unicode-regular-expressions) | | ~ | TBD | |
-| | [walrus-operator](https://github.com/exercism/python/blob/main/concepts/walrus-operator) | | ~ | TBD | |
+## Implemented & Planned Concept Exercises
+
+ = live on exercism.org
+ = drafted but not live
+ = planned or in progress
+ = future
+
+
+
+| Status | Concept | About&Intro | Exercise | Design Doc or Issue | Stub
Docstring Level |
+| :--------------------------------------------: | :----------------------------------------------------------- | :--------------------------------------------: | :----------------------------------------------------------- | :----------------------------------------------------------- | :---------------------- |
+| | [basics](https://github.com/exercism/python/blob/main/concepts/basics) | | [Guidos Gorgeous Lasagna](https://github.com/exercism/python/tree/main/tree/main/exercises/concept/guidos-gorgeous-lasagna) | [`.meta`folder](https://github.com/exercism/python/tree/main/exercises/concept/guidos-gorgeous-lasagna/.meta) | Full |
+| | [bools](https://github.com/exercism/python/blob/main/concepts/bools) | | [Ghost Gobble Arcade Game](https://github.com/exercism/python/tree/main/tree/main/exercises/concept/ghost-gobble-arcade-game) | [`.meta`folder](https://github.com/exercism/python/tree/main/exercises/concept/ghost-gobble-arcade-game/.meta) | Full |
+| | [numbers](https://github.com/exercism/python/blob/main/concepts/numbers) | | [Currency Exchange](https://github.com/exercism/python/tree/main/exercises/concept/currency-exchange) | [`.meta`folder](https://github.com/exercism/python/tree/main/exercises/concept/currency-exchange/.meta) | Full |
+| | [complex-numbers](https://github.com/exercism/python/blob/main/concepts/complex-numbers) | | ~ | [#2208](https://github.com/exercism/v3/issues/2208) | TBD |
+| | [conditionals](https://github.com/exercism/python/blob/main/concepts/conditionals) | | [Meltdown Mitigation ](https://github.com/exercism/python/tree/main/exercises/concept/meltdown-mitigation) | [`.meta`folder](https://github.com/exercism/python/tree/main/exercises/concept/meltdown-mitigation/.meta) | Full |
+| | [comparisons](https://github.com/exercism/python/blob/main/concepts/comparisons) | | [Black Jack](https://github.com/exercism/python/tree/main/exercises/concept/black-jack) | [`.meta`folder](https://github.com/exercism/python/tree/main/exercises/concept/black-jack/.meta) | Full |
+| | [strings](https://github.com/exercism/python/blob/main/concepts/strings) | | [Litte Sister's Vocab](https://github.com/exercism/python/tree/main/exercises/concept/little-sisters-vocab) | [`.meta`folder](https://github.com/exercism/python/tree/main/exercises/concept/little-sisters-vocab/.meta) | Full |
+| | [string-methods](https://github.com/exercism/python/blob/main/concepts/string-methods) | | [Litte Sister's Essay](https://github.com/exercism/python/tree/main/exercises/concept/little-sisters-essay) | [`.meta`folder](https://github.com/exercism/python/tree/main/exercises/concept/little-sisters-essay/.meta) | Full |
+| | [string-formatting](https://github.com/exercism/python/blob/main/concepts/string-formatting) | | TBD (_rewrite_) | [`.meta`folder](https://github.com/exercism/python/tree/main/exercises/concept/pretty-leaflet/.meta) | Full |
+| | [lists](https://github.com/exercism/python/blob/main/concepts/lists) | | [Card Games](https://github.com/exercism/python/tree/main/exercises/concept/card-games) | [`.meta`folder](https://github.com/exercism/python/tree/main/exercises/concept/card-games/.meta) | Full |
+| | [list-methods](https://github.com/exercism/python/blob/main/concepts/list-methods) | | [Chaitanas Colossal Coaster](https://github.com/exercism/python/tree/main/exercises/concept/chaitanas-colossal-coaster) | [`.meta`folder](https://github.com/exercism/python/tree/main/exercises/concept/chaitanas-colossal-coaster/.meta) | Full |
+| | [loops](https://github.com/exercism/python/blob/main/concepts/loops) | | [Making the Grade](https://github.com/exercism/python/tree/main/exercises/concept/making-the-grade) | [`.meta`folder](https://github.com/exercism/python/tree/main/exercises/concept/making-the-grade/.meta) | Full |
+| | [tuples](https://github.com/exercism/python/blob/main/concepts/tuples) | | [Tisbury Treasure Hunt](https://github.com/exercism/python/tree/main/exercises/concept/tisbury-treasure-hunt) | [`.meta`folder](https://github.com/exercism/python/tree/main/exercises/concept/tisbury-treasure-hunt/.meta) | Full |
+| | [sequences](https://github.com/exercism/python/blob/main/concepts/sequences) | | [Thalias Tram Troubles]() | [#2290](https://github.com/exercism/python/issues/2290) | TBD |
+| | [dicts](https://github.com/exercism/python/blob/main/concepts/dicts) | | [Inventory Management](https://github.com/exercism/python/tree/main/exercises/concept/inventory-management) | [`.meta`folder](https://github.com/exercism/python/tree/main/exercises/concept/inventory-management) | Full |
+| | [dict-methods](https://github.com/exercism/python/blob/main/concepts/dict-methods) | | [Mecha Munch Management](https://github.com/exercism/python/tree/main/exercises/concept/mecha-munch-management) | [.meta folder](https://github.com/exercism/python/tree/main/exercises/concept/mecha-munch-management/.meta) | Full |
+| | [sets](https://github.com/exercism/python/blob/main/concepts/sets) | | [Cater Waiter ](https://github.com/exercism/python/tree/main/exercises/concept/cater-waiter) | [`.meta`folder](https://github.com/exercism/python/tree/main/exercises/concept/cater-waiter/.meta) | Full |
+| | [list-comprehensions](https://github.com/exercism/python/blob/main/concepts/list-comprehensions) | | ~ | [#2295](https://github.com/exercism/python/issues/2295) | |
+| | [other-comprehensions](https://github.com/exercism/python/blob/main/concepts/other-comprehensions) | | ~ | [#2294](https://github.com/exercism/python/issues/2294) | |
+| | [classes](https://github.com/exercism/python/blob/main/concepts/classes) | | [Ellen's Alien Game](https://github.com/exercism/python/tree/main/exercises/concept/ellens-alien-game) | [`.meta`folder](https://github.com/exercism/python/tree/main/exercises/concept/ellens-alien-game/.meta) | Minimal |
+| | [generators](https://github.com/exercism/python/blob/main/concepts/generators) | | [Plane Tickets](https://github.com/exercism/python/tree/main/exercises/concept/plane-tickets) | [.meta folder (WIP)](https://github.com/exercism/python/tree/main/exercises/concept/plane-tickets/.meta) | Minimal |
+| | [generator-expressions](https://github.com/exercism/python/blob/main/concepts/generator-expressions) | | ~ | [#2292](https://github.com/exercism/python/issues/2292) | |
+| | [iterators](https://github.com/exercism/python/blob/main/concepts/iterators) | | ~ | [#2367](https://github.com/exercism/python/issues/2367) | TBD |
+| | [functions](https://github.com/exercism/python/blob/main/concepts/functions) | | ~ | [#2353](https://github.com/exercism/python/issues/2353) | |
+| | [unpacking-and-multiple-assignment](https://github.com/exercism/python/blob/main/concepts/unpacking-and-multiple-assignment) | | [Locomotive Engineer](https://exercism.org/tracks/python/exercises/locomotive-engineer) | [.meta folder](https://github.com/exercism/python/tree/main/exercises/concept/locomotive-engineer/.meta) | Full |
+| | [raising-and-handling-errors](https://github.com/exercism/python/blob/main/concepts/raising-and-handling-errors) | | ~ | TB | |
+| | [itertools](https://github.com/exercism/python/blob/main/concepts/itertools) | | Ice Cream Stand | [#2368](https://github.com/exercism/python/issues/2368) & [PR #3288](https://github.com/exercism/python/pull/3288) | Minimal |
+| | [with-statement](https://github.com/exercism/python/blob/main/concepts/with-statement) | | ~ | [#2369](https://github.com/exercism/python/issues/2369) | |
+| | [enums](https://github.com/exercism/python/blob/main/concepts/enums) | | [Log Levels](https://github.com/exercism/python/tree/main/exercises/concept/log-levels) | [`.meta`folder](https://github.com/exercism/python/tree/main/exercises/concept/log-levels) | Minimal |
+| | [none](https://github.com/exercism/python/blob/main/concepts/none) | | [Restaurant Rozalynn](https://github.com/exercism/python/tree/main/exercises/concept/restaurant-rozalynn) | [`.meta`folder](https://github.com/exercism/python/tree/main/exercises/concept/restaurant-rozalynn/.meta) | Minimal |
+| | [decorators](https://github.com/exercism/python/blob/main/concepts/decorators) | | ~ | [#2356](https://github.com/exercism/python/issues/2356) | |
+| | [rich-comparisons](https://github.com/exercism/python/blob/main/concepts/rich-comparisons) | | ~ | [#2287](https://github.com/exercism/python/issues/2287) | |
+| | [function-arguments](https://github.com/exercism/python/blob/main/concepts/function-arguments) | | ~ | [#2354](https://github.com/exercism/python/issues/2354) | |
+| | [class-customization](https://github.com/exercism/python/blob/main/concepts/class-customization) | | ~ | [#2350](https://github.com/exercism/python/issues/2350) | |
+| | [class-inheritance](https://github.com/exercism/python/blob/main/concepts/class-inheritance) | | ~ | [#2351](https://github.com/exercism/python/issues/2351) | |
+| | [user-defined-errors](https://github.com/exercism/python/blob/main/concepts/user-defined-errors) | | ~ | TBD | |
+| | [context-manager-customization](https://github.com/exercism/python/blob/main/concepts/context-manager-customization) | | ~ | [#2370](https://github.com/exercism/python/issues/2370) | |
+| | [higher-order-functions](https://github.com/exercism/python/blob/main/concepts/higher-order-functions) | | ~ | [#2355](https://github.com/exercism/python/issues/2355) | |
+| | [functional-tools](https://github.com/exercism/python/blob/main/concepts/functional-tools) | | ~ | [#2359](https://github.com/exercism/python/issues/2359) | |
+| | [functools](https://github.com/exercism/python/blob/main/concepts/functools) | | ~ | [#2366](https://github.com/exercism/python/issues/2366) | |
+| | [anonymous-functions](https://github.com/exercism/python/blob/main/concepts) | | ~ | [#2357](https://github.com/exercism/python/issues/2357) | |
+| | [descriptors](https://github.com/exercism/python/blob/main/concepts/descriptors) | | ~ | [#2365](https://github.com/exercism/python/issues/2365) | |
+| | [aliasing](https://github.com/exercism/python/blob/main/concepts) | | ~ | TBD | |
+| | [binary data](https://github.com/exercism/python/blob/main/concepts/binary-data) | | ~ | TBD | |
+| | [bitflags](https://github.com/exercism/python/blob/main/concepts/bitflags) | | ~ | TBD | |
+| | [bitwise-operators](https://github.com/exercism/python/blob/main/concepts/bitwise-operators) | | ~ | TBD | |
+| | [bytes](https://github.com/exercism/python/blob/main/concepts/bytes) | | ~ | TBD | |
+| | [class-composition](https://github.com/exercism/python/blob/main/concepts/class-composition) | | ~ | [#2352](https://github.com/exercism/python/issues/2352) | |
+| | [class-interfaces](https://github.com/exercism/python/blob/main/concepts/class-interfaces) | | ~ | TBD | |
+| | [collections](https://github.com/exercism/python/blob/main/concepts/collections) | | ~ | TBD | |
+| | [dataclasses](https://github.com/exercism/python/blob/main/concepts/dataclasses) | | ~ | [#2361](https://github.com/exercism/python/issues/2361) | |
+| | [import](https://github.com/exercism/python/blob/main/concepts/import) | | ~ | ON HOLD | |
+| | [memoryview](https://github.com/exercism/python/blob/main/concepts/memoryview) | | ~ | TBD | |
+| | [operator-overloading](https://github.com/exercism/python/blob/main/concepts/operator-overloading) | | ~ | TBD | |
+| | [regular-expressions](https://github.com/exercism/python/blob/main/concepts/regular-expressions) | | ~ | TBD | |
+| | [string-methods-splitting](https://github.com/exercism/python/blob/main/concepts/string-methods-splitting) | | ~ | TBD | |
+| | [testing](https://github.com/exercism/python/blob/main/concepts/testing) | | ~ | TBD | |
+| | [text-processing](https://github.com/exercism/python/blob/main/concepts/text-processing) | | ~ | TBD | |
+| | [type-hinting](https://github.com/exercism/python/blob/main/concepts/type-hinting) | | ~ | TBD | |
+| | [unicode-regular-expressions](https://github.com/exercism/python/blob/main/concepts/unicode-regular-expressions) | | ~ | TBD | |
+| | [walrus-operator](https://github.com/exercism/python/blob/main/concepts/walrus-operator) | | ~ | TBD | |
+
## Concept Exercise Tree
```mermaid
flowchart TD
%%{init: {"theme": "base", "themeVariables": { "fontFamily": "Victor Mono, San Francisco, Roboto", "fontSize" : "18px", "primaryColor": "#D9D7FF", "nodeBorder": "#9F80DF", "lineColor": "#AFAC6A"}}}%%
+classDef TBD-F fill:#C4D7FF,stroke:#97ACF5,stroke-width:4px,stroke-dasharray: 5 5, color: #5055C4;
classDef TBD fill:#D9D7FF,stroke:#9F80DF,stroke-width:4px,stroke-dasharray: 5 5, color: #734CC4;
classDef Beta fill:#F5DE90,stroke:#F6B303,stroke-width:2px, color:#525952;
classDef WIP fill:#DEE8BB,stroke:#AFAC6A,stroke-width:4px,stroke-dasharray: 5 5, #908D49;
%%concepts & exercise names (node labels)
+aliasing((TBD-F
aliasing)):::TBD-F
+array((TBD-F
array)):::TBD-F
Basics((Guidos Gorgeous Lasagna
Basics)):::Beta
+binary-data((TBD-F
binary-data>)):::TBD-F
+bitwise-operations((TBD-F
bitwise-
operations)):::TBD-F
bools((Ghost Gobble
Arcade Game
bools)):::Beta
+calendar((TBD-F
calendar)):::TBD-F
classes((Ellen's Alien Game
Classes)):::Beta
Class-customization((TBD
Class Customization)):::TBD
+Class-composition((TBD-F
Class Composition)):::TBD-F
Class-inheritance((TBD
Class Inheritance)):::TBD
Class-interfaces((TBD
Class Interfaces)):::TBD
-conditionals((Meltdown Mitigation
Conditionals)):::Beta
+collections((TBD
Collections Module)):::TBD
comparisons((Black Jack
comparisons)):::Beta
+conditionals((Meltdown Mitigation
Conditionals)):::Beta
+
context-manager-customization((TBD
Context Manager
Customization)):::TBD
+copy((copy
copy)):::TBD-F
+datetime((TBD
datetime)):::TBD
decorators((TBD
Decorators)):::TBD
+decimal((TBD-F
decimal)):::TBD-F
descriptors((TBD
Descriptors)):::TBD
list-comprehensions(("TBD
List Comprehensions")):::TBD
other-comprehensions((TBD
Other Comprehensions)):::TBD
+dataclasses((TBD-F
dataclasses)):::TBD-F
dicts((Inventory
Management
dicts)):::Beta
-dict-methods((TBD
Dict-Methods)):::TBD
+dict-methods((Mecha
Munch Management
Dict-Methods)):::WIP
enums((Log Levels
Enums)):::WIP
-functions((TBD
Functions)):::WIP
+enumerate((TBD
enumerate)):::TBD
+ExceptionGroup((TBD-F
ExceptionGroup)):::TBD-F
+fractions((TBD-F
fractions)):::TBD-F
+functions((Exercise TBD
Functions)):::WIP
function-arguments((TBD
Function Arguments)):::TBD
functional-tools((TBD
Functional Tools)):::TBD
functools((TBD
Functools Module)):::TBD
@@ -298,64 +326,99 @@ generators((Plane Tickets
Generators)):::TBD
generator-expressions((TBD
Generator Expressions)):::TBD
higher-order-functions((TBD
Higher Order
Functions)):::TBD
anonymous-functions((TBD
Anonymous Functions
AKA Lambdas)):::TBD
+imports((TBD-F
imports)):::TBD-F
iterators((TBD
iterators)):::TBD
-itertools((TBD
itertools)):::TBD
+itertools((Ice Cream Stand
itertools)):::WIP
lists((Card Games
lists)):::Beta
list-methods((Chaitana's
Colossal Coaster
list-methods)):::Beta
+logging((TBD-F
Logging)):::TBD-F
loops((Making the Grade
loops)):::Beta
+math((TBD-F
math)):::TBD-F
+cmath((TBD-F
cmath)):::TBD-F
+memoryview((TBD-F
memoryview)):::TBD-F
none((Restaurant Rozalynn
none)):::WIP
numbers(("Currency Exchange
(ints & floats)")):::Beta
-complex-numbers(("TBD (Bowling Game??)
complex-numbers")):::TBD
+complex-numbers(("TBD
(Bowling Game??)
complex-numbers")):::TBD
+binary-octal-hexadecimal(("WIP
Binary, Octal, &
Hexadecimal")):::WIP
+operator-overloading((TBD-F
operator-
overloading)):::TBD-F
raising-and-handling-errors((TBD
Raising &
Handling Errors)):::TBD
+regular-expressions((TBD
Regular Expressions)):::TBD
+unicode-regular-expressions((TBD-F
Unicode Regex)):::TBD-F
+random((TBD-F
random)):::TBD-F
rich-comparisons((TBD
Rich Comparisons)):::TBD
-sequences((TBD
sequences)):::TBD
+statistics((TBD-F
statistics)):::TBD-F
+secrets((TBD-F
secrets)):::TBD-F
+sequences((Thalias
Tram Troubles
sequences)):::WIP
sets((Cater-Waiter
sets)):::Beta
strings((Little Sister's
Vocab
strings)):::Beta
-string-formatting((Pretty Leaflet
String Formatting)):::WIP
+string-formatting(("TBD (rewrite)
String Formatting")):::WIP
string-methods((Little Sister's
Essay
String Methods)):::Beta
-tuples((Tisbury
Treasure Hunt
tuples)):::Beta
-unpacking-and-multiple-assignment((TBD
Unpacking
& Multi-assignment)):::TBD
+structural-pattern-matching((TBD
Structural
Pattern Matching)):::TBD
+tuples((Tisbury Treasure Hunt
tuples)):::Beta
+type-annotation(("TBD-F
Type Annotation
(type hints)")):::TBD-F
+type-aliases((TBD-F
Type Aliases)):::TBD-F
+unicode-data((TBD-F
unicode data)):::TBD-F
+unpacking-and-multiple-assignment((Locomotive Engineer
Unpacking &
Multi-assignment)):::Beta
user-defined-errors((TBD
User Definied Errors)):::TBD
+walrus-operator((TBD-F
Walrus Operator)):::TBD-F
with(("TBD
with
(Context Managers)")):::TBD
+unittest(("TBD-F
unittest
(testing)")):::TBD-F
+doctests(("TBD-F
doctests")):::TBD-F
+zip(("TBD
iterating with zip()")):::TBD
%%exercise prerequisites (node relations)
-Basics --> strings & numbers & bools & loops
-Basics --> functions
-bools --> conditionals
-classes ---> iterators & Class-inheritance & Class-customization
-conditionals --> strings & comparisons & loops
+Basics --> strings & bools
+Basics --> numbers & loops
+binary-data --> memoryview
+bools --> conditionals & bitwise-operations
+classes ---> iterators & dataclasses & Class-inheritance & Class-customization
+Class-customization --> type-annotation & Class-composition
+conditionals --> strings & comparisons
comparisons --> loops
-loops --> tuples & with
-loops --> itertools & functions
+datetime --> calendar
+decorators --> Class-customization
+loops --> regular-expressions & tuples & imports
+loops --> functions & with
+regular-expressions --> structural-pattern-matching & unicode-regular-expressions
list-comprehensions --> other-comprehensions
-Class-customization --> rich-comparisons
-Class-customization --> enums & decorators
+Class-customization --> unittest & enums & rich-comparisons & logging
+unittest --> doctests
+Class-customization --> operator-overloading
Class-inheritance --> user-defined-errors & descriptors & Class-interfaces
Class-inheritance ----> context-manager-customization
-other-comprehensions ---> generators
-dicts --> dict-methods
-functions --> function-arguments & higher-order-functions & functional-tools
+other-comprehensions ---> walrus-operator & generators
+dicts --> dict-methods & copy
+functions --> function-arguments & higher-order-functions
+functions --> functional-tools
function-arguments --> none
functional-tools --> functools
generators --> generator-expressions
-higher-order-functions ---> decorators
+higher-order-functions --> decorators
higher-order-functions --> anonymous-functions
+imports --> itertools & datetime & aliasing
iterators --> generators
-lists --> string-formatting & dicts & list-methods & list-comprehensions & sequences
-numbers --> complex-numbers
-sequences --> iterators
-sets --> classes
-strings --> string-methods & string-formatting & lists
-strings --> raising-and-handling-errors
-tuples --> sequences & sets & classes & unpacking-and-multiple-assignment
+lists --> string-formatting & dicts & list-methods & list-comprehensions & array & sequences
+numbers --> bitwise-operations & complex-numbers & fractions & decimal & binary-octal-hexadecimal & random & math & statistics
+complex-numbers --> cmath
+random --> secrets
+sequences --> binary-data & iterators & enumerate
+sets --> classes & collections
+strings ----> string-formatting
+strings --> raising-and-handling-errors & lists & string-methods & unicode-data & regular-expressions
+tuples --> sequences & classes
+tuples --> zip & unpacking-and-multiple-assignment
+tuples ---> sets
+tuples --> itertools
+type-annotation --> type-aliases
+user-defined-errors --> ExceptionGroup
with --> context-manager-customization
click Basics "https://exercism.org/tracks/python/exercises/guidos-gorgeous-lasagna" "basics"
click bools "https://exercism.org/tracks/python/exercises/ghost-gobble-arcade-game" "bools"
click classes "https://exercism.org/tracks/python/exercises/ellens-alien-game" "classes"
-click Class-customization "https://github.com/exercism/python/tree/main/concepts/class-customization" "Class-customization"
-click Class-inheritance "https://github.com/exercism/python/tree/main/concepts/class-inheritance" "Class-inheritance"
+click Class-customization "https://github.com/exercism/python/issues/3094" "Class-customization"
+click Class-inheritance "https://github.com/exercism/python/issues/3096" "Class-inheritance"
click Class-interfaces "https://github.com/exercism/python/tree/main/concepts/class-interfaces" "Class-interfaces"
click conditionals "https://exercism.org/tracks/python/exercises/meltdown-mitigation" "conditionals"
click comparisons "https://exercism.org/tracks/python/exercises/black-jack" "comparisons"
@@ -366,13 +429,13 @@ click list-comprehensions "https://github.com/exercism/python/issues/2295" "list
click other-comprehensions "https://github.com/exercism/python/issues/2294" "other-comprehensions"
click conditionals "https://exercism.org/tracks/python/exercises/meltdown-mitigation" "conditionals"
click dicts "https://exercism.org/tracks/python/exercises/inventory-management" "dicts"
-click dict-methods "https://github.com/exercism/python/issues/2348" "dict-methods"
+click dict-methods "https://github.com/exercism/python/tree/main/exercises/concept/mecha-munch-management" "dict-methods"
click enums "https://github.com/exercism/python/tree/main/exercises/concept/restaurant-rozalynn" "enums"
click functions "https://github.com/exercism/python/issues/2353" "functions"
click function-arguments "https://github.com/exercism/python/issues/2354" "function-arguments"
click functional-tools "https://github.com/exercism/python/issues/2359" "functional-tools"
click functools "https://github.com/exercism/python/issues/2366" "functools"
-click generators "https://github.com/exercism/python/issues/2293" "generators"
+click generators "https://github.com/exercism/python/tree/main/exercises/concept/plane-tickets" "generators"
click generator-expressions "https://github.com/exercism/python/issues/2292" "generator-expressions"
click higher-order-functions "https://github.com/exercism/python/issues/2355" "higher-order-functions"
click anonymous-functions "https://github.com/exercism/python/issues/2357" "anonymous-functions"
@@ -392,7 +455,7 @@ click strings "https://exercism.org/tracks/python/exercises/little-sisters-vocab
click string-formatting "https://github.com/exercism/python/tree/main/exercises/concept/pretty-leaflet" "string-formatting"
click string-methods "https://exercism.org/tracks/python/exercises/little-sisters-essay" "string-methods"
click tuples "https://exercism.org/tracks/python/exercises/tisbury-treasure-hunt" "tuples"
-click unpacking-and-multiple-assignment "https://github.com/exercism/python/issues/2360" "unpacking-and-multiple-assignment"
+click unpacking-and-multiple-assignment "https://github.com/exercism/python/tree/main/exercises/concept/locomotive-engineer" "unpacking-and-multiple-assignment"
click user-defined-errors "https://github.com/exercism/python/tree/main/concepts/user-defined-errors" "user-defined-errors"
click with "https://github.com/exercism/python/issues/2369" "with"
```
diff --git a/requirements-generator.txt b/requirements-generator.txt
index 3c096bebc1e..d472d158b9b 100644
--- a/requirements-generator.txt
+++ b/requirements-generator.txt
@@ -1,6 +1,6 @@
-black==22.3.0
+black<=22.3.0
flake8~=5.0.4
Jinja2~=3.1.2
python-dateutil==2.8.1
markupsafe==2.0.1
-tomli~=2.0.1
+tomli>=1.1.0; python_full_version < '3.11.2'
diff --git a/requirements.txt b/requirements.txt
index d8556f8d612..712608f8550 100644
--- a/requirements.txt
+++ b/requirements.txt
@@ -1,5 +1,5 @@
-astroid<=2.12.0
flake8~=5.0.4
-pylint~=2.14.5
+pylint~=2.17.1
+black<=22.3.0
yapf~=0.32.0
-tomli~=2.0.1
\ No newline at end of file
+tomli>=1.1.0; python_full_version < '3.11.2'
+
✨ 🦄 _**Want to jump directly into Exercism specifications & detail?**_
[Structure][exercism-track-structure] **|** [Tasks][exercism-tasks] **|** [Concepts][exercism-concepts] **|** [Concept Exercises][concept-exercises] **|** [Practice Exercises][practice-exercises] **|** [Presentation][exercise-presentation]
[Writing Style Guide][exercism-writing-style] **|** [Markdown Specification][exercism-markdown-specification] (_✨ version in [contributing][website-contributing-section] on exercism.org_)
-