[Hacker Rank]: Sales by Match doc moved as Markdown

Author: sir-gon

src/hackerrank/implementation/sockMerchant.md

@@ -0,0 +1,70 @@
+# [Sales by Match](https://www.hackerrank.com/challenges/sock-merchant)
+
+Difficulty: #easy
+Category: #implementation
+
+There is a large pile of socks that must be paired by color. Given an array
+of integers representing the color of each sock, determine how many pairs
+of socks with matching colors there are.
+
+## Example
+
+$ n = 7 $ \
+$ ar = [1, 2, 1, 2, 1, 3, 2] $
+
+There is one pair of color $ 1 $ and one of color $ 2 $. There are three odd socks
+left, one of each color. The number of pairs is $ 2 $.
+
+## Function Description
+
+Complete the sockMerchant function in the editor below.
+
+sockMerchant has the following parameter(s):
+
+- int n: the number of socks in the pile
+- int ar[n]: the colors of each sock
+
+## Returns
+
+- int: the number of pairs
+
+## Input Format
+
+The first line contains an integer n, the number of socks represented in ar.
+The second line contains n space-separated integers, ar[i], the colors of
+the socks in the pile.
+
+## Constraints
+
+$ 1 \leq n < 100 $ \
+$ 1 \leq ar[i] \leq 100 $ where $ 0 \leq i < n $
+
+## Sample Input
+
+```text
+STDIN                       Function
+-----                       --------
+9                           n = 9
+10 20 20 10 10 30 50 10 20  ar = [10, 20, 20, 10, 10, 30, 50, 10, 20]
+```
+
+Sample Output
+
+```text
+3
+```
+
+## Explanation
+
+```mermaid
+graph LR
+  A((10)) --- B((20)) --- C((20)) ---
+  D((10)) --- E((10)) --- F((30)) ---
+  G((50)) --- H((10)) --- I((20))
+
+  A <-- pair --> D
+  B <-- pair --> C
+  E <-- pair --> H
+```
+
+There are three pairs of socks.

src/hackerrank/implementation/sockMerchant.ts

@@ -1,70 +1,3 @@
-/**
- * Sales by Match
- *
- * https://www.hackerrank.com/challenges/sock-merchant
- *
- * Difficulty: #easy
- * Category: #implementation
- *
- * There is a large pile of socks that must be paired by color. Given an array
- * of integers representing the color of each sock, determine how many pairs
- * of socks with matching colors there are.
- *
- * # Example
- * n = 7
- * ar = [1, 2, 1, 2, 1, 3, 2]
- *
- * There is one pair of color 1 and one of color 2. There are three odd socks
- * left, one of each color. The number of pairs is 2.
- *
- * # Function Description
- * Complete the sockMerchant function in the editor below.
- *
- * sockMerchant has the following parameter(s):
- * * int n: the number of socks in the pile
- * * int ar[n]: the colors of each sock
- *
- * # Returns
- * * int: the number of pairs
- *
- * # Input Format
- * The first line contains an integer n, the number of socks represented in ar.
- * The second line contains n space-separated integers, ar[i], the colors of
- * the socks in the pile.
- *
- * # Constraints
- * 1 <= n < 100
- * 1 <= ar[i] <= 100 where 0 <= i < n
- *
- * # Sample Input
- * ```
- * STDIN                       Function
- * -----                       --------
- * 9                           n = 9
- * 10 20 20 10 10 30 50 10 20  ar = [10, 20, 20, 10, 10, 30, 50, 10, 20]
- * ```
- *
- * Sample Output
- * ```
- * 3
- * ```
- *
- * # Explanation
- * ```mermaid
- * graph LR
- *
- *  A((10)) --- B((20)) --- C((20)) ---
- * 	D((10)) --- E((10)) --- F((30)) ---
- * 	G((50)) --- H((10)) --- I((20))
- *
- * 	A <-- pair --> D
- * 	B <-- pair --> C
- * 	E <-- pair --> H
- * ```
- *
- * There are three pairs of socks.
- */
-
 import { logger as console } from '../../logger';
 
 export function sockMerchant(n: number, ar: number[]): number {