"H occurs 191 times" "least common element (H, 161)" excuse me you can't just have a typo on the challenge statement

anyway
- opened the problem. "oh this needs python, it's literally zip(). but for some reason it took a while to convince myself to use .op(), the function i added to this environment that is literally python zip().
- asked copilot to write a mostCommon() function for me even though it's the easiest thing to write and it probably took me longer trying to prompt copilot than it would have for me to have written it myself and have sorted the output properly. I guess I have a video so I can time it and see
- did spend a little bit of time questioning myself because of the typo in the challenge statement but that was just part 2 and not that long
- anyway basically just overall slow and checked my work at every level
- also took 51 lines of code while others got it in like 30. 51 lines takes longer to write
- idk i can check my video and make a pie chart or something
- it really bothers me that when i go to type .use() in my code vscode will "correct" me to something wrong

Author: pfgithub

2021/solutions/day14/day14.1.ts

@@ -0,0 +1,87 @@
+import {fhmain} from "../../../src/fheader";
+fhmain(__filename);
+/*
+input: string, lines: string[], dblines: string[][]
+copy(text: string) → clipboard
+error(message: string) → thrown error
+-5..mod(3) → @mod(-5, 3)
+*/
+
+// Cardinals:
+// [[1,0],[-1,0],[0,1],[0,-1]]
+// +Diagonals:
+// [[1,0],[-1,0],[0,1],[0,-1],[-1,-1],[-1,1],[1,-1],[1,1]]
+
+export {};
+
+const practice = `
+NNCB
+
+CH -> B
+HH -> N
+CB -> H
+NH -> C
+HB -> C
+HC -> B
+HN -> C
+NN -> C
+BH -> H
+NC -> B
+NB -> B
+BN -> B
+BB -> N
+BC -> B
+CC -> N
+CN -> C
+
+`;
+// input = practice;
+input = input.trim();
+
+const [template, insertionrules] = input.split("\n\n");
+
+const ruleso = insertionrules.split("\n").map(r => r.split(" -> "));
+const rules = new Map<string, string>();
+
+ruleso.forEach(([lhs, rhs]) => rules.set(lhs, rhs));
+
+let templ = template;
+
+const paircounts = new Map<string, number>();
+
+[...templ].op([...templ].slice(1), (a, b) => {
+    if(!b) return;
+    paircounts.set(a + b, (paircounts.get(a + b) ?? 0) + 1);
+}).join("")
+
+console.log(templ);
+for(let i = 0; i < 10; i++) {
+    // zip(a, a[1..])
+    
+    templ = [...templ].op([...templ].slice(1), (a, b) => {
+        const match = rules.get(a + b);
+        if(match) return a + match;
+        return a;
+    }).join("");
+
+    // console.log(i + 1, templ);
+}
+
+const arr = [...templ];
+
+// most common element in arer
+
+function mostCommon(arr: string[]) {
+    const counts = arr.reduce((acc, cur) => {
+        acc[cur] = (acc[cur] || 0) + 1;
+        return acc;
+    }, {} as {[key: string]: number});
+
+    const max = Math.max(...Object.values(counts));
+    const min = Math.min(...Object.values(counts));
+    const mostCommon = Object.keys(counts).filter(k => counts[k] === max || counts[k] === min);
+    return [counts[mostCommon[0]], counts[mostCommon[1]]].sort((a, b) => a - b);
+}
+
+
+console.log(mostCommon(arr).use(([a, b]) => b - a));

2021/solutions/day14/day14.2.ts

@@ -0,0 +1,113 @@
+import {fhmain} from "../../../src/fheader";
+fhmain(__filename);
+/*
+input: string, lines: string[], dblines: string[][]
+copy(text: string) → clipboard
+error(message: string) → thrown error
+-5..mod(3) → @mod(-5, 3)
+*/
+
+// Cardinals:
+// [[1,0],[-1,0],[0,1],[0,-1]]
+// +Diagonals:
+// [[1,0],[-1,0],[0,1],[0,-1],[-1,-1],[-1,1],[1,-1],[1,1]]
+
+export {};
+
+const practice = `
+NNCB
+
+CH -> B
+HH -> N
+CB -> H
+NH -> C
+HB -> C
+HC -> B
+HN -> C
+NN -> C
+BH -> H
+NC -> B
+NB -> B
+BN -> B
+BB -> N
+BC -> B
+CC -> N
+CN -> C
+
+`;
+// input = practice;
+input = input.trim();
+
+const [template, insertionrules] = input.split("\n\n");
+
+const ruleso = insertionrules.split("\n").map(r => r.split(" -> "));
+const rules = new Map<string, string>();
+
+ruleso.forEach(([lhs, rhs]) => rules.set(lhs, rhs));
+
+let templ = template;
+
+let paircounts = new Map<string, number>();
+
+[...templ].op([...templ].slice(1), (a, b) => {
+    if(!b) {
+        paircounts.set(a + "!", (paircounts.get(a + "!") ?? 0) + 1);
+        return;
+    }
+    paircounts.set(a + b, (paircounts.get(a + b) ?? 0) + 1);
+}).join("")
+
+console.log(templ, paircounts);
+
+/*
+Map(6) {
+  'NC' => 1,
+  'CN' => 2, // ?
+  'NB' => 1,
+  'BC' => 2,
+  'CH' => 1,
+  'HB' => 2
+}
+NNCB
+1 NCNBCHB
+
+NC
+CN
+NB
+BC
+CH
+HB
+*/
+
+for(let i = 0; i < 40; i++) {
+
+let npc = new Map<string, number>();
+for(const [key, value] of paircounts.entries()) {
+    const match = rules.get(key);
+    if(match) {
+        const k = key[0] + match;
+        npc.set(k, (npc.get(k) ?? 0) + value);
+        const l = match + key[1];
+        npc.set(l, (npc.get(l) ?? 0) + value);
+    }else{
+        const k = key;
+        npc.set(k, (npc.get(k) ?? 0) + value);
+    }
+}
+paircounts = npc;
+
+}
+
+console.log(paircounts);
+
+let occurances = new Map<string, number>();
+for(const [key, value] of paircounts.entries()) {
+    occurances.set(key[0], (occurances.get(key[0]) ?? 0) + value);
+}
+console.log(occurances);
+console.log([...occurances.entries()].map(([k, v]) => v).sort((a, b) => a - b).use((
+    a
+) => {
+    return a.at(-1) - a.at(0);
+}));
+

