diff --git a/prob1.js b/prob1.js
index 2eed222..7a78a39 100644
--- a/prob1.js
+++ b/prob1.js
@@ -1,7 +1,17 @@
 //1. 함수 로직 작성 문제
 
 function solution(num, total) {
-  let answer = [];
 
-  return answer;
+  
+    //배열의 중앙 인덱스의 값임
+    let mNum= total/num;
+    let firstNum = mNum-((num-1)/2) //짝수개
+
+    let answer = [];
+
+    for(i=0;i<num;i++){
+        answer[i] = firstNum;
+        firstNum++;
+    }
+    return answer;
 }
diff --git a/prob2.js b/prob2.js
index 43114a4..1540f11 100644
--- a/prob2.js
+++ b/prob2.js
@@ -1,6 +1,11 @@
 //2. map활용 문제
 const numbers = [1, 2, 3, 4, 5];
 
-let answer;
+let answer =[];
 
+
+answer = numbers.map(function(num){
+    return num%2===0?"짝수":"홀수";
+});
 console.log(answer);
+
diff --git a/prob3.js b/prob3.js
index b1eacf7..f94b540 100644
--- a/prob3.js
+++ b/prob3.js
@@ -7,13 +7,47 @@ let likelion = [
 
 // 1번 문제 코드작성
 
+
+console.log("1번문제");
+
+for(let i=0;i<likelion.length-1;i++){
+  for(let j=i+1;j<likelion.length;j++){
+    if(likelion[i].age > likelion[j].age){
+      let temp = likelion[i];
+      likelion[i]=likelion[j];
+      likelion[j]=temp;
+    }
+  }
+ }
+console.log(likelion);
+
+  
+
 // 2번 문제 코드작성
+
+console.log("2번문제");
 let result2 = [];
 
-console.log(result2);
+for(let i=0;i<likelion.length;i++){
+  if(likelion[i].age >=24){
+    result2 = likelion[i];
+    console.log(result2);
+  }
+}
+
+
+
+
 
 // 3번 문제 코드작성
+console.log("3번문제")
 let targetName = "전수빈";
 let result3 = null;
 
+for(let i=0;i<likelion.length;i++){
+  if(likelion[i].name === targetName){
+    result3 = likelion[i].part;
+  }
+}
+
 console.log(result3);