feat: refine solutions db and add logic

Author: codeisneverodd

.prettierrc.json

@@ -2,6 +2,6 @@
   "singleQuote": true,
   "bracketSpacing": true,
   "bracketSameLine": true,
-  "arrowParens": "avoid",
+  "arrowParens": "always",
   "printWidth": 120
 }

api.json

@@ -0,0 +1,27 @@
+{ "author": "codeisneverodd", "code": "function solution(n, t, m, timetable) {
+  const hhmmToMin = (hhmm) => {
+    const [h, m] = hhmm.split(':').map((v) => +v);
+    return h * 60 + m;
+  };
+
+  const minToHHMM = (min) => {
+    const hh = ('' + Math.floor(min / 60)).padStart(2, '0');
+    const mm = ('' + (min % 60)).padStart(2, '0');
+    return `${hh}:${mm}`;
+  };
+
+  let clock = hhmmToMin('09:00');
+  let waiting = timetable.map((t) => hhmmToMin(t)).sort((a, b) => a - b);
+
+  for (let bus = 0; bus < n - 1; bus++) {
+    const possible = waiting.filter((time) => time <= clock).length;
+    const boarding = possible >= m ? m : possible;
+    waiting = waiting.slice(boarding);
+    clock += t;
+  }
+
+  waiting = waiting.filter((time) => time <= clock);
+  const answer = waiting.length >= m ? waiting[m - 1] - 1 : clock;
+  return minToHHMM(answer);
+}
+", "probId": "" }

build/newSol.json

@@ -0,0 +1 @@
+export {};

build/results/db.json

@@ -1,6 +1,3 @@
-//https://github.com/codeisneverodd/programmers-coding-test
-//완벽한 정답이 아닙니다.
-//정답 1 - codeisneverodd
 function solution(num_list, n) {
   let result = [];
   for (let i = 0; i < num_list.length / n; i++) {

build/run.js

@@ -0,0 +1,3 @@
+function solution(order) {
+  return [...('' + order)].filter(num => num === '3' || num === '6' || num === '9').length;
+}

level-0/2차원으로-만들기&120842&.js renamed to build/solutions/level-0/2차원으로-만들기/codeisneverodd.js

@@ -0,0 +1,3 @@
+function solution(array) {
+  return [...array.join('')].filter(a => a === '7').length;
+}

build/solutions/level-0/369게임/codeisneverodd.js

@@ -1,6 +1,3 @@
-//https://github.com/codeisneverodd/programmers-coding-test
-//완벽한 정답이 아닙니다.
-//정답 1 - codeisneverodd
 function solution(before, after) {
   const sort = str => [...str].sort((a, b) => (a < b ? -1 : a !== b ? 1 : 0)).join('');
   return sort(before) === sort(after) ? 1 : 0;

build/solutions/level-0/7의-개수/codeisneverodd.js

@@ -1,6 +1,3 @@
-//https://github.com/codeisneverodd/programmers-coding-test
-//완벽한 정답이 아닙니다.
-//정답 1 - codeisneverodd
 function solution(quiz) {
   return quiz.map(q => {
     const [formula, answer] = q.split('=');