Skip to content

Commit 5fbc28e

Browse files
authored
Merge pull request #28 from sir-gon/feature/plus_minus
[Hacker Rank]: Warmup: Plus Minus. Solved ✅.
2 parents 5d48be1 + d6ef608 commit 5fbc28e

File tree

5 files changed

+186
-0
lines changed

5 files changed

+186
-0
lines changed

docs/hackerrank/warmup/plus_minus.md

Lines changed: 80 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,80 @@
1+
# [Plus Minus](https://www.hackerrank.com/challenges/plus-minus)
2+
3+
Difficulty: #easy
4+
Category: #warmup
5+
6+
Given an array of integers, calculate the ratios of its elements
7+
that are positive, negative, and zero. Print the decimal value of
8+
each fraction on a new line with 6 places after the decimal.
9+
10+
**Note**: This challenge introduces precision problems.
11+
The test cases are scaled to six decimal places, though answers
12+
with absolute error of up to $ 10^{-4} $ are acceptable.
13+
14+
## Example
15+
16+
$ arr = [1, 1, 0, -1, -1] $
17+
18+
There are $ n = 5 $ elements, two positive, two negative and one zero.
19+
Their ratios are $ 2/5 = 0.400000 $, $ 2/5 = 0.400000 $ and $ 1/5 = 0.200000 $.
20+
Results are printed as:
21+
22+
```text
23+
0.400000
24+
0.400000
25+
0.200000
26+
```
27+
28+
## Function Description
29+
30+
Complete the plusMinus function in the editor below.
31+
plusMinus has the following parameter(s):
32+
33+
- int arr[n]: an array of integers
34+
35+
## Print
36+
37+
Print the ratios of positive, negative and zero values in the array.
38+
Each value should be printed on a separate line with $ 6 $ digits after
39+
the decimal. The function should not return a value.
40+
41+
## Input Format
42+
43+
The first line contains an integer, `n`, the size of the array.
44+
The second line contains `n` space-separated integers that describe `arr[n]`.
45+
46+
## Constraints
47+
48+
$ 0 < n \leq 100 $ \
49+
$ -100 \leq arr[i] \leq 100 $
50+
51+
## Output Format
52+
53+
**Print** the following lines, each to decimals:
54+
55+
1. proportion of positive values
56+
2. proportion of negative values
57+
3. proportion of zeros
58+
59+
## Sample Input
60+
61+
```text
62+
STDIN Function
63+
----- --------
64+
6 arr[] size n = 6
65+
-4 3 -9 0 4 1 arr = [-4, 3, -9, 0, 4, 1]
66+
```
67+
68+
## Sample Output
69+
70+
```text
71+
0.500000
72+
0.333333
73+
0.166667
74+
```
75+
76+
## Explanation
77+
78+
There are $ 3 $ positive numbers, negative numbers, and $ 1 $ zero in the array.
79+
The proportions of occurrence are positive: $ 3/6 = 0.500000 $,
80+
negative: $ 2/6 = 0.333333 $ and zeros: $ 1/6 = 0.166667 $.
Lines changed: 8 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,8 @@
1+
#include <string>
2+
#include <vector>
3+
#pragma once
4+
5+
namespace hackerrank::warmup {
6+
std::vector<std::string> plusMinusCalculate(const std::vector<int> &arr);
7+
void plusMinus(const std::vector<int> &arr);
8+
} // namespace hackerrank::warmup
Lines changed: 62 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,62 @@
1+
#include <exercises/hackerrank/warmup/plus_minus.hpp>
2+
3+
/**
4+
* @link Problem definition [[docs/hackerrank/warmup/plus_minus.md]]
5+
*/
6+
7+
#include <iostream>
8+
#include <string>
9+
#include <vector>
10+
11+
#define BUFFER_MAX_SIZE 100
12+
13+
std::string format_result(double number) {
14+
char buffer[BUFFER_MAX_SIZE];
15+
16+
snprintf(buffer, BUFFER_MAX_SIZE, "%0.6lf", number);
17+
std::string formatted = buffer;
18+
19+
return formatted;
20+
}
21+
22+
namespace hackerrank::warmup {
23+
std::vector<std::string> plusMinusCalculate(const std::vector<int> &arr) {
24+
unsigned long positives = 0;
25+
int negatives = 0;
26+
int zeros = 0;
27+
28+
for (const int &value : arr) {
29+
if (value > 0) {
30+
positives += 1;
31+
}
32+
if (value < 0) {
33+
negatives += 1;
34+
}
35+
if (value == 0) {
36+
zeros += 1;
37+
}
38+
}
39+
40+
std::vector<double> results = {
41+
static_cast<double>(positives) / static_cast<double>(arr.size()),
42+
static_cast<double>(negatives) / static_cast<double>(arr.size()),
43+
static_cast<double>(zeros) / static_cast<double>(arr.size())};
44+
45+
std::vector<std::string> answer = {};
46+
47+
for (double tmp : results) {
48+
std::string formatted = format_result(tmp);
49+
answer.emplace_back(formatted);
50+
}
51+
52+
return answer;
53+
}
54+
55+
void plusMinus(const std::vector<int> &arr) {
56+
std::vector<std::string> output = plusMinusCalculate(arr);
57+
58+
for (const std::string &line : output) {
59+
std::cout << line << std::endl;
60+
}
61+
}
62+
} // namespace hackerrank::warmup
Lines changed: 29 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,29 @@
1+
#include <catch2/catch_test_macros.hpp>
2+
3+
#include <exercises/hackerrank/warmup/plus_minus.hpp>
4+
#include <iostream>
5+
#include <stdexcept>
6+
#include <vector>
7+
8+
#include <filesystem>
9+
#include <fstream>
10+
#include <nlohmann/json.hpp>
11+
using json = nlohmann::json;
12+
13+
TEST_CASE("plusMinus JSON Test Cases", "[warmup]") {
14+
std::filesystem::path cwd = std::filesystem::current_path();
15+
std::string path =
16+
cwd.string() + "/unit/lib/hackerrank/warmup/plus_minus.testcases.json";
17+
18+
INFO("plusMinus JSON test cases FILE: " << path);
19+
20+
std::ifstream f(path);
21+
json data = json::parse(f);
22+
23+
for (auto testcase : data) {
24+
hackerrank::warmup::plusMinus(testcase["input"]);
25+
std::vector<std::string> result =
26+
hackerrank::warmup::plusMinusCalculate(testcase["input"]);
27+
CHECK(result == testcase["expected"]);
28+
}
29+
}
Lines changed: 7 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,7 @@
1+
[
2+
{
3+
"title": "test case 0",
4+
"input": [-4, 3, -9, 0, 4, 1],
5+
"expected": ["0.500000", "0.333333", "0.166667"]
6+
}
7+
]

0 commit comments

Comments
 (0)