diff --git "a/Programmers/\354\227\260\354\212\265\353\254\270\354\240\234/LEVEL1/\353\221\230\353\247\214\354\235\230 \354\225\224\355\230\270/Sanghoo.java" "b/Programmers/\354\227\260\354\212\265\353\254\270\354\240\234/LEVEL1/\353\221\230\353\247\214\354\235\230 \354\225\224\355\230\270/Sanghoo.java"
new file mode 100644
index 0000000..180016f
--- /dev/null
+++ "b/Programmers/\354\227\260\354\212\265\353\254\270\354\240\234/LEVEL1/\353\221\230\353\247\214\354\235\230 \354\225\224\355\230\270/Sanghoo.java"	
@@ -0,0 +1,28 @@
+package programmers.둘만의암호;
+
+public class Sanghoo {
+    public static void main(String[] args) {
+        String s = "aukks";
+        String skip = "wbqd";
+        int index = 5;
+        solution(s, skip, index);
+    }
+
+    public static String solution(String s, String skip, int index) {
+        StringBuilder sb = new StringBuilder();
+
+        for (char ch : s.toCharArray()) {
+            int idx = index;
+            while (idx > 0) {
+                ch = (++ch > 'z') ? 'a' : ch;
+
+                if (!skip.contains((String.valueOf(ch)))) {
+                    idx--;
+                }
+            }
+            sb.append(ch);
+        }
+
+        return sb.toString();
+    }
+}
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;
+    }
+
+}