api.json

[
  {
    "id": "120842",
    "name": "2차원으로 만들기",
    "fileName": "2차원으로-만들기&120842&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(num_list, n) {\n  let result = [];\n  for (let i = 0; i < num_list.length / n; i++) {\n    result = [...result, num_list.slice(i * n, i * n + n)];\n  }\n  return result;\n}\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120842"
  },
  {
    "id": "120891",
    "name": "369게임",
    "fileName": "369게임&120891&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(order) {\n  return [...('' + order)].filter(num => num === '3' || num === '6' || num === '9').length;\n}\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120891"
  },
  {
    "id": "120912",
    "name": "7의 개수",
    "fileName": "7의-개수&120912&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(array) {\n  return [...array.join('')].filter(a => a === '7').length;\n}\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120912"
  },
  {
    "id": "120886",
    "name": "A로 B 만들기",
    "fileName": "A로-B-만들기&120886&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(before, after) {\n  const sort = str => [...str].sort((a, b) => (a < b ? -1 : a !== b ? 1 : 0)).join('');\n  return sort(before) === sort(after) ? 1 : 0;\n}\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120886"
  },
  {
    "id": "120907",
    "name": "OX퀴즈",
    "fileName": "OX퀴즈&120907&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(quiz) {\n  return quiz.map(q => {\n    const [formula, answer] = q.split('=');\n    return eval(formula) === +answer ? 'O' : 'X';\n  });\n}\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120907"
  },
  {
    "id": "120887",
    "name": "k의 개수",
    "fileName": "k의-개수&120887&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(i, j, k) {\n  let count = 0;\n  for (let num = i; num <= j; num++) {\n    count += [...('' + num)].filter(n => +n === k).length;\n  }\n  return count;\n}\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120887"
  },
  {
    "id": "120905",
    "name": "n의 배수 고르기",
    "fileName": "n의-배수-고르기&120905&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(n, numlist) {\n  return numlist.filter(num => num % n === 0);\n}\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120905"
  },
  {
    "id": "120890",
    "name": "가까운 수",
    "fileName": "가까운-수&120890&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(array, n) {\n  const minDiff = Math.min(...array.map(a => Math.abs(a - n)));\n  return array.sort((a, b) => a - b).find(a => Math.abs(a - n) === minDiff);\n}\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120890"
  },
  {
    "id": "120839",
    "name": "가위 바위 보",
    "fileName": "가위-바위-보&120839&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(rsp) {\n  const win = { 0: 5, 2: 0, 5: 2 };\n  return [...rsp].map(num => win[num]).join('');\n}\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120839"
  },
  {
    "id": "120899",
    "name": "가장 큰 수 찾기",
    "fileName": "가장-큰-수-찾기&120899&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(array) {\n  const max = Math.max(...array);\n  return [max, array.indexOf(max)];\n}\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120899"
  },
  {
    "id": "120829",
    "name": "각도기",
    "fileName": "각도기&120829&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(angle) {\n  if (angle === 180) return 4;\n  if (angle > 90) return 3;\n  if (angle === 90) return 2;\n  return 1;\n}\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120829"
  },
  {
    "id": "120837",
    "name": "개미 군단",
    "fileName": "개미-군단&120837&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(hp) {\n  const first = Math.floor(hp / 5);\n  const second = Math.floor((hp - first * 5) / 3);\n  const third = hp - first * 5 - second * 3;\n  return first + second + third;\n}\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120837"
  },
  {
    "id": "120876",
    "name": "겹치는 선분의 길이",
    "fileName": "겹치는-선분의-길이&120876&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(lines) {\n  const visited = lines.reduce((a, [x, y]) => {\n    for (let i = Math.min(x, y) + 1; i <= Math.max(x, y); i++) a[i] = a[i] ? a[i] + 1 : 1;\n    return a;\n  }, {});\n\n  return Object.values(visited).filter(v => v > 1).length;\n}\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120876"
  },
  {
    "id": "120843",
    "name": "공 던지기",
    "fileName": "공-던지기&120843&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(numbers, k) {\n  const goNext = current => (current + 2) % numbers.length;\n  let current = 0;\n  for (let i = 0; i < k - 1; i++) current = goNext(current);\n  return numbers[current];\n}\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120843"
  },
  {
    "id": "120840",
    "name": "구슬을 나누는 경우의 수",
    "fileName": "구슬을-나누는-경우의-수&120840&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(balls, share) {\n  const [n, m] = [balls, share];\n  const fact = [BigInt(1), BigInt(1)];\n\n  for (let i = 2; i <= n; i++) fact[i] = fact[i - 1] * BigInt(i);\n\n  return Number(fact[n] / (fact[n - m] * fact[m]));\n}\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120840"
  },
  {
    "id": "120810",
    "name": "나머지 구하기",
    "fileName": "나머지-구하기&120810&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(num1, num2) {\n  return num1 % num2;\n}\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120810"
  },
  {
    "id": "120820",
    "name": "나이 출력",
    "fileName": "나이-출력&120820&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(age) {\n  return 2022 - age + 1;\n}\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120820"
  },
  {
    "id": "120924",
    "name": "다음에 올 숫자",
    "fileName": "다음에-올-숫자&120924&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(common) {\n  const isAP = arr => arr[2] - arr[1] === arr[1] - arr[0];\n  return isAP(common)\n    ? common[common.length - 1] + common[1] - common[0]\n    : common[common.length - 1] * (common[1] / common[0]);\n}\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120924"
  },
  {
    "id": "120863",
    "name": "다항식 더하기",
    "fileName": "다항식-더하기&120863&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(polynomial) {\n  const countX = x => {\n    const count = x.replaceAll('x', '');\n    return count === '' ? 1 : +count;\n  };\n\n  const count = polynomial\n    .split(' + ')\n    .reduce((a, c) => (c.includes('x') ? { ...a, x: a.x + countX(c) } : { ...a, num: a.num + +c }), {\n      x: 0,\n      num: 0,\n    });\n\n  const x = count.x > 0 ? `${count.x > 1 ? count.x : ''}x` : '';\n  const num = count.num > 0 ? '' + count.num : '';\n  const plus = x !== '' && num !== '' ? ' + ' : '';\n\n  return x + plus + num;\n}\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120863"
  },
  {
    "id": "120893",
    "name": "대문자와 소문자",
    "fileName": "대문자와-소문자&120893&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(my_string) {\n  return [...my_string].map(char => (char === char.toUpperCase() ? char.toLowerCase() : char.toUpperCase())).join('');\n}",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120893"
  },
  {
    "id": "120804",
    "name": "두 수의 곱",
    "fileName": "두-수의-곱&120804&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(num1, num2) {\n  return num1 * num2;\n}\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120804"
  },
  {
    "id": "120806",
    "name": "두 수의 나눗셈",
    "fileName": "두-수의-나눗셈&120806&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(num1, num2) {\n  return Math.floor((num1 / num2) * 1000);\n}\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120806"
  },
  {
    "id": "120803",
    "name": "두 수의 차",
    "fileName": "두-수의-차&120803&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(num1, num2) {\n  return num1 - num2;\n}\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120803"
  },
  {
    "id": "120802",
    "name": "두 수의 합",
    "fileName": "두-수의-합&120802&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(num1, num2) {\n  return num1 + num2\n}",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120802"
  },
  {
    "id": "120882",
    "name": "등수 매기기",
    "fileName": "등수-매기기&120882&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(score) {\n  const avgs = score.map(([a, b]) => (a + b) / 2);\n  const avgRank = [...avgs]\n    .sort((a, b) => b - a)\n    .map((avg, i) => ({ avg, rank: i + 1 }))\n    .map((a, i, arr) => (i > 0 && a.avg === arr[i - 1].avg ? { ...a, rank: arr[i - 1].rank } : a));\n\n  return avgs.map(_avg => avgRank.find(({ avg }) => _avg === avg).rank);\n}\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120882"
  },
  {
    "id": "120883",
    "name": "로그인 성공?",
    "fileName": "로그인-성공&#63;&120883&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(id_pw, db) {\n  const [id, pw] = id_pw;\n  if (!db.find(([_id]) => _id === id)) return 'fail';\n  return db.find(([_id, _pw]) => _id === id && _pw === pw) ? 'login' : 'wrong pw';\n}\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120883"
  },
  {
    "id": "120585",
    "name": "머쓱이보다 키 큰 사람",
    "fileName": "머쓱이보다-키-큰-사람&120585&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(array, height) {\n  return array.filter(a => a > height).length;\n}\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120585"
  },
  {
    "id": "120838",
    "name": "모스부호 (1)",
    "fileName": "모스부호-(1)&120838&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(letter) {\n  const morse = { \n  '.-':'a','-...':'b','-.-.':'c','-..':'d','.':'e','..-.':'f',\n  '--.':'g','....':'h','..':'i','.---':'j','-.-':'k','.-..':'l',\n  '--':'m','-.':'n','---':'o','.--.':'p','--.-':'q','.-.':'r',\n  '...':'s','-':'t','..-':'u','...-':'v','.--':'w','-..-':'x',\n  '-.--':'y','--..':'z'\n  }\n  return letter\n    .split(' ')\n    .map(l => morse[l])\n    .join('');\n}\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120838"
  },
  {
    "id": "120849",
    "name": "모음 제거",
    "fileName": "모음-제거&120849&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(my_string) {\n  return my_string.replace(/[aeiou]/g, '');\n}\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120849"
  },
  {
    "id": "120805",
    "name": "몫 구하기",
    "fileName": "몫-구하기&120805&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(num1, num2) {\n  return Math.floor(num1 / num2);\n}\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120805"
  },
  {
    "id": "120825",
    "name": "문자 반복 출력하기",
    "fileName": "문자-반복-출력하기&120825&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(my_string, n) {\n  return [...my_string].map(char => char.repeat(n)).join('');\n}\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120825"
  },
  {
    "id": "120902",
    "name": "문자열 계산하기",
    "fileName": "문자열-계산하기&120902&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(my_string) {\n  return eval(my_string);\n}\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120902"
  },
  {
    "id": "120822",
    "name": "문자열 뒤집기",
    "fileName": "문자열-뒤집기&120822&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(my_string) {\n  return [...my_string].reverse().join('');\n}\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120822"
  },
  {
    "id": "120921",
    "name": "문자열 밀기",
    "fileName": "문자열-밀기&120921&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(A, B) {\n  const pushRight = str => [str[str.length - 1], ...str.slice(0, str.length - 1)].join('');\n  for (let i = 0; i <= A.length; i++) {\n    if (A === B) return i;\n    A = pushRight(A);\n  }\n\n  return -1;\n}\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120921"
  },
  {
    "id": "120850",
    "name": "문자열 정렬하기 (1)",
    "fileName": "문자열-정렬하기-(1)&120850&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(my_string) {\n  return my_string\n    .match(/[0-9]/g)\n    .map(str => +str)\n    .sort((a, b) => a - b);\n}\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120850"
  },
  {
    "id": "120911",
    "name": "문자열 정렬하기 (2)",
    "fileName": "문자열-정렬하기-(2)&120911&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(my_string) {\n  return [...my_string]\n    .map(char => char.toLowerCase())\n    .sort((a, b) => (a < b ? -1 : a > b ? 1 : 0))\n    .join('');\n}\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120911"
  },
  {
    "id": "120908",
    "name": "문자열안에 문자열",
    "fileName": "문자열안에-문자열&120908&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(str1, str2) {\n  return str1.includes(str2) ? 1 : 2;\n}\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120908"
  },
  {
    "id": "120809",
    "name": "배열 두 배 만들기",
    "fileName": "배열-두-배-만들기&120809&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(numbers) {\n  return numbers.map(n => n * 2);\n}\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120809"
  },
  {
    "id": "120821",
    "name": "배열 뒤집기",
    "fileName": "배열-뒤집기&120821&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(num_list) {\n  return num_list.reverse();\n}\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120821"
  },
  {
    "id": "120854",
    "name": "배열 원소의 길이",
    "fileName": "배열-원소의-길이&120854&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(strlist) {\n  return strlist.map(s => s.length);\n}\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120854"
  },
  {
    "id": "120833",
    "name": "배열 자르기",
    "fileName": "배열-자르기&120833&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(numbers, num1, num2) {\n  return numbers.slice(num1, num2 + 1);\n}\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120833"
  },
  {
    "id": "120844",
    "name": "배열 회전시키기",
    "fileName": "배열-회전시키기&120844&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(numbers, direction) {\n  return direction === 'right'\n    ? [numbers[numbers.length - 1], ...numbers.slice(0, numbers.length - 1)]\n    : [...numbers.slice(1), numbers[0]];\n}\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120844"
  },
  {
    "id": "120903",
    "name": "배열의 유사도",
    "fileName": "배열의-유사도&120903&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(s1, s2) {\n  return s1.filter(s => s2.includes(s)).length;\n}\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120903"
  },
  {
    "id": "120817",
    "name": "배열의 평균값",
    "fileName": "배열의-평균값&120817&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(numbers) {\n  return numbers.reduce((a, c) => a + c, 0) / numbers.length;\n}\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120817"
  },
  {
    "id": "120808",
    "name": "분수의 덧셈",
    "fileName": "분수의-덧셈&120808&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(denum1, num1, denum2, num2) {\n  const denum = denum2 * num1 + denum1 * num2;\n  const num = num1 * num2;\n  const getGCD = (a, b) => (b === 0 ? a : getGCD(b, a % b));\n  const gcd = getGCD(denum, num);\n  return [denum / gcd, num / gcd];\n}\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120808"
  },
  {
    "id": "120889",
    "name": "삼각형의 완성조건 (1)",
    "fileName": "삼각형의-완성조건-(1)&120889&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(sides) {\n  const max = Math.max(...sides);\n  return max < sides.reduce((a, c) => a + c, 0) - max ? 1 : 2;\n}\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120889"
  },
  {
    "id": "120868",
    "name": "삼각형의 완성조건 (2)",
    "fileName": "삼각형의-완성조건-(2)&120868&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(sides) {\n  const min = Math.min(...sides);\n  const max1 = Math.max(...sides);\n  const max2 = min + max1 - 1;\n  return max2 - (max1 - min);\n}\n\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120868"
  },
  {
    "id": "120910",
    "name": "세균 증식",
    "fileName": "세균-증식&120910&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(n, t) {\n  return n * 2 ** t;\n}\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120910"
  },
  {
    "id": "120852",
    "name": "소인수분해",
    "fileName": "소인수분해&120852&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(n) {\n  let pFactors = [];\n  for (let i = 2; i <= Math.sqrt(n); i++) {\n    while (n % i === 0) {\n      pFactors = [...pFactors, i];\n      n /= i;\n    }\n  }\n  if (n >= 2) pFactors = [...pFactors, n];\n  return [...new Set(pFactors)].sort((a, b) => a - b);\n}\n\nconst funcB = () => {\n  return new Promise(resolve => {\n    setTimeout(resolve('guys'), 1000);\n  });\n};\n\nconst funcC = async () => {\n  const m = 1;\n  const res = await funcB();\n  return res;\n};\nwindow.addEventListener('DOMContentLoaded', async () => {\n  console.log(await funcC());\n});\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120852"
  },
  {
    "id": "120836",
    "name": "순서쌍의 개수",
    "fileName": "순서쌍의-개수&120836&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(n) {\n  let count = 0;\n  for (let i = 1; i < Math.sqrt(n); i++) {\n    if (n % i === 0) count += 2;\n  }\n  if (n % Math.sqrt(n) === 0) count += 1;\n  return count;\n}\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120836"
  },
  {
    "id": "120851",
    "name": "숨어있는 숫자의 덧셈 (1)",
    "fileName": "숨어있는-숫자의-덧셈-(1)&120851&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(my_string) {\n  return my_string.match(/[0-9]/g).reduce((a, c) => a + +c, 0);\n}\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120851"
  },
  {
    "id": "120864",
    "name": "숨어있는 숫자의 덧셈 (2)",
    "fileName": "숨어있는-숫자의-덧셈-(2)&120864&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(my_string) {\n  const nums = my_string.match(/[0-9]+/g);\n  return nums ? nums.map(num => +num).reduce((a, c) => a + c, 0) : 0;\n}\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120864"
  },
  {
    "id": "120807",
    "name": "숫자 비교하기",
    "fileName": "숫자-비교하기&120807&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(num1, num2) {\n  return num1 === num2 ? 1 : -1;\n}\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120807"
  },
  {
    "id": "120904",
    "name": "숫자 찾기",
    "fileName": "숫자-찾기&120904&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(num, k) {\n  const index = [...('' + num)].findIndex(n => +n === k);\n  return index === -1 ? -1 : index + 1;\n}\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120904"
  },
  {
    "id": "120819",
    "name": "아이스 아메리카노",
    "fileName": "아이스-아메리카노&120819&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(money) {\n  return [Math.floor(money / 5500), money % 5500];\n}\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120819"
  },
  {
    "id": "120866",
    "name": "안전지대",
    "fileName": "안전지대&120866&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(board) {\n  const isBombNearby = (r, c) => {\n    const nearby = [\n      [-1, -1],\n      [-1, 0],\n      [-1, 1],\n      [0, -1],\n      [0, 1],\n      [1, -1],\n      [1, 0],\n      [1, 1],\n    ];\n\n    const isInBoard = (r, c) => r >= 0 && r < board.length && c >= 0 && c < board.length;\n\n    return nearby.some(([dR, dC]) => isInBoard(r + dR, c + dC) && board[r + dR][c + dC] === 1);\n  };\n\n  let count = 0;\n\n  for (let r = 0; r < board.length; r++) {\n    for (let c = 0; c < board.length; c++) {\n      if (board[r][c] !== 1 && !isBombNearby(r, c)) count += 1;\n    }\n  }\n  return count;\n}\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120866"
  },
  {
    "id": "120892",
    "name": "암호 해독",
    "fileName": "암호-해독&120892&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(cipher, code) {\n  return [...cipher].reduce((a, c, i) => ((i + 1) % code === 0 ? a + c : a), '');\n}\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120892"
  },
  {
    "id": "120897",
    "name": "약수 구하기",
    "fileName": "약수-구하기&120897&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(n) {\n  let answer = [];\n  for (let i = 1; i < Math.sqrt(n); i++) {\n    if (n % i === 0) answer = [...answer, i, n / i];\n  }\n  if (Number.isInteger(Math.sqrt(n))) answer = [...answer, Math.sqrt(n)];\n  return answer.sort((a, b) => a - b);\n}\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120897"
  },
  {
    "id": "120830",
    "name": "양꼬치",
    "fileName": "양꼬치&120830&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(n, k) {\n  return n * 12000 + (k - Math.floor(n / 10)) * 2000;\n}\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120830"
  },
  {
    "id": "120923",
    "name": "연속된 수의 합",
    "fileName": "연속된-수의-합&120923&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(num, total) {\n  const numArr = Array.from({ length: num }, (_, i) => i);\n  const sum = numArr.reduce((a, c) => a + c);\n  return numArr.map(n => n - (sum - total) / num);\n}\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120923"
  },
  {
    "id": "120894",
    "name": "영어가 싫어요",
    "fileName": "영어가-싫어요&120894&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(numbers) {\n  const nums = { zero: 0, one: 1, two: 2, three: 3, four: 4, five: 5, six: 6, seven: 7, eight: 8, nine: 9 };\n  const regex = new RegExp(Object.keys(nums).join('|'), 'g');\n  return +numbers.replace(regex, key => nums[key]);\n}\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120894"
  },
  {
    "id": "120818",
    "name": "옷가게 할인 받기",
    "fileName": "옷가게-할인-받기&120818&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(price) {\n  if (price >= 500000) return Math.floor(price * 0.8);\n  if (price >= 300000) return Math.floor(price * 0.9);\n  if (price >= 100000) return Math.floor(price * 0.95);\n  return price;\n}\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120818"
  },
  {
    "id": "120956",
    "name": "옹알이",
    "fileName": "옹알이&120956&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(babbling) {\n  const convertPWordsToNum = word => {\n    const pWords = ['aya', 'ye', 'woo', 'ma'];\n    return pWords.reduce((result, pWord, i) => result.replaceAll(pWord, i), word);\n  };\n  const canPronounce = word => {\n    const result = convertPWordsToNum(word);\n    return !/[^\\d]/.test(result) && [...result].every((num, i) => i + 1 > result.length || num !== result[i + 1]);\n  };\n\n  return babbling.filter(b => canPronounce(b)).length;\n}\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120956"
  },
  {
    "id": "120869",
    "name": "외계어 사전",
    "fileName": "외계어-사전&120869&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(spell, dic) {\n  const sort = str => [...str].sort((a, b) => (a < b ? -1 : a !== b ? 1 : 0)).join('');\n  return dic.find(dic => sort(dic) === sort(spell.join(''))) ? 1 : 2;\n}\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120869"
  },
  {
    "id": "120834",
    "name": "외계행성의 나이",
    "fileName": "외계행성의-나이&120834&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(age) {\n  return [...('' + age)].map(num => String.fromCharCode('a'.charCodeAt(0) + +num)).join('');\n}",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120834"
  },
  {
    "id": "120878",
    "name": "유한소수 판별하기",
    "fileName": "유한소수-판별하기&120878&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(a, b) {\n  const getGCD = (a, b) => {\n    let gcd = 1;\n    for (let i = 1; i <= Math.min(a, b); i++) {\n      if (a % i === 0 && b % i === 0) gcd = i;\n    }\n    return gcd;\n  };\n\n  const getPrimeFactors = num => {\n    let pFactors = [];\n    for (let i = 2; i <= Math.sqrt(num); i++) {\n      while (num % i === 0) {\n        pFactors = [...pFactors, i];\n        num /= i;\n      }\n    }\n    if (num > 2) pFactors = [...pFactors, num];\n    return pFactors;\n  };\n\n  return getPrimeFactors(b / getGCD(a, b)).find(n => n !== 2 && n !== 5) ? 2 : 1;\n}\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120878"
  },
  {
    "id": "120885",
    "name": "이진수 더하기",
    "fileName": "이진수-더하기&120885&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(bin1, bin2) {\n  return (parseInt(bin1, 2) + parseInt(bin2, 2)).toString(2);\n}\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120885"
  },
  {
    "id": "120895",
    "name": "인덱스 바꾸기",
    "fileName": "인덱스-바꾸기&120895&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(my_string, num1, num2) {\n  const str = [...my_string];\n\n  [str[num1], str[num2]] = [str[num2], str[num1]];\n\n  return str.join('');\n}\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120895"
  },
  {
    "id": "120906",
    "name": "자릿수 더하기",
    "fileName": "자릿수-더하기&120906&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(n) {\n  return [...('' + n)].map(num => +num).reduce((a, c) => a + c, 0);\n}\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120906"
  },
  {
    "id": "120913",
    "name": "잘라서 배열로 저장하기",
    "fileName": "잘라서-배열로-저장하기&120913&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(my_str, n) {\n  let result = [];\n  for (let i = 0; i < my_str.length / n; i++) result = [...result, my_str.slice(i * n, i * n + n)];\n  return result;\n}\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120913"
  },
  {
    "id": "120871",
    "name": "저주의 숫자 3",
    "fileName": "저주의-숫자-3&120871&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(n) {\n  let num = 0;\n  let count = 0;\n\n  while (count < n) {\n    num += 1;\n    if (!('' + num).includes('3') && num % 3 !== 0) count += 1;\n  }\n\n  return num;\n}\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120871"
  },
  {
    "id": "120841",
    "name": "점의 위치 구하기",
    "fileName": "점의-위치-구하기&120841&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(dot) {\n  const [x, y] = dot;\n  if (y > 0) return x > 0 ? 1 : 2;\n  return x < 0 ? 3 : 4;\n}\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120841"
  },
  {
    "id": "120909",
    "name": "제곱수 판별하기",
    "fileName": "제곱수-판별하기&120909&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(n) {\n  return Number.isInteger(Math.sqrt(n)) ? 1 : 2;\n}\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120909"
  },
  {
    "id": "120922",
    "name": "종이 자르기",
    "fileName": "종이-자르기&120922&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(M, N) {\n  return M * N - 1;\n}\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120922"
  },
  {
    "id": "120845",
    "name": "주사위의 개수",
    "fileName": "주사위의-개수&120845&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(box, n) {\n  return Math.floor(box[0] / n) * Math.floor(box[1] / n) * Math.floor(box[2] / n);\n}\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120845"
  },
  {
    "id": "120888",
    "name": "중복된 문자 제거",
    "fileName": "중복된-문자-제거&120888&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(my_string) {\n  return [...new Set(my_string)].join('');\n}\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120888"
  },
  {
    "id": "120583",
    "name": "중복된 숫자 개수",
    "fileName": "중복된-숫자-개수&120583&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(array, n) {\n  return array.filter(a => a === n).length;\n}\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120583"
  },
  {
    "id": "120811",
    "name": "중앙값 구하기",
    "fileName": "중앙값-구하기&120811&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(array) {\n  return array.sort((a, b) => a - b)[Math.floor(array.length / 2)];\n}\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120811"
  },
  {
    "id": "120823",
    "name": "직각삼각형 출력하기",
    "fileName": "직각삼각형-출력하기&120823&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nconst readline = require('readline');\nconst rl = readline.createInterface({\n  input: process.stdin,\n  output: process.stdout,\n});\n\nlet input = [];\n\nrl.on('line', function (line) {\n  input = line.split(' ');\n}).on('close', function () {\n  for (let i = 1; i <= +input[0]; i++) console.log('*'.repeat(i));\n});\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120823"
  },
  {
    "id": "120860",
    "name": "직사각형 넓이 구하기",
    "fileName": "직사각형-넓이-구하기&120860&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(dots) {\n  const xDots = dots.flatMap(([x, y]) => x);\n  const yDots = dots.flatMap(([x, y]) => y);\n  const width = Math.max(...xDots) - Math.min(...xDots);\n  const height = Math.max(...yDots) - Math.min(...yDots);\n  return width * height;\n}\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120860"
  },
  {
    "id": "120835",
    "name": "진료순서 정하기",
    "fileName": "진료순서-정하기&120835&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(emergency) {\n  const sorted = [...emergency].sort((a, b) => b - a);\n  return emergency.map(e => sorted.findIndex(s => s === e) + 1);\n}\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120835"
  },
  {
    "id": "120824",
    "name": "짝수 홀수 개수",
    "fileName": "짝수-홀수-개수&120824&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(num_list) {\n  const evenLength = num_list.filter(n => n % 2 === 0).length;\n  return [evenLength, num_list.length - evenLength];\n}\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120824"
  },
  {
    "id": "120813",
    "name": "짝수는 싫어요",
    "fileName": "짝수는-싫어요&120813&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(n) {\n  let nums = [];\n  for (let i = 0; i <= n; i++) {\n    if (i % 2 === 1) nums = [...nums, i];\n  }\n  return nums;\n}\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120813"
  },
  {
    "id": "120831",
    "name": "짝수의 합",
    "fileName": "짝수의-합&120831&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(n) {\n  let answer = 0;\n  for (let i = 0; i <= n; i++) {\n    if (i % 2 === 0) answer += i;\n  }\n  return answer;\n}\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120831"
  },
  {
    "id": "120847",
    "name": "최댓값 만들기(1)",
    "fileName": "최댓값-만들기(1)&120847&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(numbers) {\n  const [first, second, ...rest] = numbers.sort((a, b) => b - a);\n  return first * second;\n}\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120847"
  },
  {
    "id": "120862",
    "name": "최댓값 만들기 (2)",
    "fileName": "최댓값-만들기-(2)&120862&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(numbers) {\n  const sorted = numbers.sort((a, b) => a - b);\n  return Math.max(sorted[0] * sorted[1], sorted[sorted.length - 1] * sorted[sorted.length - 2]);\n}\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120862"
  },
  {
    "id": "120812",
    "name": "최빈값 구하기",
    "fileName": "최빈값-구하기&120812&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(array) {\n  const counts = array.reduce((a, c) => (a[c] ? { ...a, [c]: a[c] + 1 } : { ...a, [c]: 1 }), {});\n  const max = Math.max(...Object.values(counts));\n  const modes = Object.keys(counts).filter(key => counts[key] === max);\n  return modes.length === 1 ? +modes[0] : -1;\n}\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120812"
  },
  {
    "id": "120884",
    "name": "치킨 쿠폰",
    "fileName": "치킨-쿠폰&120884&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(chicken) {\n  const order = coupons => {\n    if (coupons < 10) return 0;\n    const service = Math.floor(coupons / 10);\n    return service + order(service + (coupons % 10));\n  };\n  return order(chicken);\n}\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120884"
  },
  {
    "id": "120861",
    "name": "캐릭터의 좌표",
    "fileName": "캐릭터의-좌표&120861&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(keyinput, board) {\n  const moves = {\n    up: [0, 1],\n    down: [0, -1],\n    left: [-1, 0],\n    right: [1, 0],\n  };\n  const [rangeX, rangeY] = [Math.floor(board[0] / 2), Math.floor(board[1] / 2)];\n\n  return keyinput\n    .map(key => moves[key])\n    .reduce(\n      ([x, y], [mX, mY]) => (Math.abs(x + mX) > rangeX || Math.abs(y + mY) > rangeY ? [x, y] : [x + mX, y + mY]),\n      [0, 0]\n    );\n}\n\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120861"
  },
  {
    "id": "120853",
    "name": "컨트롤 제트",
    "fileName": "컨트롤-제트&120853&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(s) {\n  const arr = s.split(' ');\n  while (arr.includes('Z')) arr.splice(arr.indexOf('Z') - 1, 2);\n  return arr.map(n => +n).reduce((a, c) => a + c, 0);\n}\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120853"
  },
  {
    "id": "120880",
    "name": "특이한 정렬",
    "fileName": "특이한-정렬&120880&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(numlist, n) {\n  return numlist.sort((a, b) => {\n    const [aDiff, bDiff] = [Math.abs(a - n), Math.abs(b - n)];\n    if (aDiff === bDiff) return b - a;\n    return aDiff - bDiff;\n  });\n}\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120880"
  },
  {
    "id": "120826",
    "name": "특정 문자 제거하기",
    "fileName": "특정-문자-제거하기&120826&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(my_string, letter) {\n  return my_string.replaceAll(letter, '');\n}\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120826"
  },
  {
    "id": "120848",
    "name": "팩토리얼",
    "fileName": "팩토리얼&120848&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(n) {\n  let factorial = [1, 1];\n  for (let i = 2; n > factorial[i - 1]; i++) factorial[i] = factorial[i - 1] * i;\n\n  return factorial[factorial.length - 1] === n ? factorial.length - 1 : factorial.length - 2;\n}\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120848"
  },
  {
    "id": "120898",
    "name": "편지",
    "fileName": "편지&120898&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(message) {\n  return message.length * 2;\n}\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120898"
  },
  {
    "id": "120875",
    "name": "평행",
    "fileName": "평행&120875&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(dots) {\n  const getInclination = ([[x1, y1], [x2, y2]]) => (x2 !== x1 ? (y2 - y1) / (x2 - x1) : Infinity);\n  const isParallel = (line1, line2) => getInclination(line1) === getInclination(line2);\n\n  return dots.some(dot => {\n    const line1 = [dots[0], dot];\n    const line2 = dots.filter(dot => !line1.includes(dot));\n    return isParallel(line1, line2);\n  })\n    ? 1\n    : 0;\n}\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120875"
  },
  {
    "id": "120814",
    "name": "피자 나눠 먹기 (1)",
    "fileName": "피자-나눠-먹기-(1)&120814&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(n) {\n  return Math.floor((n - 1) / 7) + 1;\n}\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120814"
  },
  {
    "id": "120815",
    "name": "피자 나눠 먹기 (2)",
    "fileName": "피자-나눠-먹기-(2)&120815&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(n) {\n  const getLCM = (a, b) => {\n    let lcm = 1;\n    while ((lcm % a !== 0 || lcm % b !== 0) && lcm < a * b) lcm += 1;\n    return lcm;\n  };\n\n  return getLCM(n, 6) / 6;\n}\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120815"
  },
  {
    "id": "120816",
    "name": "피자 나눠 먹기 (3)",
    "fileName": "피자-나눠-먹기-(3)&120816&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(slice, n) {\n  return Math.floor((n - 1) / slice) + 1;\n}\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120816"
  },
  {
    "id": "120896",
    "name": "한 번만 등장한 문자",
    "fileName": "한-번만-등장한-문자&120896&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(s) {\n  const count = [...s].reduce((a, c) => (a[c] ? { ...a, [c]: a[c] + 1 } : { ...a, [c]: 1 }), {});\n  return Object.keys(count)\n    .filter(key => count[key] === 1)\n    .sort((a, b) => (a < b ? -1 : a > b ? 1 : 0))\n    .join('');\n}\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120896"
  },
  {
    "id": "120846",
    "name": "합성수 찾기",
    "fileName": "합성수-찾기&120846&.js",
    "level": 0,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//완벽한 정답이 아닙니다.\n// 1 - codeisneverodd\nfunction solution(n) {\n  const isPrime = num => {\n    for (let i = 2; i <= Math.sqrt(num); i++) {\n      if (num % i === 0) return true;\n    }\n    return false;\n  };\n\n  let count = 0;\n\n  for (let i = 1; i <= n; i++) {\n    if (isPrime(i)) count += 1;\n  }\n  \n  return count;\n}\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/120846"
  },
  {
    "id": "12901",
    "name": "2016년",
    "fileName": "2016년&12901&.js",
    "level": 1,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//더 좋은 풀이가 존재할 수 있습니다.\n// 1(🎩 refactor 220425) - codeisneverodd\nfunction solution(a, b) {\n  let count = 0;\n  const day = [\"SUN\", \"MON\", \"TUE\", \"WED\", \"THU\", \"FRI\", \"SAT\"];\n  const month = [0, 31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31];\n  for (let i = 1; i < a; i++) count += month[i];\n  count += b;\n  return day[(count + 4) % 7]; // 금요일 부터 1일 이므로\n}\n\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/12901"
  },
  {
    "id": "68935",
    "name": "3진법 뒤집기",
    "fileName": "3진법-뒤집기&68935&.js",
    "level": 1,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//더 좋은 풀이가 존재할 수 있습니다.\n// 1(🎩 refactor 220425) - codeisneverodd\nfunction solution(n) {\n  return parseInt(n.toString(3).split(\"\").reverse().join(\"\"), 3);\n}\n\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/68935"
  },
  {
    "id": "42748",
    "name": "K번째수",
    "fileName": "K번째수&42748&.js",
    "level": 1,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//더 좋은 풀이가 존재할 수 있습니다.\n// 1(🎩 refactor 220425) - codeisneverodd\nfunction solution(array, commands) {\n  return commands.map((cmd) => {\n    const arrCmd = array.slice(cmd[0] - 1, cmd[1]).sort((a, b) => a - b);\n    return arrCmd[cmd[2] - 1];\n  });\n}\n\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/42748"
  },
  {
    "id": "17682",
    "name": "[1차] 다트 게임",
    "fileName": "[1차]-다트-게임&17682&.js",
    "level": 1,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//더 좋은 풀이가 존재할 수 있습니다.\n// 1(🎩 refactor 220425) - codeisneverodd\nfunction solution(dartResult) {\n  const regex = /\\d{1,2}[SDT]{1}[*|#]?/g;\n  let result = [];\n  for (const dart of dartResult.match(regex)) {\n    const game = [...dart.split(/([SDT]{1})/)];\n    const score = game[0];\n    let bonus = 1;\n    let option = 1;\n    if (game[1] === \"S\") bonus = 1;\n    if (game[1] === \"D\") bonus = 2;\n    if (game[1] === \"T\") bonus = 3;\n\n    if (game[2] === \"*\") {\n      if (result.length !== 0) result[result.length - 1] *= 2;\n      option = 2;\n    }\n    if (game[2] === \"#\") option = -1;\n\n    result.push(score ** bonus * option);\n  }\n\n  return result.reduce((a, b) => a + b);\n}\n\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/17682"
  },
  {
    "id": "17681",
    "name": "[1차] 비밀지도",
    "fileName": "[1차]-비밀지도&17681&.js",
    "level": 1,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//더 좋은 풀이가 존재할 수 있습니다.\n// 1(🎩 refactor 220425) - codeisneverodd\nfunction solution(n, arr1, arr2) {\n  const answer = [];\n  for (let i = 0; i < n; i++) {\n    let row = (arr1[i] | arr2[i]).toString(2); //Bitwise\n    row = \"0\".repeat(n - row.length) + row;\n    row = row.replace(/[10]/g, (a) => (+a ? \"#\" : \" \"));\n    answer.push(row);\n  }\n  return answer;\n}\n\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/17681"
  },
  {
    "id": "12954",
    "name": "x만큼 간격이 있는 n개의 숫자",
    "fileName": "x만큼-간격이-있는-n개의-숫자&12954&.js",
    "level": 1,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//더 좋은 풀이가 존재할 수 있습니다.\n// 1(🎩 refactor 220425) - codeisneverodd\nfunction solution(x, n) {\n  return Array.from(Array(n), (_, index) => x * (index + 1));\n}\n\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/12954"
  },
  {
    "id": "12903",
    "name": "가운데 글자 가져오기",
    "fileName": "가운데-글자-가져오기&12903&.js",
    "level": 1,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//더 좋은 풀이가 존재할 수 있습니다.\n// 1(🎩 refactor 220425) - codeisneverodd\nfunction solution(s) {\n  return s.length % 2 !== 0\n    ? s[Math.floor(s.length / 2)]\n    : s.slice(s.length / 2 - 1, s.length / 2 + 1);\n}\n\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/12903"
  },
  {
    "id": "12906",
    "name": "같은 숫자는 싫어",
    "fileName": "같은-숫자는-싫어&12906&.js",
    "level": 1,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//더 좋은 풀이가 존재할 수 있습니다.\n// 1(🎩 refactor 220425) - codeisneverodd\nfunction solution(arr) {\n  return arr.filter((element, index) => element !== arr[index + 1]);\n}\n\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/12906"
  },
  {
    "id": "12910",
    "name": "나누어 떨어지는 숫자 배열",
    "fileName": "나누어-떨어지는-숫자-배열&12910&.js",
    "level": 1,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//더 좋은 풀이가 존재할 수 있습니다.\n// 1(🎩 refactor 220425) - codeisneverodd\nfunction solution(arr, divisor) {\n  const answer = arr.filter((element) => element % divisor === 0);\n  answer.length === 0 ? answer.push(-1) : answer.sort((a, b) => a - b);\n  return answer;\n}\n\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/12910"
  },
  {
    "id": "87389",
    "name": "나머지가 1이 되는 수 찾기",
    "fileName": "나머지가-1이-되는-수-찾기&87389&.js",
    "level": 1,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//더 좋은 풀이가 존재할 수 있습니다.\n// 1(🎩 refactor 220425) - codeisneverodd\nfunction solution(n) {\n\n  let answer = 0;\n  for (let divisor = n - 1; divisor >= 2; divisor--) {\n    if (n % divisor === 1) answer = divisor;\n  }\n  return answer;\n}\n\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/87389"
  },
  {
    "id": "70128",
    "name": "내적",
    "fileName": "내적&70128&.js",
    "level": 1,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//더 좋은 풀이가 존재할 수 있습니다.\n// 1(🎩 refactor 220425) - codeisneverodd\nfunction solution(a, b) {\n  return a.reduce((x, y, i) => x + y * b[i], 0);\n}\n\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/70128"
  },
  {
    "id": "68644",
    "name": "두 개 뽑아서 더하기",
    "fileName": "두-개-뽑아서-더하기&68644&.js",
    "level": 1,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//더 좋은 풀이가 존재할 수 있습니다.\n// 1(🎩 refactor 220425) - codeisneverodd\nfunction solution(numbers) {\n  const answer = [];\n  for (let i = 0; i < numbers.length; i++) {\n    for (let j = i + 1; j < numbers.length; j++) {\n      answer.push(numbers[i] + numbers[j]);\n    }\n  }\n  return [...new Set(answer)].sort((a, b) => a - b);\n}\n\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/68644"
  },
  {
    "id": "12912",
    "name": "두 정수 사이의 합",
    "fileName": "두-정수-사이의-합&12912&.js",
    "level": 1,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//더 좋은 풀이가 존재할 수 있습니다.\n// 1(🎩 refactor 220425) - codeisneverodd\nfunction solution(a, b) {\n  let answer = 0;\n  for (let i = Math.min(a, b); i <= Math.max(a, b); i++) {\n    answer += i;\n  }\n  return answer;\n}\n\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/12912"
  },
  {
    "id": "77484",
    "name": "로또의 최고 순위와 최저 순위",
    "fileName": "로또의-최고-순위와-최저-순위&77484&.js",
    "level": 1,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//더 좋은 풀이가 존재할 수 있습니다.\n// 1(🎩 refactor 220425) - codeisneverodd\nfunction solution(lottos, win_nums) {\n  const zeroCount = lottos.filter((e) => e === 0).length;\n  const matchCount = win_nums.filter((e) => lottos.includes(e)).length;\n  const matchToRank = [6, 6, 5, 4, 3, 2, 1];\n  const lowRank = matchToRank[matchCount];\n  const highRank = zeroCount === 6 ? 1 : matchToRank[matchCount + zeroCount];\n\n  return [highRank, lowRank];\n}\n\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/77484"
  },
  {
    "id": "42840",
    "name": "모의고사",
    "fileName": "모의고사&42840&.js",
    "level": 1,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//더 좋은 풀이가 존재할 수 있습니다.\n// 1(🎩 refactor 220425) - codeisneverodd\nfunction solution(answers) {\n  const answer = [];\n  const firstPattern = [1, 2, 3, 4, 5];\n  const firstPLength = firstPattern.length;\n  const secondPattern = [2, 1, 2, 3, 2, 4, 2, 5];\n  const secondPLength = secondPattern.length;\n  const thirdPattern = [3, 3, 1, 1, 2, 2, 4, 4, 5, 5];\n  const thirdLength = thirdPattern.length;\n  let correctCount = [0, 0, 0];\n\n  for (let i = 0, len = answers.length; i < len; i++) {\n    if (answers[i] === firstPattern[i % firstPLength]) correctCount[0] += 1;\n    if (answers[i] === secondPattern[i % secondPLength]) correctCount[1] += 1;\n    if (answers[i] === thirdPattern[i % thirdLength]) correctCount[2] += 1;\n  }\n\n  const maxScore = Math.max(...correctCount);\n  for (let i = 0; i < 3; i++) {\n    if (correctCount[i] === maxScore) answer.push(i + 1);\n  }\n\n  return answer;\n}\n\n// 완벽한 정답이 아닙니다.\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/42840"
  },
  {
    "id": "12916",
    "name": "문자열 내 p와 y의 개수",
    "fileName": "문자열-내-p와-y의-개수&12916&.js",
    "level": 1,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//더 좋은 풀이가 존재할 수 있습니다.\n// 1(🎩 refactor 220425) - codeisneverodd\nfunction solution(s) {\n  const countP = [...s.matchAll(/p/gi)].length;\n  const countY = [...s.matchAll(/y/gi)].length;\n  return countP === countY;\n}\n\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/12916"
  },
  {
    "id": "12915",
    "name": "문자열 내 마음대로 정렬하기",
    "fileName": "문자열-내-마음대로-정렬하기&12915&.js",
    "level": 1,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//더 좋은 풀이가 존재할 수 있습니다.\n// 1(🎩 refactor 220425) - codeisneverodd\nfunction solution(strings, n) {\n  return strings.sort((a, b) => {\n    if (a[n] < b[n]) return -1;\n    if (a[n] > b[n]) return 1;\n    if (a[n] === b[n]) return a < b ? -1 : 1;\n    return 0;\n  });\n}\n\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/12915"
  },
  {
    "id": "12917",
    "name": "문자열 내림차순으로 배치하기",
    "fileName": "문자열-내림차순으로-배치하기&12917&.js",
    "level": 1,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//더 좋은 풀이가 존재할 수 있습니다.\n// 1(🎩 refactor 220425) - codeisneverodd\nfunction solution(s) {\n  return s\n    .split(\"\")\n    .sort((a, b) => {\n      if (a < b) return 1;\n      if (a > b) return -1;\n      return 0;\n    })\n    .join(\"\");\n}\n\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/12917"
  },
  {
    "id": "12918",
    "name": "문자열 다루기 기본",
    "fileName": "문자열-다루기-기본&12918&.js",
    "level": 1,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//더 좋은 풀이가 존재할 수 있습니다.\n// 1(🎩 refactor 220425) - codeisneverodd\nfunction solution(s) {\n  return s.search(/\\D/g) < 0 && (s.length === 4 || s.length === 6);\n}\n\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/12918"
  },
  {
    "id": "12925",
    "name": "문자열을 정수로 바꾸기",
    "fileName": "문자열을-정수로-바꾸기&12925&.js",
    "level": 1,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//더 좋은 풀이가 존재할 수 있습니다.\n// 1(🎩 refactor 220425) - codeisneverodd\nfunction solution(s) {\n  return parseInt(s);\n}\n\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/12925"
  },
  {
    "id": "82612",
    "name": "부족한 금액 계산하기",
    "fileName": "부족한-금액-계산하기&82612&.js",
    "level": 1,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//더 좋은 풀이가 존재할 수 있습니다.\n// 1(🎩 refactor 220425) - codeisneverodd\nfunction solution(price, money, count) {\n  let totalCost = 0;\n  for (let i = 1; i <= count; i++) totalCost += price * i;\n  return totalCost <= money ? 0 : totalCost - money;\n}\n\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/82612"
  },
  {
    "id": "12919",
    "name": "서울에서 김서방 찾기",
    "fileName": "서울에서-김서방-찾기&12919&.js",
    "level": 1,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//더 좋은 풀이가 존재할 수 있습니다.\n// 1(🎩 refactor 220425) - codeisneverodd\nfunction solution(seoul) {\n  return `김서방은 ${seoul.indexOf(\"Kim\")}에 있다`;\n}\n\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/12919"
  },
  {
    "id": "118666",
    "name": "성격 유형 검사하기",
    "fileName": "성격-유형-검사하기&118666&.js",
    "level": 1,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//더 좋은 풀이가 존재할 수 있습니다.\n// 1 - ssi02014\nfunction solution(survey, choices) {\n  const points = [3, 2, 1, 0, 1, 2, 3];\n  const pointBoard = {\n    R: 0,\n    T: 0,\n    C: 0,\n    F: 0,\n    J: 0,\n    M: 0,\n    A: 0,\n    N: 0,\n  };\n  let result = \"\";\n\n  // 카테고리 별 점수 추가\n  for (let i = 0; i < survey.length; i++) {\n    const categories = survey[i];\n\n    if (choices[i] < 4) {\n      pointBoard[categories[0]] += points[choices[i] - 1];\n    } else if (choices[i] > 4) {\n      pointBoard[categories[1]] += points[choices[i] - 1];\n    }\n  }\n\n  const pointBoardEntries = Object.entries(pointBoard);\n\n  // 지표에 맞게 결과 값 도출\n  for (let i = 0; i < pointBoardEntries.length; i += 2) {\n    const [curCategory, curValue] = pointBoardEntries[i];\n    const [nextCategory, nextValue] = pointBoardEntries[i + 1];\n\n    if (curValue < nextValue) {\n      result += nextCategory;\n    } else {\n      result += curCategory;\n    }\n  }\n\n  return result;\n}\n\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/118666"
  },
  {
    "id": "12977",
    "name": "소수 만들기",
    "fileName": "소수-만들기&12977&.js",
    "level": 1,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//더 좋은 풀이가 존재할 수 있습니다.\n// 1(🎩 refactor 220425) - codeisneverodd\nfunction solution(nums) {\n  let answer = 0;\n  const length = nums.length;\n  for (let i = 0; i < length; i++) {\n    for (let j = i + 1; j < length; j++) {\n      for (let k = j + 1; k < length; k++) {\n        const sum = nums[i] + nums[j] + nums[k];\n        if (isPrime(sum)) answer += 1;\n      }\n    }\n  }\n\n  return answer;\n}\n\nfunction isPrime(num) {\n  for (let i = 2; i <= Math.sqrt(num); i++) {\n    if (num % i === 0) return false;\n  }\n  return num >= 2;\n}\n\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/12977"
  },
  {
    "id": "42839",
    "name": "소수 찾기",
    "fileName": "소수-찾기&42839&.js",
    "level": 1,
    "code": "//https://github.com/codeisneverodd/programmers-coding-test\n//더 좋은 풀이가 존재할 수 있습니다.\n// 1(🎩 refactor 220425) - codeisneverodd\nfunction solution(numbers) {\n  let answer = 0;\n  const numArr = numbers.split(\"\");\n  const permutationAll = [];\n  for (let r = 1; r <= numbers.length; r++) {\n    const permutationR = Permutation(numArr, r).map((arr) =>\n      parseInt(arr.join(\"\"))\n    );\n    for (let i = 0; i < permutationR.length; i++)\n      permutationAll.push(permutationR[i]);\n  }\n  const permutationSet = [...new Set(permutationAll)];\n  for (const number of permutationSet) {\n    if (isPrime(number)) answer += 1;\n  }\n  return answer;\n}\n\nfunction Permutation(arr, r) {\n  const result = [];\n  if (r === 1) return arr.map((num) => [num]);\n  arr.forEach((fixed, index, org) => {\n    const rest = [...org.slice(0, index), ...org.slice(index + 1)];\n    const permutation = Permutation(rest, r - 1);\n    const attached = permutation.map((numbers) => [fixed, ...numbers]);\n    result.push(...attached);\n  });\n  return result;\n}\n\nfunction isPrime(num) {\n  for (let i = 2; i <= Math.sqrt(num); i++) {\n    if (num % i === 0) return false;\n  }\n  return num >= 2;\n}\n\n\n",
    "link": "https://school.programmers.co.kr/learn/courses/30/lessons/42839"