2021/solutions/day14/day14.3.ts

@@ -0,0 +1,25 @@
+import {fhmain} from "../../../src/fheader";
+fhmain(__filename);
+/*
+input: string, lines: string[], dblines: string[][]
+copy(text: string) → clipboard
+error(message: string) → thrown error
+-5..mod(3) → @mod(-5, 3)
+*/
+
+// Cardinals:
+// [[1,0],[-1,0],[0,1],[0,-1]]
+// +Diagonals:
+// [[1,0],[-1,0],[0,1],[0,-1],[-1,-1],[-1,1],[1,-1],[1,1]]
+
+export {};
+
+const practice = ``;
+// input = practice;
+input = input.trim();
+
+// input.
+
+// hi! i'm glad you're excited to code
+// but consider fully reading the problem statement first.
+// Sincerely, future you.

2021/solutions/day14/day14.4.ts

@@ -0,0 +1,25 @@
+import {fhmain} from "../../../src/fheader";
+fhmain(__filename);
+/*
+input: string, lines: string[], dblines: string[][]
+copy(text: string) → clipboard
+error(message: string) → thrown error
+-5..mod(3) → @mod(-5, 3)
+*/
+
+// Cardinals:
+// [[1,0],[-1,0],[0,1],[0,-1]]
+// +Diagonals:
+// [[1,0],[-1,0],[0,1],[0,-1],[-1,-1],[-1,1],[1,-1],[1,1]]
+
+export {};
+
+const practice = ``;
+// input = practice;
+input = input.trim();
+
+// input.
+
+// hi! i'm glad you're excited to code
+// but consider fully reading the problem statement first.
+// Sincerely, future you.

2021/solutions/day14/day14.5.ts

@@ -0,0 +1,25 @@
+import {fhmain} from "../../../src/fheader";
+fhmain(__filename);
+/*
+input: string, lines: string[], dblines: string[][]
+copy(text: string) → clipboard
+error(message: string) → thrown error
+-5..mod(3) → @mod(-5, 3)
+*/
+
+// Cardinals:
+// [[1,0],[-1,0],[0,1],[0,-1]]
+// +Diagonals:
+// [[1,0],[-1,0],[0,1],[0,-1],[-1,-1],[-1,1],[1,-1],[1,1]]
+
+export {};
+
+const practice = ``;
+// input = practice;
+input = input.trim();
+
+// input.
+
+// hi! i'm glad you're excited to code
+// but consider fully reading the problem statement first.
+// Sincerely, future you.

2021/solutions/day14/day14.txt

@@ -0,0 +1,102 @@
+PSVVKKCNBPNBBHNSFKBO
+
+CF -> H
+PP -> H
+SP -> V
+NO -> C
+SF -> F
+FS -> H
+OF -> P
+PN -> B
+SH -> V
+BO -> K
+ON -> V
+VP -> S
+HN -> B
+PS -> P
+FV -> H
+NC -> N
+FN -> S
+PF -> F
+BF -> F
+NB -> O
+HS -> C
+SC -> V
+PC -> K
+KF -> K
+HC -> C
+OK -> H
+KS -> P
+VF -> C
+NV -> S
+KK -> F
+HV -> H
+SV -> V
+KC -> N
+HF -> P
+SN -> F
+VS -> P
+VN -> F
+VH -> C
+OB -> K
+VV -> O
+VC -> O
+KP -> V
+OP -> C
+HO -> S
+NP -> K
+HB -> C
+CS -> S
+OO -> S
+CV -> K
+BS -> F
+BH -> P
+HP -> P
+PK -> B
+BB -> H
+PV -> N
+VO -> P
+SS -> B
+CC -> F
+BC -> V
+FF -> S
+HK -> V
+OH -> N
+BV -> C
+CP -> F
+KN -> K
+NN -> S
+FB -> F
+PH -> O
+FH -> N
+FK -> P
+CK -> V
+CN -> S
+BP -> K
+CH -> F
+FP -> K
+HH -> N
+NF -> C
+VB -> B
+FO -> N
+PB -> C
+KH -> K
+PO -> K
+OV -> F
+NH -> H
+KV -> B
+OS -> K
+OC -> K
+FC -> H
+SO -> H
+KO -> P
+NS -> F
+CB -> C
+CO -> F
+KB -> V
+BK -> K
+NK -> O
+SK -> C
+SB -> B
+VK -> O
+BN -> H