Skip to content

Commit 5671e6b

Browse files
author
Katrina Owen
committed
Generate the exercise READMEs from the new templates
1 parent 5d84437 commit 5671e6b

82 files changed

Lines changed: 4222 additions & 0 deletions

File tree

Some content is hidden

Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.

‎exercises/accumulate/README.md‎

Lines changed: 47 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,47 @@
1+
# Accumulate
2+
3+
Implement the `accumulate` operation, which, given a collection and an
4+
operation to perform on each element of the collection, returns a new
5+
collection containing the result of applying that operation to each element of
6+
the input collection.
7+
8+
Given the collection of numbers:
9+
10+
- 1, 2, 3, 4, 5
11+
12+
And the operation:
13+
14+
- square a number (`x => x * x`)
15+
16+
Your code should be able to produce the collection of squares:
17+
18+
- 1, 4, 9, 16, 25
19+
20+
Check out the test suite to see the expected function signature.
21+
22+
## Restrictions
23+
24+
Keep your hands off that collect/map/fmap/whatchamacallit functionality
25+
provided by your standard library!
26+
Solve this one yourself using other basic tools instead.
27+
28+
Lisp specific: it's perfectly fine to use `MAPCAR` or the equivalent,
29+
as this is idiomatic Lisp, not a library function.
30+
31+
32+
To run the tests:
33+
34+
```sh
35+
$ gradle test
36+
```
37+
38+
For more detailed info about the Java track see the [help page](http://exercism.io/languages/java).
39+
40+
41+
## Source
42+
43+
Conversation with James Edward Gray II [https://twitter.com/jeg2](https://twitter.com/jeg2)
44+
45+
## Submitting Incomplete Solutions
46+
It's possible to submit an incomplete solution so you can see how others have completed the exercise.
47+

‎exercises/acronym/README.md‎

Lines changed: 27 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,27 @@
1+
# Acronym
2+
3+
Convert a phrase to its acronym.
4+
5+
Techies love their TLA (Three Letter Acronyms)!
6+
7+
Help generate some jargon by writing a program that converts a long name
8+
like Portable Network Graphics to its acronym (PNG).
9+
10+
11+
12+
To run the tests:
13+
14+
```sh
15+
$ gradle test
16+
```
17+
18+
For more detailed info about the Java track see the [help page](http://exercism.io/languages/java).
19+
20+
21+
## Source
22+
23+
Julien Vanier [https://github.com/monkbroc](https://github.com/monkbroc)
24+
25+
## Submitting Incomplete Solutions
26+
It's possible to submit an incomplete solution so you can see how others have completed the exercise.
27+

‎exercises/all-your-base/README.md‎

Lines changed: 47 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,47 @@
1+
# All Your Base
2+
3+
Convert a number, represented as a sequence of digits in one base, to any other base.
4+
5+
Implement general base conversion. Given a number in base **a**,
6+
represented as a sequence of digits, convert it to base **b**.
7+
8+
## Note
9+
- Try to implement the conversion yourself.
10+
Do not use something else to perform the conversion for you.
11+
12+
## About [Positional Notation](https://en.wikipedia.org/wiki/Positional_notation)
13+
14+
In positional notation, a number in base **b** can be understood as a linear
15+
combination of powers of **b**.
16+
17+
The number 42, *in base 10*, means:
18+
19+
(4 * 10^1) + (2 * 10^0)
20+
21+
The number 101010, *in base 2*, means:
22+
23+
(1 * 2^5) + (0 * 2^4) + (1 * 2^3) + (0 * 2^2) + (1 * 2^1) + (0 * 2^0)
24+
25+
The number 1120, *in base 3*, means:
26+
27+
(1 * 3^3) + (1 * 3^2) + (2 * 3^1) + (0 * 3^0)
28+
29+
I think you got the idea!
30+
31+
32+
*Yes. Those three numbers above are exactly the same. Congratulations!*
33+
34+
35+
To run the tests:
36+
37+
```sh
38+
$ gradle test
39+
```
40+
41+
For more detailed info about the Java track see the [help page](http://exercism.io/languages/java).
42+
43+
44+
45+
## Submitting Incomplete Solutions
46+
It's possible to submit an incomplete solution so you can see how others have completed the exercise.
47+

‎exercises/allergies/README.md‎

Lines changed: 49 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,49 @@
1+
# Allergies
2+
3+
Given a person's allergy score, determine whether or not they're allergic to a given item, and their full list of allergies.
4+
5+
An allergy test produces a single numeric score which contains the
6+
information about all the allergies the person has (that they were
7+
tested for).
8+
9+
The list of items (and their value) that were tested are:
10+
11+
* eggs (1)
12+
* peanuts (2)
13+
* shellfish (4)
14+
* strawberries (8)
15+
* tomatoes (16)
16+
* chocolate (32)
17+
* pollen (64)
18+
* cats (128)
19+
20+
So if Tom is allergic to peanuts and chocolate, he gets a score of 34.
21+
22+
Now, given just that score of 34, your program should be able to say:
23+
24+
- Whether Tom is allergic to any one of those allergens listed above.
25+
- All the allergens Tom is allergic to.
26+
27+
Note: a given score may include allergens **not** listed above (i.e.
28+
allergens that score 256, 512, 1024, etc.). Your program should
29+
ignore those components of the score. For example, if the allergy
30+
score is 257, your program should only report the eggs (1) allergy.
31+
32+
33+
34+
To run the tests:
35+
36+
```sh
37+
$ gradle test
38+
```
39+
40+
For more detailed info about the Java track see the [help page](http://exercism.io/languages/java).
41+
42+
43+
## Source
44+
45+
Jumpstart Lab Warm-up [http://jumpstartlab.com](http://jumpstartlab.com)
46+
47+
## Submitting Incomplete Solutions
48+
It's possible to submit an incomplete solution so you can see how others have completed the exercise.
49+

‎exercises/anagram/README.md‎

Lines changed: 25 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,25 @@
1+
# Anagram
2+
3+
Given a word and a list of possible anagrams, select the correct sublist.
4+
5+
Given `"listen"` and a list of candidates like `"enlists" "google"
6+
"inlets" "banana"` the program should return a list containing
7+
`"inlets"`.
8+
9+
10+
To run the tests:
11+
12+
```sh
13+
$ gradle test
14+
```
15+
16+
For more detailed info about the Java track see the [help page](http://exercism.io/languages/java).
17+
18+
19+
## Source
20+
21+
Inspired by the Extreme Startup game [https://github.com/rchatley/extreme_startup](https://github.com/rchatley/extreme_startup)
22+
23+
## Submitting Incomplete Solutions
24+
It's possible to submit an incomplete solution so you can see how others have completed the exercise.
25+

‎exercises/atbash-cipher/README.md‎

Lines changed: 46 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,46 @@
1+
# Atbash Cipher
2+
3+
Create an implementation of the atbash cipher, an ancient encryption system created in the Middle East.
4+
5+
The Atbash cipher is a simple substitution cipher that relies on
6+
transposing all the letters in the alphabet such that the resulting
7+
alphabet is backwards. The first letter is replaced with the last
8+
letter, the second with the second-last, and so on.
9+
10+
An Atbash cipher for the Latin alphabet would be as follows:
11+
12+
```plain
13+
Plain: abcdefghijklmnopqrstuvwxyz
14+
Cipher: zyxwvutsrqponmlkjihgfedcba
15+
```
16+
17+
It is a very weak cipher because it only has one possible key, and it is
18+
a simple monoalphabetic substitution cipher. However, this may not have
19+
been an issue in the cipher's time.
20+
21+
Ciphertext is written out in groups of fixed length, the traditional group size
22+
being 5 letters, and punctuation is excluded. This is to make it harder to guess
23+
things based on word boundaries.
24+
25+
## Examples
26+
- Encoding `test` gives `gvhg`
27+
- Decoding `gvhg` gives `test`
28+
- Decoding `gsvjf rxpyi ldmul cqfnk hlevi gsvoz abwlt` gives `thequickbrownfoxjumpsoverthelazydog`
29+
30+
31+
To run the tests:
32+
33+
```sh
34+
$ gradle test
35+
```
36+
37+
For more detailed info about the Java track see the [help page](http://exercism.io/languages/java).
38+
39+
40+
## Source
41+
42+
Wikipedia [http://en.wikipedia.org/wiki/Atbash](http://en.wikipedia.org/wiki/Atbash)
43+
44+
## Submitting Incomplete Solutions
45+
It's possible to submit an incomplete solution so you can see how others have completed the exercise.
46+

‎exercises/bank-account/README.md‎

Lines changed: 54 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,54 @@
1+
# Bank Account
2+
3+
Simulate a bank account supporting opening/closing, withdrawals, and deposits
4+
of money. Watch out for concurrent transactions!
5+
6+
A bank account can be accessed in multiple ways. Clients can make
7+
deposits and withdrawals using the internet, mobile phones, etc. Shops
8+
can charge against the account.
9+
10+
Create an account that can be accessed from multiple threads/processes
11+
(terminology depends on your programming language).
12+
13+
It should be possible to close an account; operations against a closed
14+
account must fail.
15+
16+
## Instructions
17+
18+
Run the test file, and fix each of the errors in turn. When you get the
19+
first test to pass, go to the first pending or skipped test, and make
20+
that pass as well. When all of the tests are passing, feel free to
21+
submit.
22+
23+
Remember that passing code is just the first step. The goal is to work
24+
towards a solution that is as readable and expressive as you can make
25+
it.
26+
27+
Have fun!
28+
29+
This exercise introduces [concurrency](https://docs.oracle.com/javase/tutorial/essential/concurrency/index.html).
30+
To pass the last test you might find the
31+
[`synchronized` keyword or locks](https://docs.oracle.com/javase/tutorial/essential/concurrency/locksync.html) useful.
32+
33+
Problems arising from running code concurrently are often intermittent because they depend on the order the code is
34+
executed. Therefore the last test runs many [threads](https://docs.oracle.com/javase/8/docs/api/java/lang/Thread.html)
35+
several times to increase the chances of catching a bug. That means this test should fail if your implementation is not
36+
[thread safe](https://en.wikipedia.org/wiki/Thread_safety), but there is a chance it will pass just because there was
37+
no concurrent modification attempt. It is unlikely that this will occur several times
38+
in a row since the order the code is executed should vary every time you run the test. So if you run the last test a
39+
couple of times and it passes every time then you can be reasonably sure that your implementation is correct.
40+
41+
42+
To run the tests:
43+
44+
```sh
45+
$ gradle test
46+
```
47+
48+
For more detailed info about the Java track see the [help page](http://exercism.io/languages/java).
49+
50+
51+
52+
## Submitting Incomplete Solutions
53+
It's possible to submit an incomplete solution so you can see how others have completed the exercise.
54+

0 commit comments

Comments
 (0)