From 4d5c874ea4936771a2d1bde4946563fade796037 Mon Sep 17 00:00:00 2001 From: Samuel Warner Date: Tue, 30 Oct 2018 21:00:32 +0000 Subject: [PATCH 1/2] update READMEs using configlet --- exercises/accumulate/README.md | 12 +++-------- exercises/alphametics/README.md | 9 ++++---- exercises/darts/README.md | 15 ++++++++----- exercises/flatten-array/README.md | 3 +-- exercises/go-counting/README.md | 7 +++---- exercises/hello-world/README.md | 5 ++--- exercises/parallel-letter-frequency/README.md | 3 +-- exercises/pythagorean-triplet/README.md | 6 ++++++ exercises/roman-numerals/README.md | 5 ++--- exercises/secret-handshake/README.md | 5 ++--- exercises/simple-cipher/README.md | 10 +++------ exercises/two-fer/README.md | 21 +++++++++++++++---- exercises/word-search/README.md | 7 +++---- 13 files changed, 57 insertions(+), 51 deletions(-) diff --git a/exercises/accumulate/README.md b/exercises/accumulate/README.md index 12a25d4e91..81cf1e4aec 100644 --- a/exercises/accumulate/README.md +++ b/exercises/accumulate/README.md @@ -17,26 +17,21 @@ Your code should be able to produce the collection of squares: - 1, 4, 9, 16, 25 -Check out the test suite to see the expected method signature. +Check out the test suite to see the expected function signature. ## Restrictions -Keep your hands off that select/collect/map/fmap/whatchamacallit functionality +Keep your hands off that collect/map/fmap/whatchamacallit functionality provided by your standard library! Solve this one yourself using other basic tools instead. -## Hints - +## Hints This exercise requires you to write an extension method. For more information, see [this page](https://msdn.microsoft.com/en-us//library/bb383977.aspx). ## Running the tests To run the tests, run the command `dotnet test` from within the exercise directory. -### Laziness test - -Since `accumulate` returns an `IEnumerable`, it's execution is deferred until `ToList()` it is called on it, which is tested with the `Accumulate_is_lazy` method - ## Further information For more detailed information about the C# track, including how to get help if @@ -47,5 +42,4 @@ you're having trouble, please visit the exercism.io [C# language page](http://ex Conversation with James Edward Gray II [https://twitter.com/jeg2](https://twitter.com/jeg2) ## Submitting Incomplete Solutions - It's possible to submit an incomplete solution so you can see how others have completed the exercise. diff --git a/exercises/alphametics/README.md b/exercises/alphametics/README.md index e2497b3f1a..2dc28f6eff 100644 --- a/exercises/alphametics/README.md +++ b/exercises/alphametics/README.md @@ -1,6 +1,6 @@ # Alphametics -Write a method to solve alphametics puzzles. +Write a function to solve alphametics puzzles. [Alphametics](https://en.wikipedia.org/wiki/Alphametics) is a puzzle where letters in words are replaced with numbers. @@ -29,15 +29,15 @@ words, translated into numbers, then make a valid sum. Each letter must represent a different digit, and the leading digit of a multi-digit number must not be zero. -Write a method to solve alphametics puzzles. +Write a function to solve alphametics puzzles. ## Hints - - To parse the text, you could try to use the [Sprache](https://github.com/sprache/Sprache/blob/develop/README.md) library. You can also find a good tutorial [here](https://www.thomaslevesque.com/2017/02/23/easy-text-parsing-in-c-with-sprache/). - You can solve this exercise with a brute force algorithm, but this will possibly have a poor runtime performance. - Try to find a more sophisticated solution. +Try to find a more sophisticated solution. - Hint: You could try the column-wise addition algorithm that is usually taught in school. + ## Running the tests To run the tests, run the command `dotnet test` from within the exercise directory. @@ -48,5 +48,4 @@ For more detailed information about the C# track, including how to get help if you're having trouble, please visit the exercism.io [C# language page](http://exercism.io/languages/csharp/resources). ## Submitting Incomplete Solutions - It's possible to submit an incomplete solution so you can see how others have completed the exercise. diff --git a/exercises/darts/README.md b/exercises/darts/README.md index c704ebee3f..c04f108fcc 100644 --- a/exercises/darts/README.md +++ b/exercises/darts/README.md @@ -1,3 +1,5 @@ +# Darts + Write a function that returns the earned points in a single toss of a Darts game. [Darts](https://en.wikipedia.org/wiki/Darts) is a game where players @@ -5,15 +7,14 @@ throw darts to a [target](https://en.wikipedia.org/wiki/Darts#/media/File:Darts_ In our particular instance of the game, the target rewards with 4 different amounts of points, depending on where the dart lands: -- If the dart lands outside the target, player earns no points (0 points). -- If the dart lands in the outer circle of the target, player earns 1 point. -- If the dart lands in the middle circle of the target, player earns 5 points. -- If the dart lands in the inner circle of the target, player earns 10 points. +* If the dart lands outside the target, player earns no points (0 points). +* If the dart lands in the outer circle of the target, player earns 1 point. +* If the dart lands in the middle circle of the target, player earns 5 points. +* 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 to the same point (That is, the circles are [concentric](http://mathworld.wolfram.com/ConcentricCircles.html)) defined by the coordinates (0, 0). Write a function that given a point in the target (defined by its `real` cartesian coordinates `x` and `y`), returns the correct amount earned by a dart landing in that point. - ## Running the tests To run the tests, run the command `dotnet test` from within the exercise directory. @@ -23,5 +24,9 @@ To run the tests, run the command `dotnet test` from within the exercise directo For more detailed information about the C# track, including how to get help if you're having trouble, please visit the exercism.io [C# language page](http://exercism.io/languages/csharp/resources). +## Source + +Inspired by an excersie created by a professor Della Paolera in Argentina + ## Submitting Incomplete Solutions It's possible to submit an incomplete solution so you can see how others have completed the exercise. diff --git a/exercises/flatten-array/README.md b/exercises/flatten-array/README.md index c075be1fd9..e8e0b201da 100644 --- a/exercises/flatten-array/README.md +++ b/exercises/flatten-array/README.md @@ -2,7 +2,7 @@ Take a nested list and return a single flattened list with all values except nil/null. -The challenge is to write a method that accepts an arbitrarily-deep nested list-like structure and returns a flattened structure without any nil/null values. +The challenge is to write a function that accepts an arbitrarily-deep nested list-like structure and returns a flattened structure without any nil/null values. For Example @@ -24,5 +24,4 @@ you're having trouble, please visit the exercism.io [C# language page](http://ex Interview Question [https://reference.wolfram.com/language/ref/Flatten.html](https://reference.wolfram.com/language/ref/Flatten.html) ## Submitting Incomplete Solutions - It's possible to submit an incomplete solution so you can see how others have completed the exercise. diff --git a/exercises/go-counting/README.md b/exercises/go-counting/README.md index 95d6253f3c..a2b43da091 100644 --- a/exercises/go-counting/README.md +++ b/exercises/go-counting/README.md @@ -7,16 +7,16 @@ are gained by completely encircling empty intersections with your stones. The encircled intersections of a player are known as its territory. -Write a method that determines the territory of each player. You may +Write a function that determines the territory of each player. You may assume that any stones that have been stranded in enemy territory have already been taken off the board. -Write a method that determines the territory which includes a specified coordinate. +Write a function that determines the territory which includes a specified coordinate. Multiple empty intersections may be encircled at once and for encircling only horizontal and vertical neighbours count. In the following diagram the stones which matter are marked "O" and the stones that don't are -marked "I" (ignored). Empty spaces represent empty intersections. +marked "I" (ignored). Empty spaces represent empty intersections. ```text +----+ @@ -45,5 +45,4 @@ For more detailed information about the C# track, including how to get help if you're having trouble, please visit the exercism.io [C# language page](http://exercism.io/languages/csharp/resources). ## Submitting Incomplete Solutions - It's possible to submit an incomplete solution so you can see how others have completed the exercise. diff --git a/exercises/hello-world/README.md b/exercises/hello-world/README.md index 794cb60bd6..7e05640e4e 100644 --- a/exercises/hello-world/README.md +++ b/exercises/hello-world/README.md @@ -8,7 +8,7 @@ or environment. The objectives are simple: -- Write a method that returns the string "Hello, World!". +- Write a function that returns the string "Hello, World!". - Run the test suite and make sure that it succeeds. - Submit your solution and check it at the website. @@ -25,8 +25,7 @@ you're having trouble, please visit the exercism.io [C# language page](http://ex ## Source -This is an exercise to introduce users to using Exercism [http://en.wikipedia.org/wiki/%22Hello,\_world!%22_program](http://en.wikipedia.org/wiki/%22Hello,_world!%22_program) +This is an exercise to introduce users to using Exercism [http://en.wikipedia.org/wiki/%22Hello,_world!%22_program](http://en.wikipedia.org/wiki/%22Hello,_world!%22_program) ## Submitting Incomplete Solutions - It's possible to submit an incomplete solution so you can see how others have completed the exercise. diff --git a/exercises/parallel-letter-frequency/README.md b/exercises/parallel-letter-frequency/README.md index 98821ea606..45ffc2553c 100644 --- a/exercises/parallel-letter-frequency/README.md +++ b/exercises/parallel-letter-frequency/README.md @@ -4,7 +4,7 @@ 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 method that returns the total frequency of each letter in a +Create a function that returns the total frequency of each letter in a list of texts and that employs parallelism. ## Running the tests @@ -17,5 +17,4 @@ For more detailed information about the C# track, including how to get help if you're having trouble, please visit the exercism.io [C# language page](http://exercism.io/languages/csharp/resources). ## Submitting Incomplete Solutions - It's possible to submit an incomplete solution so you can see how others have completed the exercise. diff --git a/exercises/pythagorean-triplet/README.md b/exercises/pythagorean-triplet/README.md index 7c7e5dd272..7a0439d4bb 100644 --- a/exercises/pythagorean-triplet/README.md +++ b/exercises/pythagorean-triplet/README.md @@ -7,6 +7,12 @@ which, a**2 + b**2 = c**2 ``` +and such that, + +```text +a < b < c +``` + For example, ```text diff --git a/exercises/roman-numerals/README.md b/exercises/roman-numerals/README.md index ae048ee8ed..ff2ca53db2 100644 --- a/exercises/roman-numerals/README.md +++ b/exercises/roman-numerals/README.md @@ -1,6 +1,6 @@ # Roman Numerals -Write a method to convert from normal numbers to Roman Numerals. +Write a function to convert from normal numbers to Roman Numerals. The Romans were a clever bunch. They conquered most of Europe and ruled it for hundreds of years. They invented concrete and straight roads and @@ -43,9 +43,9 @@ In Roman numerals 1990 is MCMXC: See also: http://www.novaroma.org/via_romana/numbers.html ## Hints - This exercise requires you to write an extension method. For more information, see [this page](https://msdn.microsoft.com/en-us//library/bb383977.aspx). + ## Running the tests To run the tests, run the command `dotnet test` from within the exercise directory. @@ -60,5 +60,4 @@ you're having trouble, please visit the exercism.io [C# language page](http://ex The Roman Numeral Kata [http://codingdojo.org/cgi-bin/index.pl?KataRomanNumerals](http://codingdojo.org/cgi-bin/index.pl?KataRomanNumerals) ## Submitting Incomplete Solutions - It's possible to submit an incomplete solution so you can see how others have completed the exercise. diff --git a/exercises/secret-handshake/README.md b/exercises/secret-handshake/README.md index bb6a409250..c9e721a102 100644 --- a/exercises/secret-handshake/README.md +++ b/exercises/secret-handshake/README.md @@ -20,10 +20,10 @@ Given a decimal number, convert it to the appropriate sequence of events for a s Here's a couple of examples: -Given the input 3, the method would return the array +Given the input 3, the function would return the array ["wink", "double blink"] because 3 is 11 in binary. -Given the input 19, the method would return the array +Given the input 19, the function would return the array ["double blink", "wink"] because 19 is 10011 in binary. Notice that the addition of 16 (10000 in binary) has caused the array to be reversed. @@ -42,5 +42,4 @@ you're having trouble, please visit the exercism.io [C# language page](http://ex Bert, in Mary Poppins [http://www.imdb.com/title/tt0058331/quotes/qt0437047](http://www.imdb.com/title/tt0058331/quotes/qt0437047) ## Submitting Incomplete Solutions - It's possible to submit an incomplete solution so you can see how others have completed the exercise. diff --git a/exercises/simple-cipher/README.md b/exercises/simple-cipher/README.md index 996586f0c0..704ea32984 100644 --- a/exercises/simple-cipher/README.md +++ b/exercises/simple-cipher/README.md @@ -29,9 +29,9 @@ This image is a great example of the Caesar Cipher: For example: -Giving "iamapandabear" as input to the encode method returns the cipher "ldpdsdqgdehdu". Obscure enough to keep our message secret in transit. +Giving "iamapandabear" as input to the encode function returns the cipher "ldpdsdqgdehdu". Obscure enough to keep our message secret in transit. -When "ldpdsdqgdehdu" is put into the decode method it would return +When "ldpdsdqgdehdu" is put into the decode function it would return the original "iamapandabear" letting your friend read your original message. @@ -61,10 +61,7 @@ substitution cipher a little more fault tolerant by providing a source of randomness and ensuring that the key contains only lowercase letters. If someone doesn't submit a key at all, generate a truly random key of -at least 100 characters in length. - -If the key submitted is not composed only of lowercase letters, your -solution should handle the error in a language-appropriate way. +at least 100 alphanumeric characters in length. ## Extensions @@ -95,5 +92,4 @@ you're having trouble, please visit the exercism.io [C# language page](http://ex Substitution Cipher at Wikipedia [http://en.wikipedia.org/wiki/Substitution_cipher](http://en.wikipedia.org/wiki/Substitution_cipher) ## Submitting Incomplete Solutions - It's possible to submit an incomplete solution so you can see how others have completed the exercise. diff --git a/exercises/two-fer/README.md b/exercises/two-fer/README.md index 81e20a3578..99007ef929 100644 --- a/exercises/two-fer/README.md +++ b/exercises/two-fer/README.md @@ -2,15 +2,28 @@ `Two-fer` or `2-fer` is short for two for one. One for you and one for me. +Given a name, return a string with the message: + ```text -"One for X, one for me." +One for X, one for me. ``` -When X is a name or "you". +Where X is the given name. + +However, if the name is missing, return the string: + +```text +One for you, one for me. +``` -If the given name is "Alice", the result should be "One for Alice, one for me." -If no name is given, the result should be "One for you, one for me." +Here are some examples: +|Name | String to return +|:------:|:-----------------: +|Alice | One for Alice, one for me. +|Bob | One for Bob, one for me. +| | One for you, one for me. +|Zaphod | One for Zaphod, one for me. ## Running the tests diff --git a/exercises/word-search/README.md b/exercises/word-search/README.md index 715df22b41..2bea144bba 100644 --- a/exercises/word-search/README.md +++ b/exercises/word-search/README.md @@ -28,10 +28,10 @@ letter of each word. ## HINTS -One of the uses of Tuples is returning multiple values from a function. In this exercise, write -a method that returns a Tuple (the x- and y- part of a coordinate). +One of the uses of Tuples is returning multiple values from a function. In this exercise, write +a function that returns a Tuple (the x- and y- part of a coordinate). -For more information on Tuples, see [this link](). +For more information on Tuples, see [this link](https://msdn.microsoft.com/en-us/library/system.tuple(v=vs.110).aspx). ## Running the tests @@ -43,5 +43,4 @@ For more detailed information about the C# track, including how to get help if you're having trouble, please visit the exercism.io [C# language page](http://exercism.io/languages/csharp/resources). ## Submitting Incomplete Solutions - It's possible to submit an incomplete solution so you can see how others have completed the exercise. From e45c60dc614586bd0a8e83bdf22629470b4476cd Mon Sep 17 00:00:00 2001 From: Samuel Warner Date: Thu, 1 Nov 2018 19:49:04 +0000 Subject: [PATCH 2/2] update READMEs with update-docs.sh --- exercises/accumulate/README.md | 12 +++++++++--- exercises/alphametics/README.md | 9 +++++---- exercises/flatten-array/README.md | 3 ++- exercises/go-counting/README.md | 7 ++++--- exercises/hello-world/README.md | 5 +++-- exercises/parallel-letter-frequency/README.md | 3 ++- exercises/roman-numerals/README.md | 5 +++-- exercises/secret-handshake/README.md | 5 +++-- exercises/simple-cipher/README.md | 5 +++-- exercises/word-search/README.md | 7 ++++--- 10 files changed, 38 insertions(+), 23 deletions(-) diff --git a/exercises/accumulate/README.md b/exercises/accumulate/README.md index 81cf1e4aec..12a25d4e91 100644 --- a/exercises/accumulate/README.md +++ b/exercises/accumulate/README.md @@ -17,21 +17,26 @@ Your code should be able to produce the collection of squares: - 1, 4, 9, 16, 25 -Check out the test suite to see the expected function signature. +Check out the test suite to see the expected method signature. ## Restrictions -Keep your hands off that collect/map/fmap/whatchamacallit functionality +Keep your hands off that select/collect/map/fmap/whatchamacallit functionality provided by your standard library! Solve this one yourself using other basic tools instead. -## Hints +## Hints + This exercise requires you to write an extension method. For more information, see [this page](https://msdn.microsoft.com/en-us//library/bb383977.aspx). ## Running the tests To run the tests, run the command `dotnet test` from within the exercise directory. +### Laziness test + +Since `accumulate` returns an `IEnumerable`, it's execution is deferred until `ToList()` it is called on it, which is tested with the `Accumulate_is_lazy` method + ## Further information For more detailed information about the C# track, including how to get help if @@ -42,4 +47,5 @@ you're having trouble, please visit the exercism.io [C# language page](http://ex Conversation with James Edward Gray II [https://twitter.com/jeg2](https://twitter.com/jeg2) ## Submitting Incomplete Solutions + It's possible to submit an incomplete solution so you can see how others have completed the exercise. diff --git a/exercises/alphametics/README.md b/exercises/alphametics/README.md index 2dc28f6eff..e2497b3f1a 100644 --- a/exercises/alphametics/README.md +++ b/exercises/alphametics/README.md @@ -1,6 +1,6 @@ # Alphametics -Write a function to solve alphametics puzzles. +Write a method to solve alphametics puzzles. [Alphametics](https://en.wikipedia.org/wiki/Alphametics) is a puzzle where letters in words are replaced with numbers. @@ -29,15 +29,15 @@ words, translated into numbers, then make a valid sum. Each letter must represent a different digit, and the leading digit of a multi-digit number must not be zero. -Write a function to solve alphametics puzzles. +Write a method to solve alphametics puzzles. ## Hints + - To parse the text, you could try to use the [Sprache](https://github.com/sprache/Sprache/blob/develop/README.md) library. You can also find a good tutorial [here](https://www.thomaslevesque.com/2017/02/23/easy-text-parsing-in-c-with-sprache/). - You can solve this exercise with a brute force algorithm, but this will possibly have a poor runtime performance. -Try to find a more sophisticated solution. + Try to find a more sophisticated solution. - Hint: You could try the column-wise addition algorithm that is usually taught in school. - ## Running the tests To run the tests, run the command `dotnet test` from within the exercise directory. @@ -48,4 +48,5 @@ For more detailed information about the C# track, including how to get help if you're having trouble, please visit the exercism.io [C# language page](http://exercism.io/languages/csharp/resources). ## Submitting Incomplete Solutions + It's possible to submit an incomplete solution so you can see how others have completed the exercise. diff --git a/exercises/flatten-array/README.md b/exercises/flatten-array/README.md index e8e0b201da..c075be1fd9 100644 --- a/exercises/flatten-array/README.md +++ b/exercises/flatten-array/README.md @@ -2,7 +2,7 @@ Take a nested list and return a single flattened list with all values except nil/null. -The challenge is to write a function that accepts an arbitrarily-deep nested list-like structure and returns a flattened structure without any nil/null values. +The challenge is to write a method that accepts an arbitrarily-deep nested list-like structure and returns a flattened structure without any nil/null values. For Example @@ -24,4 +24,5 @@ you're having trouble, please visit the exercism.io [C# language page](http://ex Interview Question [https://reference.wolfram.com/language/ref/Flatten.html](https://reference.wolfram.com/language/ref/Flatten.html) ## Submitting Incomplete Solutions + It's possible to submit an incomplete solution so you can see how others have completed the exercise. diff --git a/exercises/go-counting/README.md b/exercises/go-counting/README.md index a2b43da091..95d6253f3c 100644 --- a/exercises/go-counting/README.md +++ b/exercises/go-counting/README.md @@ -7,16 +7,16 @@ are gained by completely encircling empty intersections with your stones. The encircled intersections of a player are known as its territory. -Write a function that determines the territory of each player. You may +Write a method that determines the territory of each player. You may assume that any stones that have been stranded in enemy territory have already been taken off the board. -Write a function that determines the territory which includes a specified coordinate. +Write a method that determines the territory which includes a specified coordinate. Multiple empty intersections may be encircled at once and for encircling only horizontal and vertical neighbours count. In the following diagram the stones which matter are marked "O" and the stones that don't are -marked "I" (ignored). Empty spaces represent empty intersections. +marked "I" (ignored). Empty spaces represent empty intersections. ```text +----+ @@ -45,4 +45,5 @@ For more detailed information about the C# track, including how to get help if you're having trouble, please visit the exercism.io [C# language page](http://exercism.io/languages/csharp/resources). ## Submitting Incomplete Solutions + It's possible to submit an incomplete solution so you can see how others have completed the exercise. diff --git a/exercises/hello-world/README.md b/exercises/hello-world/README.md index 7e05640e4e..794cb60bd6 100644 --- a/exercises/hello-world/README.md +++ b/exercises/hello-world/README.md @@ -8,7 +8,7 @@ or environment. The objectives are simple: -- Write a function that returns the string "Hello, World!". +- Write a method that returns the string "Hello, World!". - Run the test suite and make sure that it succeeds. - Submit your solution and check it at the website. @@ -25,7 +25,8 @@ you're having trouble, please visit the exercism.io [C# language page](http://ex ## Source -This is an exercise to introduce users to using Exercism [http://en.wikipedia.org/wiki/%22Hello,_world!%22_program](http://en.wikipedia.org/wiki/%22Hello,_world!%22_program) +This is an exercise to introduce users to using Exercism [http://en.wikipedia.org/wiki/%22Hello,\_world!%22_program](http://en.wikipedia.org/wiki/%22Hello,_world!%22_program) ## Submitting Incomplete Solutions + It's possible to submit an incomplete solution so you can see how others have completed the exercise. diff --git a/exercises/parallel-letter-frequency/README.md b/exercises/parallel-letter-frequency/README.md index 45ffc2553c..98821ea606 100644 --- a/exercises/parallel-letter-frequency/README.md +++ b/exercises/parallel-letter-frequency/README.md @@ -4,7 +4,7 @@ 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 +Create a method that returns the total frequency of each letter in a list of texts and that employs parallelism. ## Running the tests @@ -17,4 +17,5 @@ For more detailed information about the C# track, including how to get help if you're having trouble, please visit the exercism.io [C# language page](http://exercism.io/languages/csharp/resources). ## Submitting Incomplete Solutions + It's possible to submit an incomplete solution so you can see how others have completed the exercise. diff --git a/exercises/roman-numerals/README.md b/exercises/roman-numerals/README.md index ff2ca53db2..ae048ee8ed 100644 --- a/exercises/roman-numerals/README.md +++ b/exercises/roman-numerals/README.md @@ -1,6 +1,6 @@ # Roman Numerals -Write a function to convert from normal numbers to Roman Numerals. +Write a method to convert from normal numbers to Roman Numerals. The Romans were a clever bunch. They conquered most of Europe and ruled it for hundreds of years. They invented concrete and straight roads and @@ -43,8 +43,8 @@ In Roman numerals 1990 is MCMXC: See also: http://www.novaroma.org/via_romana/numbers.html ## Hints -This exercise requires you to write an extension method. For more information, see [this page](https://msdn.microsoft.com/en-us//library/bb383977.aspx). +This exercise requires you to write an extension method. For more information, see [this page](https://msdn.microsoft.com/en-us//library/bb383977.aspx). ## Running the tests @@ -60,4 +60,5 @@ you're having trouble, please visit the exercism.io [C# language page](http://ex The Roman Numeral Kata [http://codingdojo.org/cgi-bin/index.pl?KataRomanNumerals](http://codingdojo.org/cgi-bin/index.pl?KataRomanNumerals) ## Submitting Incomplete Solutions + It's possible to submit an incomplete solution so you can see how others have completed the exercise. diff --git a/exercises/secret-handshake/README.md b/exercises/secret-handshake/README.md index c9e721a102..bb6a409250 100644 --- a/exercises/secret-handshake/README.md +++ b/exercises/secret-handshake/README.md @@ -20,10 +20,10 @@ Given a decimal number, convert it to the appropriate sequence of events for a s Here's a couple of examples: -Given the input 3, the function would return the array +Given the input 3, the method would return the array ["wink", "double blink"] because 3 is 11 in binary. -Given the input 19, the function would return the array +Given the input 19, the method would return the array ["double blink", "wink"] because 19 is 10011 in binary. Notice that the addition of 16 (10000 in binary) has caused the array to be reversed. @@ -42,4 +42,5 @@ you're having trouble, please visit the exercism.io [C# language page](http://ex Bert, in Mary Poppins [http://www.imdb.com/title/tt0058331/quotes/qt0437047](http://www.imdb.com/title/tt0058331/quotes/qt0437047) ## Submitting Incomplete Solutions + It's possible to submit an incomplete solution so you can see how others have completed the exercise. diff --git a/exercises/simple-cipher/README.md b/exercises/simple-cipher/README.md index 704ea32984..8bd992645c 100644 --- a/exercises/simple-cipher/README.md +++ b/exercises/simple-cipher/README.md @@ -29,9 +29,9 @@ This image is a great example of the Caesar Cipher: For example: -Giving "iamapandabear" as input to the encode function returns the cipher "ldpdsdqgdehdu". Obscure enough to keep our message secret in transit. +Giving "iamapandabear" as input to the encode method returns the cipher "ldpdsdqgdehdu". Obscure enough to keep our message secret in transit. -When "ldpdsdqgdehdu" is put into the decode function it would return +When "ldpdsdqgdehdu" is put into the decode method it would return the original "iamapandabear" letting your friend read your original message. @@ -92,4 +92,5 @@ you're having trouble, please visit the exercism.io [C# language page](http://ex Substitution Cipher at Wikipedia [http://en.wikipedia.org/wiki/Substitution_cipher](http://en.wikipedia.org/wiki/Substitution_cipher) ## Submitting Incomplete Solutions + It's possible to submit an incomplete solution so you can see how others have completed the exercise. diff --git a/exercises/word-search/README.md b/exercises/word-search/README.md index 2bea144bba..715df22b41 100644 --- a/exercises/word-search/README.md +++ b/exercises/word-search/README.md @@ -28,10 +28,10 @@ letter of each word. ## HINTS -One of the uses of Tuples is returning multiple values from a function. In this exercise, write -a function that returns a Tuple (the x- and y- part of a coordinate). +One of the uses of Tuples is returning multiple values from a function. In this exercise, write +a method that returns a Tuple (the x- and y- part of a coordinate). -For more information on Tuples, see [this link](https://msdn.microsoft.com/en-us/library/system.tuple(v=vs.110).aspx). +For more information on Tuples, see [this link](). ## Running the tests @@ -43,4 +43,5 @@ For more detailed information about the C# track, including how to get help if you're having trouble, please visit the exercism.io [C# language page](http://exercism.io/languages/csharp/resources). ## Submitting Incomplete Solutions + It's possible to submit an incomplete solution so you can see how others have completed the exercise.