Merge pull request #6 from jakubjirous/feature/index

Index.md

Author: Jakub Jirous

README.md

@@ -22,6 +22,6 @@ Developers compete by writing programs according to provided specifications.
 
 ### Preparation Kit
 
-1. [Plus Minus](/src/challenges/01-plus-minus/)
-2. [Mini-Max Sum](/src/challenges/02-mini-max-sum/)
-3. [Time Conversion](/src/challenges/03-time-conversion/)
+1. [Plus Minus](/src/challenges/01-plus-minus/INDEX.md)
+2. [Mini-Max Sum](/src/challenges/02-mini-max-sum/INDEX.md)
+3. [Time Conversion](/src/challenges/03-time-conversion/INDEX.md)

src/challenges/01-plus-minus/INDEX.md

@@ -0,0 +1,84 @@
+# Plus Minus
+
+Given an array of integers, calculate the ratios of its elements that are positive, negative, and zero.
+
+Print the decimal value of each fraction on a new line with `6` places after the decimal.
+
+---
+
+### Note:
+
+This challenge introduces precision problems. The test cases are scaled to six decimal places, though answers with absolute error of up to $10^{-1}$ are acceptable.
+
+### Example:
+
+- `inputArray = [1, 1, 0, -1, -1]`
+- There are `n = 5` elements, two positive, two negative and one zero. Their ratios are $\frac{2}{5} = 0.400000$, $\frac{2}{5} = 0.400000$ and $\frac{1}{5} = 0.200000$.
+- Results are printed as:
+ - `0.40000`
+ - `0.40000`
+ - `0.20000`
+
+### Function Description:
+
+- Complete the plusMinus function in the editor below.
+- `plusMinus` has the following parameter(s):
+ - `inputArray[n]`: an array of integers
+
+### Print:
+
+- Print the ratios of positive, negative and zero values in the array.
+- Each value should be printed on a separate line with digits after the decimal.
+- The function should not return a value.
+
+### Input Format:
+
+- The first line contains an integer, `n`, the size of the array.
+- The second line contains `n` space-separated integers that describe `inputArray[n]`.
+
+### Constraints:
+
+- $0 \le n \le 100$
+- $-100 \le inputArray[i] \le 100$
+
+### Output Format:
+
+- Print the following `3` lines, each to `6` decimals:
+
+ 1) proportion of positive values
+ 2) proportion of negative values
+ 3) proportion of zeros
+
+---
+
+### Sample Input:
+
+```
+STDIN Function
+----- --------
+6 inputArray[] size n = 6
+-4 3 -9 0 4 1 inputArray = [-4, 3, -9, 0, 4, 1]
+```
+
+### Sample Output:
+
+```
+0.500000
+0.333333
+0.166667
+```
+
+### Explanation:
+
+- There are `3` positive numbers, `2` negative numbers, and `1` zero in the array.
+- The proportions of occurrence are:
+ - positive: $\frac{3}{6} = 0.500000$
+ - negative: $\frac{2}{6} = 0.333333$
+ - zeros: $\frac{1}{6} = 0.166667$
+
+---
+
+### Solution:
+
+- [Code](/src/challenges/01-plus-minus/plus-minus.ts)
+- [Tests](/src/challenges/01-plus-minus/test/plus-minus.test.ts)

src/challenges/02-mini-max-sum/INDEX.md

@@ -0,0 +1,68 @@
+# Mini-Max Sum
+
+Given five positive integers, find the minimum and maximum values that can be calculated by summing exactly four of the five integers. Then print the respective minimum and maximum values as a single line of two space-separated long integers.
+
+---
+
+### Example:
+
+- `inputArray = [1, 3, 5, 7, 9]`
+- The minimum sum is `1 + 3 + 5 + 7 = 16` and the maximum sum is `3 + 5 + 7 + 9 = 24`. 
+- The function prints `16 24`
+
+### Function Description:
+
+- Complete the miniMaxSum function in the editor below.
+- `miniMaxSum` has the following parameter(s):
+- `inputArray`: an array of `5` integers
+
+### Print:
+
+- Print two space-separated integers on one line: the minimum sum and the maximum sum of `4` of `5` elements.
+
+### Input Format:
+
+- A single line of five space-separated integers.
+
+### Constraints:
+
+- $1 \le inputArray[i] \le 10^9$
+
+### Output Format:
+
+- Print two space-separated long integers denoting the respective minimum and maximum values that can be calculated by summing exactly four of the five integers. 
+- The output can be greater than a 32-bit integer.
+
+
+---
+
+### Sample Input:
+
+```
+1 2 3 4 5
+```
+
+### Sample Output:
+
+```
+10 14
+```
+
+### Explanation:
+
+The numbers are `1, 2, 3, 4,` and `5`.
+
+Calculate the following sums using four of the five integers:
+
+1) Sum everything except `1`, the sum is `2 + 3 + 4 + 5 = 14`.
+2) Sum everything except `2`, the sum is `1 + 3 + 4 + 5 = 13`.
+3) Sum everything except `3`, the sum is `1 + 2 + 4 + 5 = 12`.
+4) Sum everything except `4`, the sum is `1 + 2 + 3 + 5 = 11`.
+5) Sum everything except `5`, the sum is `1 + 2 + 3 + 4 = 10`.
+
+---
+
+### Solution:
+
+- [Code](/src/challenges/02-mini-max-sum/mini-max-sum.ts)
+- [Tests](/src/challenges/02-mini-max-sum/test/mini-max-sum.test.ts)

src/challenges/02-mini-max-sum/mini-max-sum.ts

@@ -5,18 +5,9 @@ export type Output = [number, number];
  * Given five positive integers, find the minimum and maximum values that can be calculated by summing exactly four of the five integers. Then
  * print the respective minimum and maximum values as a single line of two space-separated long integers.
  *
- * Explanation:
- * - The numbers are 1, 2, 3, 4, and 5.
- * - Calculate the following sums using four of the five integers:
- * - 1) Sum everything except 1, the sum is 2 + 3 + 4 + 5 = 14.
- * - 2) Sum everything except 2, the sum is 1 + 3 + 4 + 5 = 13.
- * - 3) Sum everything except 3, the sum is 1 + 2 + 4 + 5 = 12.
- * - 4) Sum everything except 4, the sum is 1 + 2 + 3 + 5 = 11.
- * - 5) Sum everything except 5, the sum is 1 + 2 + 3 + 4 = 10.
- *
  * Output Format:
  * - Print two space-separated long integers denoting the respective minimum and maximum values that can be calculated by summing exactly four of the five integers.
- * - The output can be greater than a 32 bit integer.
+ * - The output can be greater than a 32-bit integer.
  *
  * Example:
  * - inputArray = [1, 3, 5, 7, 9]

src/challenges/03-time-conversion/INDEX.md

@@ -17,7 +17,7 @@ Given a time in 12-hour AM/PM format, convert it to military (24-hour) time.
 
 ### Function Description:
 
-- Complete the `timeConversion` function in the editor below. It should return a new string representing the input time in 24 hour format.
+- Complete the `timeConversion` function in the editor below. It should return a new string representing the input time in 24-hour format.
 
 - `timeConversion` has the following parameter(`s`):
  - string `s`: a time in 12-hour format
@@ -47,3 +47,10 @@ Given a time in 12-hour AM/PM format, convert it to military (24-hour) time.
 ```
 19:05:45
 ```
+
+---
+
+### Solution:
+
+- [Code](/src/challenges/03-time-conversion/time-conversion.ts)
+- [Tests](/src/challenges/03-time-conversion/test/time-conversion.test.ts)