You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardexpand all lines: exercises/practice/bank-account/.docs/instructions.md
+1-1
Original file line number
Diff line number
Diff line change
@@ -3,7 +3,7 @@
3
3
Your task is to implement bank accounts supporting opening/closing, withdrawals, and deposits of money.
4
4
5
5
As bank accounts can be accessed in many different ways (internet, mobile phones, automatic charges), your bank software must allow accounts to be safely accessed from multiple threads/processes (terminology depends on your programming language) in parallel.
6
-
For example, there may be many deposits and withdrawals occurring in parallel; you need to ensure there is no [race conditions][wikipedia] between when you read the account balance and set the new balance.
6
+
For example, there may be many deposits and withdrawals occurring in parallel; you need to ensure there are no [race conditions][wikipedia] between when you read the account balance and set the new balance.
7
7
8
8
It should be possible to close an account; operations against a closed account must fail.
To be more precise an empty intersection is part of a player's territory if all of its neighbors are either stones of that player or empty intersections that are part of that player's territory.
27
27
28
-
For more information see [wikipedia][go-wikipedia] or [Sensei's Library][go-sensei].
28
+
For more information see [Wikipedia][go-wikipedia] or [Sensei's Library][go-sensei].
Copy file name to clipboardexpand all lines: exercises/practice/killer-sudoku-helper/.docs/instructions.md
+25-3
Original file line number
Diff line number
Diff line change
@@ -20,7 +20,17 @@ In a 3-digit cage with a sum of 7, there is only one valid combination: 124.
20
20
- 1 + 2 + 4 = 7
21
21
- Any other combination that adds up to 7, e.g. 232, would violate the rule of not repeating digits within a cage.
22
22
23
-
![Sudoku grid, with three killer cages that are marked as grouped together. The first killer cage is in the 3×3 box in the top left corner of the grid. The middle column of that box forms the cage, with the followings cells from top to bottom: first cell contains a 1 and a pencil mark of 7, indicating a cage sum of 7, second cell contains a 2, third cell contains a 5. The numbers are highlighted in red to indicate a mistake. The second killer cage is in the central 3×3 box of the grid. The middle column of that box forms the cage, with the followings cells from top to bottom: first cell contains a 1 and a pencil mark of 7, indicating a cage sum of 7, second cell contains a 2, third cell contains a 4. None of the numbers in this cage are highlighted and therefore don't contain any mistakes. The third killer cage follows the outside corner of the central 3×3 box of the grid. It is made up of the following three cells: the top left cell of the cage contains a 2, highlighted in red, and a cage sum of 7. The top right cell of the cage contains a 3. The bottom right cell of the cage contains a 2, highlighted in red. All other cells are empty.][one-solution-img]
23
+
![Sudoku grid, with three killer cages that are marked as grouped together.
24
+
The first killer cage is in the 3×3 box in the top left corner of the grid.
25
+
The middle column of that box forms the cage, with the followings cells from top to bottom: first cell contains a 1 and a pencil mark of 7, indicating a cage sum of 7, second cell contains a 2, third cell contains a 5.
26
+
The numbers are highlighted in red to indicate a mistake.
27
+
The second killer cage is in the central 3×3 box of the grid.
28
+
The middle column of that box forms the cage, with the followings cells from top to bottom: first cell contains a 1 and a pencil mark of 7, indicating a cage sum of 7, second cell contains a 2, third cell contains a 4.
29
+
None of the numbers in this cage are highlighted and therefore don't contain any mistakes.
30
+
The third killer cage follows the outside corner of the central 3×3 box of the grid.
31
+
It is made up of the following three cells: the top left cell of the cage contains a 2, highlighted in red, and a cage sum of 7.
32
+
The top right cell of the cage contains a 3.
33
+
The bottom right cell of the cage contains a 2, highlighted in red. All other cells are empty.][one-solution-img]
24
34
25
35
## Example 2: Cage with several combinations
26
36
@@ -31,7 +41,13 @@ In a 2-digit cage with a sum 10, there are 4 possible combinations:
31
41
- 37
32
42
- 46
33
43
34
-
![Sudoku grid, all squares empty except for the middle column, column 5, which has 8 rows filled. Each continguous two rows form a killer cage and are marked as grouped together. From top to bottom: first group is a cell with value 1 and a pencil mark indicating a cage sum of 10, cell with value 9. Second group is a cell with value 2 and a pencil mark of 10, cell with value 8. Third group is a cell with value 3 and a pencil mark of 10, cell with value 7. Fourth group is a cell with value 4 and a pencil mark of 10, cell with value 6. The last cell in the column is empty.][four-solutions-img]
44
+
![Sudoku grid, all squares empty except for the middle column, column 5, which has 8 rows filled.
45
+
Each continguous two rows form a killer cage and are marked as grouped together.
46
+
From top to bottom: first group is a cell with value 1 and a pencil mark indicating a cage sum of 10, cell with value 9.
47
+
Second group is a cell with value 2 and a pencil mark of 10, cell with value 8.
48
+
Third group is a cell with value 3 and a pencil mark of 10, cell with value 7.
49
+
Fourth group is a cell with value 4 and a pencil mark of 10, cell with value 6.
50
+
The last cell in the column is empty.][four-solutions-img]
35
51
36
52
## Example 3: Cage with several combinations that is restricted
37
53
@@ -42,7 +58,13 @@ In a 2-digit cage with a sum 10, where the column already contains a 1 and a 4,
42
58
43
59
19 and 46 are not possible due to the 1 and 4 in the column according to standard Sudoku rules.
44
60
45
-
![Sudoku grid, all squares empty except for the middle column, column 5, which has 8 rows filled. The first row contains a 4, the second is empty, and the third contains a 1. The 1 is highlighted in red to indicate a mistake. The last 6 rows in the column form killer cages of two cells each. From top to bottom: first group is a cell with value 2 and a pencil mark indicating a cage sum of 10, cell with value 8. Second group is a cell with value 3 and a pencil mark of 10, cell with value 7. Third group is a cell with value 1, highlighted in red, and a pencil mark of 10, cell with value 9.][not-possible-img]
61
+
![Sudoku grid, all squares empty except for the middle column, column 5, which has 8 rows filled.
62
+
The first row contains a 4, the second is empty, and the third contains a 1.
63
+
The 1 is highlighted in red to indicate a mistake.
64
+
The last 6 rows in the column form killer cages of two cells each.
65
+
From top to bottom: first group is a cell with value 2 and a pencil mark indicating a cage sum of 10, cell with value 8.
66
+
Second group is a cell with value 3 and a pencil mark of 10, cell with value 7.
67
+
Third group is a cell with value 1, highlighted in red, and a pencil mark of 10, cell with value 9.][not-possible-img]
Compute Pascal's triangle up to a given number of rows.
3
+
Your task is to output the first N rows of Pascal's triangle.
4
4
5
-
In Pascal's Triangle each number is computed by adding the numbers to the right and left of the current position in the previous row.
5
+
[Pascal's triangle][wikipedia] is a triangular array of positive integers.
6
+
7
+
In Pascal's triangle, the number of values in a row is equal to its row number (which starts at one).
8
+
Therefore, the first row has one value, the second row has two values, and so on.
9
+
10
+
The first (topmost) row has a single value: `1`.
11
+
Subsequent rows' values are computed by adding the numbers directly to the right and left of the current position in the previous row.
12
+
13
+
If the previous row does _not_ have a value to the left or right of the current position (which only happens for the leftmost and rightmost positions), treat that position's value as zero (effectively "ignoring" it in the summation).
14
+
15
+
## Example
16
+
17
+
Let's look at the first 5 rows of Pascal's Triangle:
6
18
7
19
```text
8
20
1
9
21
1 1
10
22
1 2 1
11
23
1 3 3 1
12
24
1 4 6 4 1
13
-
# ... etc
14
25
```
26
+
27
+
The topmost row has one value, which is `1`.
28
+
29
+
The leftmost and rightmost values have only one preceding position to consider, which is the position to its right respectively to its left.
30
+
With the topmost value being `1`, it follows from this that all the leftmost and rightmost values are also `1`.
31
+
32
+
The other values all have two positions to consider.
33
+
For example, the fifth row's (`1 4 6 4 1`) middle value is `6`, as the values to its left and right in the preceding row are `3` and `3`:
With the weather being great, you're not looking forward to spending an hour in a classroom.
4
+
Annoyed, you enter the class room, where you notice a strangely satisfying triangle shape on the blackboard.
5
+
Whilst waiting for your math teacher to arrive, you can't help but notice some patterns in the triangle: the outer values are all ones, each subsequent row has one more value than its previous row and the triangle is symmetrical.
6
+
Weird!
7
+
8
+
Not long after you sit down, your teacher enters the room and explains that this triangle is the famous [Pascal's triangle][wikipedia].
9
+
10
+
Over the next hour, your teacher reveals some amazing things hidden in this triangle:
11
+
12
+
- It can be used to compute how many ways you can pick K elements from N values.
13
+
- It contains the Fibonacci sequence.
14
+
- If you color odd and even numbers differently, you get a beautiful pattern called the [Sierpiński triangle][wikipedia-sierpinski-triangle].
15
+
16
+
The teacher implores you and your classmates to lookup other uses, and assures you that there are lots more!
17
+
At that moment, the school bell rings.
18
+
You realize that for the past hour, you were completely absorbed in learning about Pascal's triangle.
19
+
You quickly grab your laptop from your bag and go outside, ready to enjoy both the sunshine _and_ the wonders of Pascal's triangle.
Copy file name to clipboardexpand all lines: exercises/practice/pig-latin/.docs/instructions.md
+2-2
Original file line number
Diff line number
Diff line change
@@ -19,7 +19,7 @@ For example:
19
19
20
20
## Rule 2
21
21
22
-
If a word begins with a one or more consonants, first move those consonants to the end of the word and then add an `"ay"` sound to the end of the word.
22
+
If a word begins with one or more consonants, first move those consonants to the end of the word and then add an `"ay"` sound to the end of the word.
23
23
24
24
For example:
25
25
@@ -33,7 +33,7 @@ If a word starts with zero or more consonants followed by `"qu"`, first move tho
33
33
34
34
For example:
35
35
36
-
-`"quick"` -> `"ickqu"` -> `"ay"` (starts with `"qu"`, no preceding consonants)
36
+
-`"quick"` -> `"ickqu"` -> `"ickquay"` (starts with `"qu"`, no preceding consonants)
37
37
-`"square"` -> `"aresqu"` -> `"aresquay"` (starts with one consonant followed by `"qu`")
Copy file name to clipboardexpand all lines: exercises/practice/zebra-puzzle/.docs/instructions.md
+9-9
Original file line number
Diff line number
Diff line change
@@ -12,20 +12,20 @@ The following 15 statements are all known to be true:
12
12
1. There are five houses.
13
13
2. The Englishman lives in the red house.
14
14
3. The Spaniard owns the dog.
15
-
4.Coffee is drunk in the green house.
15
+
4.The person in the green house drinks coffee.
16
16
5. The Ukrainian drinks tea.
17
17
6. The green house is immediately to the right of the ivory house.
18
-
7. The Old Gold smoker owns snails.
19
-
8.Kools are smoked in the yellow house.
20
-
9.Milk is drunk in the middle house.
18
+
7. The snail owner likes to go dancing.
19
+
8.The person in the yellow house is a painter.
20
+
9.The person in the middle house drinks milk.
21
21
10. The Norwegian lives in the first house.
22
-
11. The man who smokes Chesterfields lives in the house next to the man with the fox.
23
-
12.Kools are smoked in the house next to the house where the horse is kept.
24
-
13. The Lucky Strike smoker drinks orange juice.
25
-
14. The Japanese smokes Parliaments.
22
+
11. The person who enjoys reading lives in the house next to the person with the fox.
23
+
12.The painter's house is next to the house with the horse.
24
+
13. The person who plays football drinks orange juice.
25
+
14. The Japanese person plays chess.
26
26
15. The Norwegian lives next to the blue house.
27
27
28
-
Additionally, each of the five houses is painted a different color, and their inhabitants are of different national extractions, own different pets, drink different beverages and smoke different brands of cigarettes.
28
+
Additionally, each of the five houses is painted a different color, and their inhabitants are of different national extractions, own different pets, drink different beverages and engage in different hobbies.
29
29
30
30
~~~~exercism/note
31
31
There are 24 billion (5!⁵ = 24,883,200,000) possible solutions, so try ruling out as many solutions as possible.
Copy file name to clipboardexpand all lines: exercises/practice/zebra-puzzle/.docs/introduction.md
+1-1
Original file line number
Diff line number
Diff line change
@@ -1,7 +1,7 @@
1
1
# Introduction
2
2
3
3
The Zebra Puzzle is a famous logic puzzle in which there are five houses, each painted a different color.
4
-
The houses have different inhabitants, who have different nationalities, own different pets, drink different beverages and smoke different brands of cigarettes.
4
+
The houses have different inhabitants, who have different nationalities, own different pets, drink different beverages and enjoy different hobbies.
5
5
6
6
To help you solve the puzzle, you're given 15 statements describing the solution.
7
7
However, only by combining the information in _all_ statements will you be able to find the solution to the puzzle.
0 commit comments