From 613b1826137be1d587aee212e42dc7fcd4c2118e Mon Sep 17 00:00:00 2001
From: Gonzalo Diaz <gonzalo@gon.cl>
Date: Wed, 26 Jul 2023 00:23:14 -0400
Subject: [PATCH] [Hacker Rank]: Between Two Sets doc moved as Markdown

---
 .../implementation/betweenTwoSets.md          | 68 ++++++++++++++++++
 .../implementation/betweenTwoSets.ts          | 70 -------------------
 2 files changed, 68 insertions(+), 70 deletions(-)
 create mode 100644 src/hackerrank/implementation/betweenTwoSets.md

diff --git a/src/hackerrank/implementation/betweenTwoSets.md b/src/hackerrank/implementation/betweenTwoSets.md
new file mode 100644
index 0000000..379be3e
--- /dev/null
+++ b/src/hackerrank/implementation/betweenTwoSets.md
@@ -0,0 +1,68 @@
+# [Between Two Sets](https://www.hackerrank.com/challenges/between-two-sets)
+
+- Difficulty: [#easy](repo:sir-gon/algorithm-exercises-ts%20easy)
+- Category: [#implementation](repo:sir-gon/algorithm-exercises-ts%20implementation)
+
+There will be two arrays of integers. Determine all integers that satisfy
+the following two conditions:
+
+1. The elements of the first array are all factors of the integer being
+considered
+2. The integer being considered is a factor of all elements of the second
+array
+
+These numbers are referred to as being between the two arrays. Determine
+how many such numbers exist.
+
+# Example
+$ a = [2, 6] $
+
+$ b = [24, 36] $
+
+There are two numbers between the arrays: $ 6 $ and $ 12 $.
+$ 6 \bmod 2 = 0 $, $ 6 \bmod 6 = 0 $, $ 24 \bmod 6 = 0 $ and $ 36 \bmod 6 = 0 $ for the first value.
+$ 12 \bmod 2 = 0 $, $ 12 \bmod 6 = 0 $, and $ 24 \bmod 12 = 0 $, $ 36 \bmod 12 = 0 $ for the second value. Return $ 2 $.
+
+# Function Description
+Complete the getTotalX function in the editor below. It should return the
+number of integers that are betwen the sets.
+
+getTotalX has the following parameter(s):
+
+- int a[n]: an array of integers
+- int b[m]: an array of integers
+
+# Returns
+- int: the number of integers that are between the sets
+
+# Input Format
+The first line contains two space-separated integers, n and m, the number
+of elements in arrays a and b.
+The second line contains n distinct space-separated integers $ a[i] $ where
+$ 0 \leq i < n $.
+The third line contains m distinct space-separated integers $ b[j] $ where
+$ 0 \leq j < m $.
+
+# Constraints
+- $ 1 \leq n, m < 10 $
+- $ 1 \leq a[i] \leq 100 $
+- $ 1 \leq b[j] \leq 100 $
+
+# Sample Input
+```
+2 3
+2 4
+12 32 96
+```
+
+# Sample Output
+```
+3
+```
+
+# Explanation
+2 and 4 divide evenly into 4, 8, 12 and 16.
+
+4, 8 and 16 divide evenly into 16, 32, 96.
+
+4, 8 and 16 are the only three numbers for which each element of a is a factor and each is a factor of all elements of b.
diff --git a/src/hackerrank/implementation/betweenTwoSets.ts b/src/hackerrank/implementation/betweenTwoSets.ts
index eabe11e..def6bbd 100644
--- a/src/hackerrank/implementation/betweenTwoSets.ts
+++ b/src/hackerrank/implementation/betweenTwoSets.ts
@@ -1,73 +1,3 @@
-/**
- * Between Two Sets
- *
- * https://www.hackerrank.com/challenges/between-two-sets
- *
- * Difficulty: #easy
- * Category: #implementation
- *
- * There will be two arrays of integers. Determine all integers that satisfy
- * the following two conditions:
- *
- * 1. The elements of the first array are all factors of the integer being
- * considered
- * 2. The integer being considered is a factor of all elements of the second
- * array
- * These numbers are referred to as being between the two arrays. Determine
- * how many such numbers exist.
- *
- * # Example
- * a = [2, 6]
- * b = [24, 36]
- *
- * There are two numbers between the arrays: 6 and 12.
- * 6%2 = 0, 6%6 = 0, 24%6 = 0 and 36%6 = 0 for the first value.
- * 12%2 = 0, 12%6 = 0, and 24%12 = 0, 36%12 = 0 for the second value. Return 2.
- *
- * # Function Description
- * Complete the getTotalX function in the editor below. It should return the
- * number of integers that are betwen the sets.
- *
- * getTotalX has the following parameter(s):
- *
- * * int a[n]: an array of integers
- * * int b[m]: an array of integers
- *
- * # Returns
- * * int: the number of integers that are between the sets
- *
- * # Input Format
- * The first line contains two space-separated integers, n and m, the number
- * of elements in arrays a and b.
- * The second line contains n distinct space-separated integers a[i] where
- * 0 <= i < n.
- * The third line contains m distinct space-separated integers b[j] where
- * 0 <= j < m.
- *
- * # Constraionts
- * * 1 <= n, m < 10
- * * 1 <= a[i] <= 100
- * * 1 <= b[j] <= 100
- *
- * # Sample Input
- * ```
- * 2 3
- * 2 4
- * 12 32 96
- * ```
- *
- * # Sample Output
- * ```
- * 3
- * ```
- * # Explanation
- * 2 and 4 divide evenly into 4, 8, 12 and 16.
- * 4, 8 and 16 divide evenly into 16, 32, 96.
- * 4, 8 and 16 are the only three numbers for which each element of a is a factor and each is a factor of all elements of b.
- */
-
-// import { logger as console } from '../../logger';
-
 export function isFactor(n: number, group: number[]): boolean {
   let result = true;
   let i = 0;