From 0839b4a15fd099e495535e770f4eb5b85e2e9188 Mon Sep 17 00:00:00 2001
From: Gonzalo Diaz <devel@gon.cl>
Date: Sat, 3 Aug 2024 03:31:15 -0400
Subject: [PATCH] =?UTF-8?q?[Hacker=20Rank]=20Interview=20Preparation=20Kit?=
 =?UTF-8?q?:=20Greedy=20Algorithms:=20Max=20Min.=20Solved=20=E2=9C=85.?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 .../greedy_algorithms/angry-children.md       | 144 ++++++++++++++++++
 .../greedy_algorithms/angry_children.test.ts  |  22 +++
 .../angry_children.testcases.json             |  26 ++++
 .../greedy_algorithms/angry_children.ts       |  19 +++
 4 files changed, 211 insertions(+)
 create mode 100644 docs/hackerrank/interview_preparation_kit/greedy_algorithms/angry-children.md
 create mode 100644 src/hackerrank/interview_preparation_kit/greedy_algorithms/angry_children.test.ts
 create mode 100644 src/hackerrank/interview_preparation_kit/greedy_algorithms/angry_children.testcases.json
 create mode 100644 src/hackerrank/interview_preparation_kit/greedy_algorithms/angry_children.ts

diff --git a/docs/hackerrank/interview_preparation_kit/greedy_algorithms/angry-children.md b/docs/hackerrank/interview_preparation_kit/greedy_algorithms/angry-children.md
new file mode 100644
index 00000000..d731e3f7
--- /dev/null
+++ b/docs/hackerrank/interview_preparation_kit/greedy_algorithms/angry-children.md
@@ -0,0 +1,144 @@
+
+# [Greedy Algorithms: Max Min](https://www.hackerrank.com/challenges/angry-children)
+
+- Difficulty:  `#medium`
+- Category: `#ProblemSolvingBasic` `#greedy`
+
+You will be given a list of integers, `arr`, and a single integer `k`.
+You must create an array of length `k` from elements of `arr` such that
+its unfairness is minimized.
+Call that array `arr'`.
+Unfairness of an array is calculated as
+
+$$
+\textsf{\textbf{max(arr')}} - \textsf{\textbf{min(arr')}}
+$$
+
+Where:
+
+- max denotes the largest integer in `arr'`.
+- min denotes the smallest integer in `arr'`.
+
+## Example
+
+`arr = [1, 4, 7, 2]`
+`k = 2`
+
+Pick any two elements, say `arr' = [4, 7]`.
+
+$ \textsf{\textbf{unfairness}}
+    =
+    \textsf{\textbf{max(4, 7)}}
+    -
+    \textsf{\textbf{min(4, 7)}}
+    = 7 - 4 = 3
+$
+
+Testing for all pairs, the solution [1, 2] provides the minimum unfairness.
+
+**Note**: Integers in `arr` may not be unique.
+
+## Function Description
+
+Complete the maxMin function in the editor below.
+maxMin has the following parameter(s):
+
+- `int k`: the number of elements to select
+- `int arr[n]`: an array of integers
+
+## Returns
+
+- int: the minimum possible unfairness
+
+## Input Format
+
+The first line contains an integer , the number of elements in array .
+The second line contains an integer .
+Each of the next  lines contains an integer  where .
+
+## Constraints
+
+- $ 2 \leq n \leq 10^5 $
+- $ 2 \leq k \leq n $
+- $ 0 \leq arr[i] \leq 10^9 $
+
+## Sample Input 0
+
+```text
+7
+3
+10
+100
+300
+200
+1000
+20
+30
+```
+
+## Sample Output 0
+
+```text
+20
+```
+
+## Explanation 0
+
+Here `k = 3`; selecting the `3` integers `10, 20,30`, unfairness equals
+
+```text
+max(10,20,30) - min(10,20,30) = 30 - 10 = 20
+```
+
+## Sample Input 1
+
+```text
+10
+4
+1
+2
+3
+4
+10
+20
+30
+40
+100
+200
+```
+
+## Sample Output 1
+
+```text
+3
+```
+
+## Explanation 1
+
+Here `k = 4`; selecting the `4` integers `1, 2, 3, 4`, unfairness equals
+
+```text
+max(1,2,3,4) - min(1,2,3,4) = 4 - 1 = 3
+```
+
+## Sample Input 2
+
+```text
+5
+2
+1
+2
+1
+2
+1
+```
+
+## Sample Output 2
+
+```text
+0
+```
+
+## Explanation 2
+
+Here `k = 2`. `arr' = [2, 2]` or `arr' = [1, 1]` give the minimum unfairness of `0`.
diff --git a/src/hackerrank/interview_preparation_kit/greedy_algorithms/angry_children.test.ts b/src/hackerrank/interview_preparation_kit/greedy_algorithms/angry_children.test.ts
new file mode 100644
index 00000000..47c9d9a9
--- /dev/null
+++ b/src/hackerrank/interview_preparation_kit/greedy_algorithms/angry_children.test.ts
@@ -0,0 +1,22 @@
+import { describe, expect, it } from '@jest/globals';
+import { logger as console } from '../../../logger';
+
+import { maxMin } from './angry_children';
+
+import TEST_CASES from './angry_children.testcases.json';
+
+describe('luck-balance', () => {
+  it('luckBalance test cases', () => {
+    expect.assertions(4);
+
+    TEST_CASES.forEach((test) => {
+      const answer = maxMin(test.k, test.arr);
+
+      console.debug(
+        `luckBalance(${test.k}, ${test.arr}) solution found: ${answer}`
+      );
+
+      expect(answer).toStrictEqual(test.expected);
+    });
+  });
+});
diff --git a/src/hackerrank/interview_preparation_kit/greedy_algorithms/angry_children.testcases.json b/src/hackerrank/interview_preparation_kit/greedy_algorithms/angry_children.testcases.json
new file mode 100644
index 00000000..ae4f1379
--- /dev/null
+++ b/src/hackerrank/interview_preparation_kit/greedy_algorithms/angry_children.testcases.json
@@ -0,0 +1,26 @@
+[
+    {
+        "title": "Sample Test case 0",
+        "k": 3,
+        "arr": [10, 100, 300, 200, 1000, 20, 30],
+        "expected": 20
+    },
+    {
+        "title": "Sample Test case 1",
+        "k": 4,
+        "arr": [1, 2, 3, 4, 10, 20, 30, 40, 100, 200],
+        "expected": 3
+    },
+    {
+        "title": "Sample Test case 2",
+        "k": 2,
+        "arr": [1, 2, 1, 2, 1],
+        "expected": 0
+    },
+    {
+        "title": "Sample Test case 16",
+        "k": 3,
+        "arr": [100, 200, 300, 350, 400, 401, 402],
+        "expected": 2
+    }
+]
diff --git a/src/hackerrank/interview_preparation_kit/greedy_algorithms/angry_children.ts b/src/hackerrank/interview_preparation_kit/greedy_algorithms/angry_children.ts
new file mode 100644
index 00000000..2a53f148
--- /dev/null
+++ b/src/hackerrank/interview_preparation_kit/greedy_algorithms/angry_children.ts
@@ -0,0 +1,19 @@
+/**
+ * @link Problem definition [[docs/hackerrank/interview_preparation_kit/greedy_algorithms/angry-children.md]]
+ */
+
+export function maxMin(k: number, arr: number[]): number {
+  const sortedlist = arr
+    .map((x: number): number => x)
+    .sort((a: number, b: number): number => a - b);
+
+  let result = sortedlist[sortedlist.length - 1] - sortedlist[0];
+
+  for (let i = 0; i < sortedlist.length - k + 1; i++) {
+    const tmin = sortedlist[i];
+    const tmax = sortedlist[i + k - 1];
+    result = Math.min(result, tmax - tmin);
+  }
+
+  return result;
+}