Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly
Sign up
Appearance settings

Commit adc0b6d

Browse files
Merge branch 'main' into main
2 parents 1c4fe1a + c3c72e4 commit adc0b6d

File tree

102 files changed

+1031
-1
lines changed

Some content is hidden

Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.

102 files changed

+1031
-1
lines changed

‎README.md

Lines changed: 108 additions & 0 deletions
Lines changed: 10 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,10 @@
1+
//https://github.com/codeisneverodd/programmers-coding-test
2+
//완벽한 정답이 아닙니다.
3+
//정답 1 - codeisneverodd
4+
function solution(num_list, n) {
5+
let result = [];
6+
for (let i = 0; i < num_list.length / n; i++) {
7+
result = [...result, num_list.slice(i * n, i * n + n)];
8+
}
9+
return result;
10+
}

‎level-0/369게임&120891&.js

Lines changed: 6 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,6 @@
1+
//https://github.com/codeisneverodd/programmers-coding-test
2+
//완벽한 정답이 아닙니다.
3+
//정답 1 - codeisneverodd
4+
function solution(order) {
5+
return [...('' + order)].filter(num => num === '3' || num === '6' || num === '9').length;
6+
}

‎level-0/7의-개수&120912&.js

Lines changed: 6 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,6 @@
1+
//https://github.com/codeisneverodd/programmers-coding-test
2+
//완벽한 정답이 아닙니다.
3+
//정답 1 - codeisneverodd
4+
function solution(array) {
5+
return [...array.join('')].filter(a => a === '7').length;
6+
}

‎level-0/A로-B-만들기&120886&.js

Lines changed: 7 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,7 @@
1+
//https://github.com/codeisneverodd/programmers-coding-test
2+
//완벽한 정답이 아닙니다.
3+
//정답 1 - codeisneverodd
4+
function solution(before, after) {
5+
const sort = str => [...str].sort((a, b) => (a < b ? -1 : a !== b ? 1 : 0)).join('');
6+
return sort(before) === sort(after) ? 1 : 0;
7+
}

‎level-0/OX퀴즈&120907&.js

Lines changed: 9 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,9 @@
1+
//https://github.com/codeisneverodd/programmers-coding-test
2+
//완벽한 정답이 아닙니다.
3+
//정답 1 - codeisneverodd
4+
function solution(quiz) {
5+
return quiz.map(q => {
6+
const [formula, answer] = q.split('=');
7+
return eval(formula) === +answer ? 'O' : 'X';
8+
});
9+
}

‎level-0/k의-개수&120887&.js

Lines changed: 10 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,10 @@
1+
//https://github.com/codeisneverodd/programmers-coding-test
2+
//완벽한 정답이 아닙니다.
3+
//정답 1 - codeisneverodd
4+
function solution(i, j, k) {
5+
let count = 0;
6+
for (let num = i; num <= j; num++) {
7+
count += [...('' + num)].filter(n => +n === k).length;
8+
}
9+
return count;
10+
}
Lines changed: 6 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,6 @@
1+
//https://github.com/codeisneverodd/programmers-coding-test
2+
//완벽한 정답이 아닙니다.
3+
//정답 1 - codeisneverodd
4+
function solution(n, numlist) {
5+
return numlist.filter(num => num % n === 0);
6+
}

‎level-0/가까운-수&120890&.js

Lines changed: 7 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,7 @@
1+
//https://github.com/codeisneverodd/programmers-coding-test
2+
//완벽한 정답이 아닙니다.
3+
//정답 1 - codeisneverodd
4+
function solution(array, n) {
5+
const minDiff = Math.min(...array.map(a => Math.abs(a - n)));
6+
return array.sort((a, b) => a - b).find(a => Math.abs(a - n) === minDiff);
7+
}

‎level-0/가위-바위-보&120839&.js

Lines changed: 7 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,7 @@
1+
//https://github.com/codeisneverodd/programmers-coding-test
2+
//완벽한 정답이 아닙니다.
3+
//정답 1 - codeisneverodd
4+
function solution(rsp) {
5+
const win = { 0: 5, 2: 0, 5: 2 };
6+
return [...rsp].map(num => win[num]).join('');
7+
}

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /