diff --git a/Challenge/dean6927/forEachFilter/README.md b/Challenge/dean6927/forEachFilter/README.md
new file mode 100644
index 00000000..6dcbc7c2
--- /dev/null
+++ b/Challenge/dean6927/forEachFilter/README.md
@@ -0,0 +1,3 @@
+## 설명
+
+배열 원소중 40 이상인 수만 뽑아 배열을 만드세요.
diff --git a/Challenge/dean6927/forEachFilter/solve.js b/Challenge/dean6927/forEachFilter/solve.js
new file mode 100644
index 00000000..b7d0c783
--- /dev/null
+++ b/Challenge/dean6927/forEachFilter/solve.js
@@ -0,0 +1,12 @@
+// write your codes
+const inputArray = [100, 10, 20, 40];
+
+// write your codes
+
+let answer = [];
+inputArray.forEach((el) => {
+  if (el >= 40) {
+    answer.push(el);
+  }
+});
+console.log(answer);
diff --git a/Challenge/dean6927/forEachFilter/solve.test.js b/Challenge/dean6927/forEachFilter/solve.test.js
new file mode 100644
index 00000000..3d73b25c
--- /dev/null
+++ b/Challenge/dean6927/forEachFilter/solve.test.js
@@ -0,0 +1,12 @@
+const { solution } = require('./solve');
+
+const test1 = {
+  input: [100, 10, 20, 40],
+  answer: [100, 40],
+};
+
+describe('forEachFilter', () => {
+  test('test1', () => {
+    expect(solution(test1.input)).toEqual(test1.answer);
+  });
+});