solve: programmers 영어끝말잇기

kyu9341 · kyu9341 · commit 31950c5a8213 · 2021-01-06T01:21:23.000+09:00
diff --git a/src/kyu9341/programmers_영어끝말잇기/index.js b/src/kyu9341/programmers_영어끝말잇기/index.js
@@ -0,0 +1,63 @@
+const solution = (n, words) => {
+  const set = new Set();
+  let prevWrod = '';
+
+  for (const [idx, word] of words.entries()) {
+    const beNotEqual =
+      idx && prevWrod.charAt(prevWrod.length - 1) !== word.charAt(0);
+
+    if (set.has(word) || beNotEqual) {
+      const num = (idx + 1) % n || n;
+      const count = Math.floor((idx + 1) / n) + Number(num !== n);
+
+      return [num, count];
+    }
+
+    set.add(word);
+    prevWrod = word;
+  }
+
+  return [0, 0];
+};
+
+(() => {
+  const inputs = [
+    {
+      n: 3,
+      words: [
+        'tank',
+        'kick',
+        'know',
+        'wheel',
+        'land',
+        'dream',
+        'mother',
+        'robot',
+        'tank',
+      ],
+    },
+    {
+      n: 5,
+      words: [
+        'hello',
+        'observe',
+        'effect',
+        'take',
+        'either',
+        'recognize',
+        'encourage',
+        'ensure',
+        'establish',
+        'hang',
+        'gather',
+        'refer',
+        'reference',
+        'estimate',
+        'executive',
+      ],
+    },
+    { n: 2, words: ['hello', 'one', 'even', 'never', 'now', 'world', 'draw'] },
+  ];
+
+  inputs.forEach(input => console.log(solution(input.n, input.words)));
+})();
