From 8f185125621e94b54691e2f1996d81c3a779ff75 Mon Sep 17 00:00:00 2001 From: Augusto Date: Mon, 7 Jun 2021 15:03:13 +0100 Subject: [PATCH 01/19] Rephrase the explanation for iterative and recursive power exercise --- subjects/iterativepower/README.md | 2 +- subjects/recursivepower/README.md | 2 +- 2 files changed, 2 insertions(+), 2 deletions(-) diff --git a/subjects/iterativepower/README.md b/subjects/iterativepower/README.md index 52b0228e..05542790 100644 --- a/subjects/iterativepower/README.md +++ b/subjects/iterativepower/README.md @@ -2,7 +2,7 @@ ### Instructions -Write an **iterative** function that returns the power of the `int` passed as parameter. +Write an **iterative** function that returns the value of `nb` to the power of `power`. Negative powers will return `0`. Overflows do **not** have to be dealt with. diff --git a/subjects/recursivepower/README.md b/subjects/recursivepower/README.md index 3e2c6163..580e17c9 100644 --- a/subjects/recursivepower/README.md +++ b/subjects/recursivepower/README.md @@ -2,7 +2,7 @@ ### Instructions -Write an **recursive** function that returns the power of the `int` passed as parameter. +Write a **recursive** function that returns the the value of `nb` to the power `power`. Negative powers will return `0`. Overflows do **not** have to be dealt with. From 5aa202fc57f76bd1d51053cada2e60a1c53ba002 Mon Sep 17 00:00:00 2001 From: Augusto Date: Mon, 7 Jun 2021 15:24:44 +0100 Subject: [PATCH 02/19] Rephrase fibonacci exercise instructions --- subjects/fibonacci/README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/subjects/fibonacci/README.md b/subjects/fibonacci/README.md index cb90c944..68e66353 100644 --- a/subjects/fibonacci/README.md +++ b/subjects/fibonacci/README.md @@ -2,7 +2,7 @@ ### Instructions -Write a **recursive** function that returns the value of the fibonacci sequence matching the index passed as parameter. +Write a **recursive** function that returns the value at the position `index` in the fibonacci sequence. The first value is at index `0`. From 0dc5d03516b53c7e037b938a9f6d8fb01559e0d4 Mon Sep 17 00:00:00 2001 From: Augusto Date: Mon, 7 Jun 2021 16:29:17 +0100 Subject: [PATCH 03/19] Rephrase instructions for exercise splitwhitespaces and some small fixes --- subjects/appendrange/README.md | 2 +- subjects/makerange/README.md | 2 +- subjects/printwordstables/README.md | 4 +--- subjects/splitwhitespaces/README.md | 2 +- 4 files changed, 4 insertions(+), 6 deletions(-) diff --git a/subjects/appendrange/README.md b/subjects/appendrange/README.md index 3190b4d2..0b0140da 100644 --- a/subjects/appendrange/README.md +++ b/subjects/appendrange/README.md @@ -2,7 +2,7 @@ ### Instructions -Write a function that takes an `int` min and an `int` max as parameters. That function returns a slice of `int` with all the values between min and max. +Write a function that takes an `int` min and an `int` max as parameters. That function returns a slice of `int`s with all the values between min and max. Min is included, and max is excluded. diff --git a/subjects/makerange/README.md b/subjects/makerange/README.md index 588781ca..feccdab2 100644 --- a/subjects/makerange/README.md +++ b/subjects/makerange/README.md @@ -3,7 +3,7 @@ ### Instructions Write a function that takes an `int` min and an `int` max as parameters. -That function returns a slice of `int` with all the values between min and max. +That function returns a slice of `int`s with all the values between min and max. Min is included, and max is excluded. diff --git a/subjects/printwordstables/README.md b/subjects/printwordstables/README.md index 21cd4f55..5297255e 100644 --- a/subjects/printwordstables/README.md +++ b/subjects/printwordstables/README.md @@ -2,9 +2,7 @@ ### Instructions -Write a function that prints the words of a `string` slice that will be returned by a function `SplitWhiteSpaces`. - -Each word is on a single line (each word ends with a `\n`). +Write a function that receives a `string slice` and prints each element of the slice in one line. ### Expected function diff --git a/subjects/splitwhitespaces/README.md b/subjects/splitwhitespaces/README.md index de3247ba..96769706 100644 --- a/subjects/splitwhitespaces/README.md +++ b/subjects/splitwhitespaces/README.md @@ -2,7 +2,7 @@ ### Instructions -Write a function that separates the words of a `string` and puts them in a `string` slice. +Write a function that separates the words of a `string` and puts them in a `string slice`. The separators are spaces, tabs and newlines. From 9e97040d7936ca64c75c1d89a9001302ba5fcf6f Mon Sep 17 00:00:00 2001 From: Augusto Date: Mon, 7 Jun 2021 16:35:41 +0100 Subject: [PATCH 04/19] Rephrase instructions of exercise `split` --- subjects/split/README.md | 4 +--- 1 file changed, 1 insertion(+), 3 deletions(-) diff --git a/subjects/split/README.md b/subjects/split/README.md index f98fdc5b..dae5d8f3 100644 --- a/subjects/split/README.md +++ b/subjects/split/README.md @@ -2,9 +2,7 @@ ### Instructions -Write a function that separates the words of a `string` and puts them in a `string` slice. - -The separators are the characters of the separator string given in parameter. +Write a function that receives a string and a separator and returns a `slice of strings` that results of splitting the string `s` by the separator `sep`. ### Expected function From 2c240127afbe7087a64cf22a08bea1925dc95da7 Mon Sep 17 00:00:00 2001 From: Augusto Date: Mon, 7 Jun 2021 16:47:10 +0100 Subject: [PATCH 05/19] Rephrase instructions for exercise `convertbase` --- subjects/convertbase/README.md | 5 ++++- 1 file changed, 4 insertions(+), 1 deletion(-) diff --git a/subjects/convertbase/README.md b/subjects/convertbase/README.md index 06269e65..6638e799 100644 --- a/subjects/convertbase/README.md +++ b/subjects/convertbase/README.md @@ -2,7 +2,10 @@ ### Instructions -Write a function that returns the conversion of a `string` number from one `string` baseFrom to one `string` baseTo. +Write a function that receives three arguments: +- `nbr`: A string representing a numberic value in a [base](https://simple.wikipedia.org/wiki/Base_(mathematics)). +- `baseFrom`: A string representing the base `nbr` it's using. +- `baseTo`: A string representing the base `nbr` should be represented in the returned value. Only valid bases will be tested. From 1d3e8ab4ace246a20a78ce42acd9ec64a404274b Mon Sep 17 00:00:00 2001 From: Augusto Date: Mon, 7 Jun 2021 17:17:30 +0100 Subject: [PATCH 06/19] Clarify instructions for the exercise `boolean` --- subjects/boolean/README.md | 6 ++---- 1 file changed, 2 insertions(+), 4 deletions(-) diff --git a/subjects/boolean/README.md b/subjects/boolean/README.md index e098eb92..997b51e2 100644 --- a/subjects/boolean/README.md +++ b/subjects/boolean/README.md @@ -2,14 +2,12 @@ ### Instructions -Create a `.go` file. +Create a new directory called `boolean`. -- The code below has to be copied in that file. +- The code below has to be copied in a file called `main.go` inside the `boolean` directory. - The necessary changes have to be applied so that the program works. -- The program must be submitted inside a folder with the name `boolean`. - ### Code to be copied ```go From 4eced704b87be7897ceaca06fb92d91b103e9433 Mon Sep 17 00:00:00 2001 From: Augusto Date: Mon, 7 Jun 2021 17:30:20 +0100 Subject: [PATCH 07/19] Rephrase the instructions of the exercise `point` --- subjects/convertbase/README.md | 3 +++ subjects/point/README.md | 6 ++---- 2 files changed, 5 insertions(+), 4 deletions(-) diff --git a/subjects/convertbase/README.md b/subjects/convertbase/README.md index 6638e799..bb830281 100644 --- a/subjects/convertbase/README.md +++ b/subjects/convertbase/README.md @@ -3,8 +3,11 @@ ### Instructions Write a function that receives three arguments: + - `nbr`: A string representing a numberic value in a [base](https://simple.wikipedia.org/wiki/Base_(mathematics)). + - `baseFrom`: A string representing the base `nbr` it's using. + - `baseTo`: A string representing the base `nbr` should be represented in the returned value. Only valid bases will be tested. diff --git a/subjects/point/README.md b/subjects/point/README.md index 7d532066..0c4c901b 100644 --- a/subjects/point/README.md +++ b/subjects/point/README.md @@ -2,14 +2,12 @@ ### Instructions -Create a `.go` file. +Create a new directory called `point`. -- The code below has to be copied in that file. +- The code below has to be copied in a file called `main.go` inside the `point` directory. - The necessary changes have to be applied so that the program works. -- The program must be submitted inside a folder with the name `point`. - ### Code to be copied ```go From cba96cfa4ad1f91f9d95b768f72a255f99e1b775 Mon Sep 17 00:00:00 2001 From: Augusto Date: Tue, 8 Jun 2021 11:44:20 +0100 Subject: [PATCH 08/19] Add link to the collatz conjecture --- subjects/collatzcountdown/README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/subjects/collatzcountdown/README.md b/subjects/collatzcountdown/README.md index f2547dd3..3bbf69a7 100644 --- a/subjects/collatzcountdown/README.md +++ b/subjects/collatzcountdown/README.md @@ -2,7 +2,7 @@ ### Instructions -Write a function, `CollatzCountdown`, that returns the number of steps necessary to reach 1 using the collatz countdown. +Write a function, `CollatzCountdown`, that returns the number of steps necessary to reach 1 using the [collatz countdown](https://en.wikipedia.org/wiki/Collatz_conjecture). - It must return `-1` if `start` is equal to `0` or negative. From a6f7ce3c308dfa36a20cd13d3df65ed443d35f31 Mon Sep 17 00:00:00 2001 From: Augusto Date: Tue, 8 Jun 2021 11:49:49 +0100 Subject: [PATCH 09/19] Fix grammar in exercise `enigma` --- subjects/enigma/README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/subjects/enigma/README.md b/subjects/enigma/README.md index 84d2efee..d4136e02 100644 --- a/subjects/enigma/README.md +++ b/subjects/enigma/README.md @@ -2,7 +2,7 @@ ### Instructions -Write a function called `Enigma` that receives pointers to as arguments and move its values around to hide them. +Write a function called `Enigma` that receives pointers as arguments and move its values around to hide them. This function will put : From 39e8eb3ccf446b699a52c184da71ab455ee843b0 Mon Sep 17 00:00:00 2001 From: Augusto Date: Tue, 8 Jun 2021 12:02:51 +0100 Subject: [PATCH 10/19] Clarify instructution for exercise `pilot` --- subjects/pilot/README.md | 6 +++++- 1 file changed, 5 insertions(+), 1 deletion(-) diff --git a/subjects/pilot/README.md b/subjects/pilot/README.md index e3b7f370..c12200d7 100644 --- a/subjects/pilot/README.md +++ b/subjects/pilot/README.md @@ -2,7 +2,11 @@ ### Instructions -Append to the code below what is needed so that the program compiles. +- Create a directory called `pilot`. +- Inside the directory `pilot` create a file `main.go`. +- Copy the code below to `main.go` and add the code needed so that the program compiles. + +> Note: You can only add code, not delete. ### Usage From 7d693b518b7333c8f152d7171b94bd48f8427ac4 Mon Sep 17 00:00:00 2001 From: Augusto Date: Tue, 8 Jun 2021 12:09:09 +0100 Subject: [PATCH 11/19] Add link to the explanation of `zero values` in go` --- subjects/compact/README.md | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/subjects/compact/README.md b/subjects/compact/README.md index 709d5c72..2a3470be 100644 --- a/subjects/compact/README.md +++ b/subjects/compact/README.md @@ -2,10 +2,10 @@ ### Instructions -Write a function `Compact` that takes a pointer to a slice of `string` as the argument. +Write a function `Compact` that takes a pointer to a slice of `string`s as the argument. This function must: -- Return the number of elements with non-zero value. +- Return the number of elements with [non-zero value](https://tour.golang.org/basics/12). - Compact, i.e., delete the elements with zero-values in the slice. From 7d8872744a26eebbba9d55d10313a54a34e775d5 Mon Sep 17 00:00:00 2001 From: Augusto Date: Tue, 8 Jun 2021 12:17:29 +0100 Subject: [PATCH 12/19] Fix typo in `unmatched` instructions` --- subjects/unmatch/README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/subjects/unmatch/README.md b/subjects/unmatch/README.md index 5e071a7f..25de0b7a 100644 --- a/subjects/unmatch/README.md +++ b/subjects/unmatch/README.md @@ -4,7 +4,7 @@ Write a function, `Unmatch`, that returns the element of the slice that does not have a correspondent pair. -- If all the number have a correspondent pair, it shoud return `-1`. +- If all the number have a correspondent pair, it should return `-1`. ### Expected function From 86f550a54564a71098964fa53efedebf9980ef0e Mon Sep 17 00:00:00 2001 From: Augusto Date: Tue, 8 Jun 2021 12:21:09 +0100 Subject: [PATCH 13/19] Fix grammar and phrasing of instructions of `join` exercise --- subjects/join/README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/subjects/join/README.md b/subjects/join/README.md index fdf73457..6fb436ee 100644 --- a/subjects/join/README.md +++ b/subjects/join/README.md @@ -2,7 +2,7 @@ ### Instructions -Write a function that simulates the behaviour of the `Join` function in Go. This function returns the concatenation of all the strings of a slice of strings **separated** by a separator passed in argument. +Write a function that returns the concatenation of all the `string`s of a slice of `string`s **separated** by the separator passed in the argument `sep`. ### Expected function From 9fae2e59686da6483fc1e06b8c781061f6c703f3 Mon Sep 17 00:00:00 2001 From: Augusto Date: Tue, 8 Jun 2021 13:34:09 +0100 Subject: [PATCH 14/19] Add notions of the binary trees --- subjects/btreeinsertdata/README.md | 6 +++++- 1 file changed, 5 insertions(+), 1 deletion(-) diff --git a/subjects/btreeinsertdata/README.md b/subjects/btreeinsertdata/README.md index 7b637a78..558ba57d 100644 --- a/subjects/btreeinsertdata/README.md +++ b/subjects/btreeinsertdata/README.md @@ -2,10 +2,14 @@ ### Instructions -Write a function that inserts new data in a binary search tree following the properties of binary search trees. +Write a function that inserts new data in a `binary search tree` following the special properties of a `binary search trees`. The nodes must be defined as follows : +### Notions + +- [binary search trees](https://en.wikipedia.org/wiki/Binary_search_tree) + ### Expected function ```go From c96169c4e37705ebbad5cfd192cc3593790c880e Mon Sep 17 00:00:00 2001 From: Augusto Date: Tue, 8 Jun 2021 13:55:01 +0100 Subject: [PATCH 15/19] Add notions for the tree traversal exercises --- subjects/btreeapplyinorder/README.md | 6 +++++- subjects/btreeapplypostorder/README.md | 6 +++++- subjects/btreeapplypreorder/README.md | 6 +++++- 3 files changed, 15 insertions(+), 3 deletions(-) diff --git a/subjects/btreeapplyinorder/README.md b/subjects/btreeapplyinorder/README.md index ac93b868..4b4c99f1 100644 --- a/subjects/btreeapplyinorder/README.md +++ b/subjects/btreeapplyinorder/README.md @@ -2,7 +2,11 @@ ### Instructions -Write a function that applies a function in order to each element in the tree (see "in order tree walks"). +Write a function that applies a given function `f`, **in order**, to each element in the tree. + +### Notions + +- [Tree Traversal](https://en.wikipedia.org/wiki/Tree_traversal) ### Expected function diff --git a/subjects/btreeapplypostorder/README.md b/subjects/btreeapplypostorder/README.md index 80bf85b9..4c5f6121 100644 --- a/subjects/btreeapplypostorder/README.md +++ b/subjects/btreeapplypostorder/README.md @@ -2,7 +2,11 @@ ### Instructions -Write a function that applies a function using a postorder walk to each element in the tree. +Write a function that applies a given function `f`, to each element in the tree using a postorder walk. + +### Notions + +- [Tree Traversal](https://en.wikipedia.org/wiki/Tree_traversal) ### Expected function diff --git a/subjects/btreeapplypreorder/README.md b/subjects/btreeapplypreorder/README.md index b60cd9a5..5c9f154a 100644 --- a/subjects/btreeapplypreorder/README.md +++ b/subjects/btreeapplypreorder/README.md @@ -2,7 +2,11 @@ ### Instructions -Write a function that applies a function using a preorder walk to each element in the tree. +Write a function that applies a given function `f` to each element in the tree using a preorder walk. + +### Notions + +- [Tree Traversal](https://en.wikipedia.org/wiki/Tree_traversal) ### Expected function From da117bbf261d369080aae3cd37be2805884d6b96 Mon Sep 17 00:00:00 2001 From: Augusto Date: Tue, 8 Jun 2021 13:57:24 +0100 Subject: [PATCH 16/19] Clarify instructions for the exercise `btreesearchitem` --- subjects/btreesearchitem/README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/subjects/btreesearchitem/README.md b/subjects/btreesearchitem/README.md index 67b29d08..a364f57a 100644 --- a/subjects/btreesearchitem/README.md +++ b/subjects/btreesearchitem/README.md @@ -2,7 +2,7 @@ ### Instructions -Write a function that searches for a node with a data element equal to `elem`and that returns that node. +Write a function that returns the `TreeNode` with a `data` field equal to `elem` if it exists in the tree, otherwise return `nil`. ### Expected function From 28840611b2ffefb72740812318f2e6f0dce1d165 Mon Sep 17 00:00:00 2001 From: Augusto Date: Tue, 8 Jun 2021 14:03:34 +0100 Subject: [PATCH 17/19] Add a link for the binary trees definition --- subjects/btreeisbinary/README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/subjects/btreeisbinary/README.md b/subjects/btreeisbinary/README.md index 7d57aa7b..d3a03faf 100644 --- a/subjects/btreeisbinary/README.md +++ b/subjects/btreeisbinary/README.md @@ -2,7 +2,7 @@ ### Instructions -Write a function, `BTreeIsBinary`, that returns `true` only if the tree given by `root` follows the binary search tree properties. +Write a function, `BTreeIsBinary`, that returns `true` only if the tree given by `root` follows the binary search tree [properties](https://en.wikipedia.org/wiki/Binary_search_tree#Definition). ### Expected function From bd67fd2b5fc915c0919a984ee66cd7eda6aa67a8 Mon Sep 17 00:00:00 2001 From: Augusto Date: Tue, 8 Jun 2021 14:06:08 +0100 Subject: [PATCH 18/19] Fix typo --- subjects/btreeapplybylevel/README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/subjects/btreeapplybylevel/README.md b/subjects/btreeapplybylevel/README.md index 49854009..c9594c1b 100644 --- a/subjects/btreeapplybylevel/README.md +++ b/subjects/btreeapplybylevel/README.md @@ -2,7 +2,7 @@ ### Instructions -Write a function, `BTreeApplyByLevel`, that applies the function given by `fn` to each node of the tree given by `root`. +Write a function, `BTreeApplyByLevel`, that applies the function given by `f`, to each node of the tree given by `root`. ### Expected function From 64280edf52102b9a74f77176a93ab141f4ef0b97 Mon Sep 17 00:00:00 2001 From: Augusto Date: Fri, 17 Sep 2021 15:10:16 +0100 Subject: [PATCH 19/19] Fix typo --- subjects/recursivepower/README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/subjects/recursivepower/README.md b/subjects/recursivepower/README.md index 580e17c9..b4e92614 100644 --- a/subjects/recursivepower/README.md +++ b/subjects/recursivepower/README.md @@ -2,7 +2,7 @@ ### Instructions -Write a **recursive** function that returns the the value of `nb` to the power `power`. +Write a **recursive** function that returns the value of `nb` to the power of `power`. Negative powers will return `0`. Overflows do **not** have to be dealt with.