mirror of https://github.com/01-edu/public.git
docs(find-expression): correct grammar
This commit is contained in:
parent
b33aa039d8
commit
f35edc1253
|
@ -2,25 +2,22 @@
|
|||
|
||||
### Instructions
|
||||
|
||||
Create a function called `findExpression` that takes a number as parameter and returns a string
|
||||
|
||||
- It will be given two constant variable `add4` and `mul2`
|
||||
|
||||
- Your goal is to try to find a sequence, starting from the number 1, and repeatedly either adding 4 or multiplying 2
|
||||
that produces the number given has parameter.
|
||||
For example, the number 8 you must first multiplying by 2 twice and then add 4.
|
||||
It will look something like this `1 *2 *2 +4`
|
||||
Create a function named `findExpression` that takes a `number` as parameter and returns a `string`.
|
||||
|
||||
- 2 constant variables will be made available to your function: `add4` and `mul2`.
|
||||
- Your goal is to try to find a sequence, starting from the number 1, and repeatedly either adding 4 or multiplying by 2, to produce the number given as a parameter.
|
||||
- If the number can not be reached you should return `undefined`
|
||||
|
||||
For example, for the number `8`, you must first multiply by 2 twice, and then add 4. Your function should return something like: `1 *2 *2 +4`.
|
||||
|
||||
### Notions
|
||||
|
||||
- [nan-academy.github.io/js-training/examples/loops.js](https://nan-academy.github.io/js-training/examples/loops.js)
|
||||
- [nan-academy.github.io/js-training/examples/recursion.js](https://nan-academy.github.io/js-training/examples/recursion.js)
|
||||
- [Loops](https://nan-academy.github.io/js-training/examples/loops.js)
|
||||
- [Recursion](https://nan-academy.github.io/js-training/examples/recursion.js)
|
||||
|
||||
### Code provided
|
||||
|
||||
> all code provided will be added to your solution and doesn't need to be submited.
|
||||
> The provided code will be added to your solution, and does not need to be submitted.
|
||||
|
||||
```js
|
||||
const add4 = '+4'
|
||||
|
|
Loading…
Reference in New Issue