diff --git "a/Programmers/\354\227\260\354\212\265\353\254\270\354\240\234/LEVEL1/\355\226\204\353\262\204\352\261\260 \353\247\214\353\223\244\352\270\260/Sanghoo.java" "b/Programmers/\354\227\260\354\212\265\353\254\270\354\240\234/LEVEL1/\355\226\204\353\262\204\352\261\260 \353\247\214\353\223\244\352\270\260/Sanghoo.java"
new file mode 100644
index 0000000..0410f6a
--- /dev/null
+++ "b/Programmers/\354\227\260\354\212\265\353\254\270\354\240\234/LEVEL1/\355\226\204\353\262\204\352\261\260 \353\247\214\353\223\244\352\270\260/Sanghoo.java"	
@@ -0,0 +1,26 @@
+package programmers.햄버거만들기;
+
+public class Sanghoo {
+    public static void main(String[] args) {
+        int[] arr = {2, 2, 2, 2, 2, 1, 2, 3, 1, 1, 2, 3, 1};
+        solution(arr);
+    }
+
+    public static int solution(int[] ingredient) {
+        final String MAKE_BURGER = "1231";
+        int answer = 0;
+        StringBuilder sb = new StringBuilder();
+
+        for (int i : ingredient) {
+            sb.append(i);
+
+            if (i == 1 && sb.length() >= 4 && sb.subSequence(sb.length() - 4, sb.length()).equals(MAKE_BURGER)) {
+                sb.delete(sb.length() - 4, sb.length());
+                answer++;
+            }
+        }
+
+        return answer;
+    }
+
+}
diff --git "a/Programmers/\354\227\260\354\212\265\353\254\270\354\240\234/LEVEL2/\354\210\253\354\236\220\354\235\230 \355\221\234\355\230\204/Sanghoo.java" "b/Programmers/\354\227\260\354\212\265\353\254\270\354\240\234/LEVEL2/\354\210\253\354\236\220\354\235\230 \355\221\234\355\230\204/Sanghoo.java"
new file mode 100644
index 0000000..0f0f6aa
--- /dev/null
+++ "b/Programmers/\354\227\260\354\212\265\353\254\270\354\240\234/LEVEL2/\354\210\253\354\236\220\354\235\230 \355\221\234\355\230\204/Sanghoo.java"	
@@ -0,0 +1,29 @@
+package Programmers.숫자의표현;
+
+public class Sanghoo {
+
+    public static void main(String[] args) {
+        solution(15);
+    }
+
+    public static int solution(int n) {
+        int answer = 1;
+
+        for (int i = 1; i < n; i++) {
+            int sum = i;
+
+            for (int j = i + 1; j < n; j++) {
+                sum += j;
+
+                if (sum > n) break;
+                if (sum == n) {
+                    answer++;
+                    break;
+                }
+            }
+        }
+
+        return answer;
+    }
+
+}