@@ -1,5 +1,28 @@
+import java.util.Collections;
+import java.util.HashMap;
+import java.util.List;
+import java.util.Map;
+import java.util.ArrayList;
+
 public class Main {
     public static void main(String[] args) {
-        System.out.println("Hello world!");
+
+        Map<Integer,Integer> map1 = new HashMap<>();
+        Map<Integer,Integer> map2 = new HashMap<>();
+        map1.put(1,9);
+        map1.put(2,7);
+        map1.put(3,4);
+        map1.put(4,0);
+        map1.put(5,1);
+        List<Integer> list= new ArrayList<>();
+        list.add(1);
+        list.add(2);
+        list.add(3);
+        list.add(4);
+        list.add(5);
+
+        Collections.sort(list, (o1, o2) -> (map1.get(o1)).compareTo(map1.get(o2)));
+
+        System.out.println(list.toString());
     }
 }
@@ -0,0 +1,61 @@
+import java.util.*;
+
+
+public class 구현_카카오뉴스클러스터링 {
+
+    class Solution {
+        public int solution(String str1, String str2) {
+            ArrayList<String> multiSet1 = new ArrayList<>();
+            ArrayList<String> multiSet2 = new ArrayList<>();
+            ArrayList<String> union = new ArrayList<>();
+            ArrayList<String> intersection = new ArrayList<>();
+
+            str1 = str1.toLowerCase();
+            str2 = str2.toLowerCase();
+
+            for(int i = 0 ; i < str1.length() - 1 ; ++i){
+                char first = str1.charAt(i);
+                char second = str1.charAt(i + 1);
+
+                if(first >= 'a' && first <= 'z' &&
+                        second >= 'a' && second <= 'z'){
+                    multiSet1.add(first + "" + second);
+                }
+            }
+
+            for(int i = 0 ; i < str2.length() - 1 ; ++i){
+                char first = str2.charAt(i);
+                char second = str2.charAt(i + 1);
+
+                if(first >= 'a' && first <= 'z' &&
+                        second >= 'a' && second <= 'z'){
+                    multiSet2.add(first + "" + second);
+                }
+            }
+
+            Collections.sort(multiSet1);
+            Collections.sort(multiSet2);
+
+            for(String s : multiSet1){
+                if(multiSet2.remove(s)){
+                    intersection.add(s);
+                }
+                union.add(s);
+            }
+
+            for(String s : multiSet2){
+                union.add(s);
+            }
+
+            double jakard = 0;
+
+            if(union.size() == 0) {
+                jakard = 1;
+            } else {
+                jakard = (double)intersection.size() / (double)union.size();
+            }
+
+            return (int)(jakard * 65536);
+        }
+    }
+}
@@ -0,0 +1,57 @@
+import java.util.*;
+
+
+public class 구현_카카오실행률 {
+
+    class Solution {
+        public int[] solution(int N, int[] stages) {
+            int[] answer = {};
+
+            Arrays.sort(stages);
+            // System.out.println(Arrays.toString(stages));
+
+            Map<Integer,Double> failMap = new HashMap<>();
+
+            int count = 0;
+            int n = stages[0];
+            for(int i=0;i<stages.length; i++){
+                if( n  == N+1){
+                    break;
+                }
+                if (n != stages[i]){
+                    double fail = (double) count / (stages.length - i + count);
+                    // System.out.println(fail);
+                    failMap.put(n, fail);
+                    n = stages[i];
+                    count = 0;
+                }
+                count++;
+            }
+            if (n <= N){
+                failMap.put(n,1.0);
+            }
+            // System.out.println(failMap.keySet());
+            // System.out.println(failMap.get(4));
+
+            for (int i=1;i<=N;i++){
+                failMap.put(i,failMap.getOrDefault(i,0.0));
+            }
+
+
+            List<Integer> list = new ArrayList<>();
+            for (int i=0;i<N;i++){
+                // A[i] = i+1;
+                list.add(i+1);
+            }
+
+            Collections.sort(list, (o1, o2) -> (failMap.get(o2)).compareTo(failMap.get(o1)));
+
+            int[] A = new int[list.size()];
+            for (int i=0;i<list.size();i++){
+                A[i] = list.get(i);
+            }
+
+            return A;
+        }
+    }
+}