1
1
mirror of https://github.com/theoludwig/programming-challenges.git synced 2024-11-09 22:08:58 +01:00

feat(challenges): add find-closest-number

This commit is contained in:
Divlo 2022-05-01 19:05:41 +02:00
parent a6fee4de05
commit 4e7cad4a70
No known key found for this signature in database
GPG Key ID: 8F9478F220CE65E9
12 changed files with 132 additions and 0 deletions

View File

@ -0,0 +1,73 @@
# find-closest-number
Created by [@Divlo](https://github.com/Divlo) on 1 May 2022.
## Instructions
Given an array of `n` integers, find the closest value to the given number (`given_number`).
## Input
- **Line 1:** An integer `given_number` for the number to find the closest value to
- **Line 2:** An integer `n` for the length of the list of integers
- **`n` next lines:** the integers
## Output
The closest value in the array to the given number.
## Examples
See the `test` folder for examples of input/output.
### Example 1
#### Input
```txt
3
6
1
2
3
4
5
6
```
#### Output
```txt
3
```
**Explanation:** The given number is `3` and `3` is in the array, so the closest value is `3`.
### Example 2
#### Input
```txt
0
14
7
-10
13
8
4
-7
-12
-3
3
-9
6
-1
-6
7
```
#### Output
```txt
-1
```

View File

@ -0,0 +1,8 @@
3
6
1
2
3
4
5
6

View File

@ -0,0 +1 @@
3

View File

@ -0,0 +1,16 @@
0
14
7
-10
13
8
4
-7
-12
-3
3
-9
6
-1
-6
7

View File

@ -0,0 +1 @@
-1

View File

@ -0,0 +1,12 @@
80
10
2
42
82
122
162
202
242
282
322
362

View File

@ -0,0 +1 @@
82

View File

@ -0,0 +1,10 @@
11
8
1
2
4
5
6
6
8
9

View File

@ -0,0 +1 @@
9

View File

@ -0,0 +1,8 @@
4
6
2
5
6
7
8
9

View File

@ -0,0 +1 @@
5