diff --git a/prob1.js b/prob1.js
index 2eed222..b9e70fb 100644
--- a/prob1.js
+++ b/prob1.js
@@ -1,7 +1,18 @@
 //1. 함수 로직 작성 문제
 
 function solution(num, total) {
-  let answer = [];
 
-  return answer;
+  let start = (total - (num * (num - 1) / 2)) / num;
+  let result = [];
+
+
+  for (let i = 0; i < num; i++){
+    result.push(start+i);
+  }
+
+  return result;
 }
+
+console.log(solution(3,12));
+console.log(solution(4,14));
+console.log(solution(5,5));
\ No newline at end of file
diff --git a/prob2.js b/prob2.js
index 43114a4..466aa36 100644
--- a/prob2.js
+++ b/prob2.js
@@ -1,6 +1,6 @@
 //2. map활용 문제
 const numbers = [1, 2, 3, 4, 5];
 
-let answer;
+let answer = numbers.map(num => (num % 2 === 0 ? "짝수" : "홀수"));
 
-console.log(answer);
+console.log(answer);
\ No newline at end of file
diff --git a/prob3.js b/prob3.js
index b1eacf7..6fa1ccd 100644
--- a/prob3.js
+++ b/prob3.js
@@ -7,8 +7,29 @@ let likelion = [
 
 // 1번 문제 코드작성
 
+while(true){
+  let swap = false;
+
+  for (let i = 0; i <likelion.length-1; i++){
+    if (likelion[i].age>likelion[i+1].age){
+      let temp = likelion[i];
+      likelion[i] = likelion[i+1];
+      likelion[i+1]= temp;
+      swap = true;
+    }
+  }
+  if (swap===false) break;
+}
+
+console.log(likelion);
+
 // 2번 문제 코드작성
 let result2 = [];
+for(let i = 0; i <likelion.length; i++){
+  if (likelion[i].age>=24){
+    result2.push(likelion[i]);
+  }
+}
 
 console.log(result2);
 
@@ -16,4 +37,10 @@ console.log(result2);
 let targetName = "전수빈";
 let result3 = null;
 
-console.log(result3);
+for (let i = 0; i < likelion.length; i++){
+  if (likelion[i].name === targetName){
+    result3 = likelion[i].part
+    break;
+  }
+}
+console.log(result3);
\ No newline at end of file