From 205cc5f26261cd46ed69d2e07da61fe99dd0cc2e Mon Sep 17 00:00:00 2001
From: Gonzalo Diaz <gonzalo@gon.cl>
Date: Fri, 21 Jul 2023 00:54:10 -0400
Subject: [PATCH] =?UTF-8?q?[Hacker=20Rank]:=20Jumping=20on=20the=20Clouds?=
 =?UTF-8?q?=20solved=20=E2=9C=93?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 .../implementation/jumpingOnClouds.test.ts    |  31 ++++
 .../implementation/jumpingOnClouds.ts         | 137 ++++++++++++++++++
 2 files changed, 168 insertions(+)
 create mode 100644 src/hackerrank/implementation/jumpingOnClouds.test.ts
 create mode 100644 src/hackerrank/implementation/jumpingOnClouds.ts

diff --git a/src/hackerrank/implementation/jumpingOnClouds.test.ts b/src/hackerrank/implementation/jumpingOnClouds.test.ts
new file mode 100644
index 0000000..fb01c7f
--- /dev/null
+++ b/src/hackerrank/implementation/jumpingOnClouds.test.ts
@@ -0,0 +1,31 @@
+import logger from '../../logger';
+
+import { jumpingOnClouds } from './jumpingOnClouds';
+
+describe('Jumping on the Clouds', () => {
+  it('Jumping on the Clouds Test case 0', () => {
+    expect.assertions(1);
+
+    const input = [0, 0, 1, 0, 0, 1, 0];
+    const solutionFound = 4;
+
+    const calculated = jumpingOnClouds(input);
+
+    logger.info(`Jumping on the Clouds Test case 0: ${calculated}`);
+
+    expect(calculated).toBe(solutionFound);
+  });
+
+  it('Jumping on the Clouds Test case 1', () => {
+    expect.assertions(1);
+
+    const input = [0, 0, 0, 1, 0, 0];
+    const solutionFound = 3;
+
+    const calculated = jumpingOnClouds(input);
+
+    logger.info(`Jumping on the Clouds Test case 1: ${calculated}`);
+
+    expect(calculated).toBe(solutionFound);
+  });
+});
diff --git a/src/hackerrank/implementation/jumpingOnClouds.ts b/src/hackerrank/implementation/jumpingOnClouds.ts
new file mode 100644
index 0000000..26ae52e
--- /dev/null
+++ b/src/hackerrank/implementation/jumpingOnClouds.ts
@@ -0,0 +1,137 @@
+/**
+ * Jumping on the Clouds
+ *
+ * https://www.hackerrank.com/challenges/jumping-on-the-clouds
+ *
+ * There is a new mobile game that starts with consecutively numbered clouds.
+ * Some of the clouds are thunderheads and others are cumulus. The player can
+ * jump on any cumulus cloud having a number that is equal to the number of the
+ * current cloud plus 1 or 2. The player must avoid the thunderheads. Determine
+ * the minimum number of jumps it will take to jump from the starting postion
+ * to the last cloud. It is always possible to win the game.
+ *
+ * For each game, you will get an array of clouds numbered 0 if they are safe
+ * or 1 if they must be avoided.
+ *
+ * # Example
+ * c = [0, 1, 0, 0, 0, 1, 0]
+ *
+ * Index the array from 0...6. The number on each cloud is its index in the
+ * list so the player must avoid the clouds at indices 1 and 5. They could
+ * follow these two paths: 0 -> 2 -> 4 -> 6 or 0 -> 2 -> 3 -> 4 -> 6.
+ * The first path takes 3 jumps while the second takes 4. Return 3.
+ *
+ * # Function Description
+ *
+ * Complete the jumpingOnClouds function in the editor below.
+ *
+ * jumpingOnClouds has the following parameter(s):
+ *
+ * * int c[n]: an array of binary integers
+ *
+ * # Returns
+ * * int: the minimum number of jumps required
+ *
+ * # Input Format
+ * The first line contains an integer n, the total number of clouds.
+ * The second line contains n space-separated binary integers describing
+ * clouds c[i] where 0 <= i < n.
+ *
+ * # Constraints
+ * 2 <= n < 100
+ * c[i] ∈ {0, 1}
+ * c[0] = c[m -1] = 0
+ *
+ * # Output format
+ * Print the minimum number of jumps needed to win the game.
+ *
+ * # Sample Input 0
+ * ```
+ * 7
+ * 0 0 1 0 0 1 0
+ *
+ * # Sample Output 0
+ * ```
+ * 4
+ * ```
+ *
+ * # Explanation 0:
+ *
+ * The player must avoid c[2] and c[5]. The game can be won with a minimum
+ * of 4 jumps:
+ *
+ * ```mermaid
+ * flowchart BT
+ * 	0 -.- 1 -.- 2 -.- 3 -.- 4 -.- 5 -.- 6
+ * 	0 --> 1 --> 3 --> 4 --> 6
+ *
+ * 	0(0):::cumulus
+ * 	1(1):::cumulus
+ * 	2(2):::storm
+ * 	3(3):::cumulus
+ * 	4(4):::cumulus
+ * 	5(5):::storm
+ * 	6(6):::cumulus
+ *
+ * 	linkStyle default stroke:blue
+ *     classDef cumulus fill:#90FE96
+ *     classDef storm fill:#FE5C5E
+ * ```
+ *
+ * # Sample Input 1
+ * ```
+ * 6
+ * 0 0 0 0 1 0
+ * ```
+ *
+ * # Sample Output 1
+ * ```
+ * 3
+ * ```
+ *
+ * # Explanation 1:
+ * The only thundercloud to avoid is c[4]. The game can be won in 3 jumps:
+ *
+ * ```mermaid
+ * flowchart BT
+ * 	0 -.- 1 -.- 2 -.- 3 -.- 4 -.- 5
+ * 	0 --> 2 --> 3 --> 5
+ *
+ * 	0(0):::cumulus
+ * 	1(1):::cumulus
+ * 	2(2):::cumulus
+ * 	3(3):::cumulus
+ * 	4(4):::storm
+ * 	5(5):::cumulus
+ *
+ * 	linkStyle default stroke:blue
+ *     classDef cumulus fill:#90FE96
+ *     classDef storm fill:#FE5C5E
+ * ```
+ */
+
+import { logger as console } from '../../logger';
+
+export function jumpingOnClouds(c: number[]): number {
+  let result = 0;
+  const end = false;
+  let key = 0;
+
+  console.debug(c);
+
+  while (key < c.length || end) {
+    if (key + 2 < c.length && c[key + 2] === 0) {
+      result += 1;
+      key += 2;
+    } else if (key + 1 < c.length && c[key + 1] === 0) {
+      result += 1;
+      key += 1;
+    } else {
+      key += 1;
+    }
+  }
+
+  return result;
+}
+
+export default { jumpingOnClouds };