Solved 2 problems

Author: gyeong-hyeon-kim

level-2/카펫.js

@@ -0,0 +1,13 @@
+//https://github.com/codeisneverodd/programmers-coding-test
+//완벽한 정답이 아닙니다.
+function solution(brown, yellow) {
+    var answer = [];
+    const size = brown + yellow
+    answer = widthHeightPair(size).filter(pair => (pair[0] + pair[1]) * 2 - 4 === brown)[0]
+    return answer;
+}
+function widthHeightPair(size){
+    let result = []
+    for(let i=1; i<=Math.sqrt(size); i++) if(size % i === 0) result.push([size/i, i])
+    return result
+}

level-2/큰-수-만들기.js

@@ -0,0 +1,16 @@
+//https://github.com/codeisneverodd/programmers-coding-test
+//완벽한 정답이 아닙니다.
+function solution(number, k) {
+    var answer = '';
+    let answerStack = [0]
+    let deleteCount = -1
+    for(let i=0; i<number.length; i++){
+        while(deleteCount < k && number[i] > answerStack[answerStack.length-1]) {
+            answerStack.pop()
+            deleteCount++
+        }
+        if(answerStack.length < number.length - k) answerStack.push(number[i])
+    }
+    answer = answerStack.join('')
+    return answer;
+}