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('=');

level-0/A로-B-만들기&120886&.js renamed to build/solutions/level-0/A로-B-만들기/codeisneverodd.js

@@ -1,6 +1,3 @@
-//https://github.com/codeisneverodd/programmers-coding-test
-//완벽한 정답이 아닙니다.
-//정답 1 - codeisneverodd
 function solution(i, j, k) {
   let count = 0;
   for (let num = i; num <= j; num++) {

level-0/OX퀴즈&120907&.js renamed to build/solutions/level-0/OX퀴즈/codeisneverodd.js

@@ -0,0 +1,3 @@
+function solution(n, numlist) {
+  return numlist.filter(num => num % n === 0);
+}

level-0/k의-개수&120887&.js renamed to build/solutions/level-0/k의-개수/codeisneverodd.js

@@ -1,6 +1,3 @@
-//https://github.com/codeisneverodd/programmers-coding-test
-//완벽한 정답이 아닙니다.
-//정답 1 - codeisneverodd
 function solution(array, n) {
   const minDiff = Math.min(...array.map(a => Math.abs(a - n)));
   return array.sort((a, b) => a - b).find(a => Math.abs(a - n) === minDiff);

build/solutions/level-0/n의-배수-고르기/codeisneverodd.js

@@ -0,0 +1,4 @@
+function solution(rsp) {
+  const win = { 0: 5, 2: 0, 5: 2 };
+  return [...rsp].map(num => win[num]).join('');
+}

level-0/가까운-수&120890&.js renamed to build/solutions/level-0/가까운-수/codeisneverodd.js

@@ -0,0 +1,4 @@
+function solution(array) {
+  const max = Math.max(...array);
+  return [max, array.indexOf(max)];
+}

build/solutions/level-0/가위-바위-보/codeisneverodd.js

@@ -1,6 +1,3 @@
-//https://github.com/codeisneverodd/programmers-coding-test
-//완벽한 정답이 아닙니다.
-//정답 1 - codeisneverodd
 function solution(angle) {
   if (angle === 180) return 4;
   if (angle > 90) return 3;

build/solutions/level-0/가장-큰-수-찾기/codeisneverodd.js

@@ -1,6 +1,3 @@
-//https://github.com/codeisneverodd/programmers-coding-test
-//완벽한 정답이 아닙니다.
-//정답 1 - codeisneverodd
 function solution(hp) {
   const first = Math.floor(hp / 5);
   const second = Math.floor((hp - first * 5) / 3);

level-0/각도기&120829&.js renamed to build/solutions/level-0/각도기/codeisneverodd.js

@@ -1,6 +1,3 @@
-//https://github.com/codeisneverodd/programmers-coding-test
-//완벽한 정답이 아닙니다.
-//정답 1 - codeisneverodd
 function solution(lines) {
   const visited = lines.reduce((a, [x, y]) => {
     for (let i = Math.min(x, y) + 1; i <= Math.max(x, y); i++) a[i] = a[i] ? a[i] + 1 : 1;

level-0/개미-군단&120837&.js renamed to build/solutions/level-0/개미-군단/codeisneverodd.js

@@ -1,6 +1,3 @@
-//https://github.com/codeisneverodd/programmers-coding-test
-//완벽한 정답이 아닙니다.
-//정답 1 - codeisneverodd
 function solution(numbers, k) {
   const goNext = current => (current + 2) % numbers.length;
   let current = 0;

level-0/겹치는-선분의-길이&120876&.js renamed to build/solutions/level-0/겹치는-선분의-길이/codeisneverodd.js

@@ -1,6 +1,3 @@
-//https://github.com/codeisneverodd/programmers-coding-test
-//완벽한 정답이 아닙니다.
-//정답 1 - codeisneverodd
 function solution(balls, share) {
   const [n, m] = [balls, share];
   const fact = [BigInt(1), BigInt(1)];

level-0/공-던지기&120843&.js renamed to build/solutions/level-0/공-던지기/codeisneverodd.js

@@ -0,0 +1,3 @@
+function solution(num1, num2) {
+  return num1 % num2;
+}

level-0/구슬을-나누는-경우의-수&120840&.js renamed to build/solutions/level-0/구슬을-나누는-경우의-수/codeisneverodd.js

@@ -0,0 +1,3 @@
+function solution(age) {
+  return 2022 - age + 1;
+}

build/solutions/level-0/나머지-구하기/codeisneverodd.js

@@ -1,6 +1,3 @@
-//https://github.com/codeisneverodd/programmers-coding-test
-//완벽한 정답이 아닙니다.
-//정답 1 - codeisneverodd
 function solution(common) {
   const isAP = arr => arr[2] - arr[1] === arr[1] - arr[0];
   return isAP(common)

build/solutions/level-0/나이-출력/codeisneverodd.js

@@ -1,6 +1,3 @@
-//https://github.com/codeisneverodd/programmers-coding-test
-//완벽한 정답이 아닙니다.
-//정답 1 - codeisneverodd
 function solution(polynomial) {
   const countX = x => {
     const count = x.replaceAll('x', '');

level-0/다음에-올-숫자&120924&.js renamed to build/solutions/level-0/다음에-올-숫자/codeisneverodd.js

@@ -1,6 +1,3 @@
-//https://github.com/codeisneverodd/programmers-coding-test
-//완벽한 정답이 아닙니다.
-//정답 1 - codeisneverodd
 function solution(my_string) {
   return [...my_string].map(char => (char === char.toUpperCase() ? char.toLowerCase() : char.toUpperCase())).join('');
 }

level-0/다항식-더하기&120863&.js renamed to build/solutions/level-0/다항식-더하기/codeisneverodd.js

@@ -0,0 +1,3 @@
+function solution(num1, num2) {
+  return num1 * num2;
+}

level-0/대문자와-소문자&120893&.js renamed to build/solutions/level-0/대문자와-소문자/codeisneverodd.js

@@ -0,0 +1,3 @@
+function solution(num1, num2) {
+  return Math.floor((num1 / num2) * 1000);
+}

build/solutions/level-0/두-수의-곱/codeisneverodd.js

@@ -0,0 +1,3 @@
+function solution(num1, num2) {
+  return num1 - num2;
+}

build/solutions/level-0/두-수의-나눗셈/codeisneverodd.js

@@ -0,0 +1,3 @@
+function solution(num1, num2) {
+  return num1 + num2
+}

build/solutions/level-0/두-수의-차/codeisneverodd.js

@@ -1,6 +1,3 @@
-//https://github.com/codeisneverodd/programmers-coding-test
-//완벽한 정답이 아닙니다.
-//정답 1 - codeisneverodd
 function solution(score) {
   const avgs = score.map(([a, b]) => (a + b) / 2);
   const avgRank = [...avgs]

build/solutions/level-0/두-수의-합/codeisneverodd.js

@@ -1,6 +1,3 @@
-//https://github.com/codeisneverodd/programmers-coding-test
-//완벽한 정답이 아닙니다.
-//정답 1 - codeisneverodd
 function solution(id_pw, db) {
   const [id, pw] = id_pw;
   if (!db.find(([_id]) => _id === id)) return 'fail';

level-0/등수-매기기&120882&.js renamed to build/solutions/level-0/등수-매기기/codeisneverodd.js

@@ -0,0 +1,3 @@
+function solution(array, height) {
+  return array.filter(a => a > height).length;
+}

level-0/로그인-성공?&120883&.js renamed to build/solutions/level-0/로그인-성공/codeisneverodd.js

@@ -1,6 +1,3 @@
-//https://github.com/codeisneverodd/programmers-coding-test
-//완벽한 정답이 아닙니다.
-//정답 1 - codeisneverodd
 function solution(letter) {
   const morse = { 
   '.-':'a','-...':'b','-.-.':'c','-..':'d','.':'e','..-.':'f',

build/solutions/level-0/머쓱이보다-키-큰-사람/codeisneverodd.js

@@ -0,0 +1,3 @@
+function solution(my_string) {
+  return my_string.replace(/[aeiou]/g, '');
+}

level-0/모스부호-(1)&120838&.js renamed to build/solutions/level-0/모스부호-(1)/codeisneverodd.js

@@ -0,0 +1,3 @@
+function solution(num1, num2) {
+  return Math.floor(num1 / num2);
+}

build/solutions/level-0/모음-제거/codeisneverodd.js

@@ -0,0 +1,3 @@
+function solution(my_string, n) {
+  return [...my_string].map(char => char.repeat(n)).join('');
+}

build/solutions/level-0/몫-구하기/codeisneverodd.js

@@ -0,0 +1,3 @@
+function solution(my_string) {
+  return eval(my_string);
+}

build/solutions/level-0/문자-반복-출력하기/codeisneverodd.js

@@ -0,0 +1,3 @@
+function solution(my_string) {
+  return [...my_string].reverse().join('');
+}

build/solutions/level-0/문자열-계산하기/codeisneverodd.js

@@ -1,6 +1,3 @@
-//https://github.com/codeisneverodd/programmers-coding-test
-//완벽한 정답이 아닙니다.
-//정답 1 - codeisneverodd
 function solution(A, B) {
   const pushRight = str => [str[str.length - 1], ...str.slice(0, str.length - 1)].join('');
   for (let i = 0; i <= A.length; i++) {

build/solutions/level-0/문자열-뒤집기/codeisneverodd.js

@@ -0,0 +1,6 @@
+function solution(my_string) {
+  return my_string
+    .match(/[0-9]/g)
+    .map(str => +str)
+    .sort((a, b) => a - b);
+}

level-0/문자열-밀기&120921&.js renamed to build/solutions/level-0/문자열-밀기/codeisneverodd.js

@@ -1,6 +1,3 @@
-//https://github.com/codeisneverodd/programmers-coding-test
-//완벽한 정답이 아닙니다.
-//정답 1 - codeisneverodd
 function solution(my_string) {
   return [...my_string]
     .map(char => char.toLowerCase())

build/solutions/level-0/문자열-정렬하기-(1)/codeisneverodd.js

@@ -0,0 +1,3 @@
+function solution(str1, str2) {
+  return str1.includes(str2) ? 1 : 2;
+}

level-0/문자열-정렬하기-(2)&120911&.js renamed to build/solutions/level-0/문자열-정렬하기-(2)/codeisneverodd.js

@@ -0,0 +1,3 @@
+function solution(numbers) {
+  return numbers.map(n => n * 2);
+}

build/solutions/level-0/문자열안에-문자열/codeisneverodd.js

@@ -0,0 +1,3 @@
+function solution(num_list) {
+  return num_list.reverse();
+}

build/solutions/level-0/배열-두-배-만들기/codeisneverodd.js

@@ -0,0 +1,3 @@
+function solution(strlist) {
+  return strlist.map(s => s.length);
+}

build/solutions/level-0/배열-뒤집기/codeisneverodd.js

@@ -0,0 +1,3 @@
+function solution(numbers, num1, num2) {
+  return numbers.slice(num1, num2 + 1);
+}

build/solutions/level-0/배열-원소의-길이/codeisneverodd.js

@@ -1,6 +1,3 @@
-//https://github.com/codeisneverodd/programmers-coding-test
-//완벽한 정답이 아닙니다.
-//정답 1 - codeisneverodd
 function solution(numbers, direction) {
   return direction === 'right'
     ? [numbers[numbers.length - 1], ...numbers.slice(0, numbers.length - 1)]

build/solutions/level-0/배열-자르기/codeisneverodd.js

@@ -0,0 +1,3 @@
+function solution(s1, s2) {
+  return s1.filter(s => s2.includes(s)).length;
+}

level-0/배열-회전시키기&120844&.js renamed to build/solutions/level-0/배열-회전시키기/codeisneverodd.js

@@ -0,0 +1,3 @@
+function solution(numbers) {
+  return numbers.reduce((a, c) => a + c, 0) / numbers.length;
+}

build/solutions/level-0/배열의-유사도/codeisneverodd.js

@@ -1,6 +1,3 @@
-//https://github.com/codeisneverodd/programmers-coding-test
-//완벽한 정답이 아닙니다.
-//정답 1 - codeisneverodd
 function solution(denum1, num1, denum2, num2) {
   const denum = denum2 * num1 + denum1 * num2;
   const num = num1 * num2;

build/solutions/level-0/배열의-평균값/codeisneverodd.js

@@ -1,6 +1,3 @@
-//https://github.com/codeisneverodd/programmers-coding-test
-//완벽한 정답이 아닙니다.
-//정답 1 - codeisneverodd
 function solution(sides) {
   const max = Math.max(...sides);
   return max < sides.reduce((a, c) => a + c, 0) - max ? 1 : 2;

level-0/분수의-덧셈&120808&.js renamed to build/solutions/level-0/분수의-덧셈/codeisneverodd.js

@@ -0,0 +1,3 @@
+function solution(sides) {
+  return Math.min(...sides) * 2 - 1;
+}

level-0/삼각형의-완성조건-(1)&120889&.js renamed to build/solutions/level-0/삼각형의-완성조건-(1)/codeisneverodd.js

@@ -0,0 +1,3 @@
+function solution(n, t) {
+  return n * 2 ** t;
+}

build/solutions/level-0/삼각형의-완성조건-(2)/codeisneverodd.js

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

build/solutions/level-0/세균-증식/codeisneverodd.js

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

level-0/소인수분해&120852&.js renamed to build/solutions/level-0/소인수분해/codeisneverodd.js

@@ -0,0 +1,3 @@
+function solution(my_string) {
+  return my_string.match(/[0-9]/g).reduce((a, c) => a + +c, 0);
+}

level-0/순서쌍의-개수&120836&.js renamed to build/solutions/level-0/순서쌍의-개수/codeisneverodd.js

@@ -1,6 +1,3 @@
-//https://github.com/codeisneverodd/programmers-coding-test
-//완벽한 정답이 아닙니다.
-//정답 1 - codeisneverodd
 function solution(my_string) {
   const nums = my_string.match(/[0-9]+/g);
   return nums ? nums.map(num => +num).reduce((a, c) => a + c, 0) : 0;

build/solutions/level-0/숨어있는-숫자의-덧셈-(1)/codeisneverodd.js

@@ -0,0 +1,3 @@
+function solution(num1, num2) {
+  return num1 === num2 ? 1 : -1;
+}

level-0/숨어있는-숫자의-덧셈-(2)&120864&.js renamed to build/solutions/level-0/숨어있는-숫자의-덧셈-(2)/codeisneverodd.js

@@ -1,6 +1,3 @@
-//https://github.com/codeisneverodd/programmers-coding-test
-//완벽한 정답이 아닙니다.
-//정답 1 - codeisneverodd
 function solution(num, k) {
   const index = [...('' + num)].findIndex(n => +n === k);
   return index === -1 ? -1 : index + 1;

build/solutions/level-0/숫자-비교하기/codeisneverodd.js

@@ -0,0 +1,3 @@
+function solution(money) {
+  return [Math.floor(money / 5500), money % 5500];
+}

level-0/숫자-찾기&120904&.js renamed to build/solutions/level-0/숫자-찾기/codeisneverodd.js

@@ -1,6 +1,3 @@
-//https://github.com/codeisneverodd/programmers-coding-test
-//완벽한 정답이 아닙니다.
-//정답 1 - codeisneverodd
 function solution(board) {
   const isBombNearby = (r, c) => {
     const nearby = [

build/solutions/level-0/아이스-아메리카노/codeisneverodd.js

@@ -0,0 +1,3 @@
+function solution(cipher, code) {
+  return [...cipher].reduce((a, c, i) => ((i + 1) % code === 0 ? a + c : a), '');
+}

level-0/안전지대&120866&.js renamed to build/solutions/level-0/안전지대/codeisneverodd.js

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

build/solutions/level-0/암호-해독/codeisneverodd.js

@@ -0,0 +1,3 @@
+function solution(n, k) {
+  return n * 12000 + (k - Math.floor(n / 10)) * 2000;
+}

level-0/약수-구하기&120897&.js renamed to build/solutions/level-0/약수-구하기/codeisneverodd.js

@@ -1,6 +1,3 @@
-//https://github.com/codeisneverodd/programmers-coding-test
-//완벽한 정답이 아닙니다.
-//정답 1 - codeisneverodd
 function solution(num, total) {
   const numArr = Array.from({ length: num }, (_, i) => i);
   const sum = numArr.reduce((a, c) => a + c);

build/solutions/level-0/양꼬치/codeisneverodd.js

@@ -1,6 +1,3 @@
-//https://github.com/codeisneverodd/programmers-coding-test
-//완벽한 정답이 아닙니다.
-//정답 1 - codeisneverodd
 function solution(numbers) {
   const nums = { zero: 0, one: 1, two: 2, three: 3, four: 4, five: 5, six: 6, seven: 7, eight: 8, nine: 9 };
   const regex = new RegExp(Object.keys(nums).join('|'), 'g');

level-0/연속된-수의-합&120923&.js renamed to build/solutions/level-0/연속된-수의-합/codeisneverodd.js

@@ -1,6 +1,3 @@
-//https://github.com/codeisneverodd/programmers-coding-test
-//완벽한 정답이 아닙니다.
-//정답 1 - codeisneverodd
 function solution(price) {
   if (price >= 500000) return Math.floor(price * 0.8);
   if (price >= 300000) return Math.floor(price * 0.9);

level-0/영어가-싫어요&120894&.js renamed to build/solutions/level-0/영어가-싫어요/codeisneverodd.js

@@ -1,6 +1,3 @@
-//https://github.com/codeisneverodd/programmers-coding-test
-//완벽한 정답이 아닙니다.
-//정답 1 - codeisneverodd
 function solution(babbling) {
   const convertPWordsToNum = word => {
     const pWords = ['aya', 'ye', 'woo', 'ma'];

level-0/옷가게-할인-받기&120818&.js renamed to build/solutions/level-0/옷가게-할인-받기/codeisneverodd.js

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