View difference between Paste ID: dZ64j1nG and iBHYYh1R

 // Author : Saurav Kalsoor
-// K Unique String - JAVA
+// K Unique String - KOTLIN
 
 import java.util.*;
 
-public class Test {
+var sc = Scanner(System.`in`)
-    static Scanner sc = new Scanner(System.in);
+
-    public static void main(String[] args) {
+fun main() {
-        String s = sc.next();
+    val s = sc.next()
-		int k = sc.nextInt();
+    val k = sc.nextInt()
     println(kUniqueString(s, k))
-		System.out.println(kUniqueString(s, k));
+
 
 fun kUniqueString(s: String, k: Int): Int {
-    public static int kUniqueString(String s, int k) {
+    val freq = HashMap<Char, Int>()
-        HashMap<Character, Integer> freq = new HashMap<>();
+    for (i in 0 until s.length) {
         freq[s[i]] = freq.getOrDefault(s[i], 0) + 1
-		for(int i = 0; i < s.length(); i++){
+
-			freq.put(s.charAt(i), freq.getOrDefault(s.charAt(i), 0) + 1);
+    val st: MutableSet<MyPair> =
-		}
+        TreeSet { a, b ->
             if (a.frequency == b.frequency)
-        Set<MyPair> st = new TreeSet<>(new Comparator<MyPair>() {
+                a.ch - b.ch
-			@Override
+            else
-			public int compare(MyPair a, MyPair b) {
+                a.frequency - b.frequency
-				if(a.frequency == b.frequency)
+        }
-					return a.ch - b.ch;
+
-				return a.frequency - b.frequency;
+    for ((key, value) in freq) {
-			}
+        st.add(MyPair(key, value))
-		});
+
     var distinct = freq.size
-        for(Map.Entry<Character, Integer> x : freq.entrySet()){
+    var changes = 0
-			st.add(new MyPair(x.getKey(), x.getValue()) );
+    for (x in st) {
-		}
+        if (distinct <= k) break
         changes += x.frequency
-        int distinct = freq.size(), changes = 0;
+        distinct--
     }
-        for(MyPair x : st){
+    return changes
-            if(distinct <= k)
+
-                break;
+
 internal class MyPair(var ch: Char, var frequency: Int)