View difference between Paste ID: iBHYYh1R and JaufmpZH

 // Author : Saurav Kalsoor
-// Count Quadruplets - JAVA
+// K Unique String - JAVA
 
 import java.util.*;
 
 public class Test {
     static Scanner sc = new Scanner(System.in);
     public static void main(String[] args) {
-        int n = sc.nextInt();
+        String s = sc.next();
-        int m = sc.nextInt();
+		int k = sc.nextInt();
-        int p = sc.nextInt();
+
-        int q = sc.nextInt();
+		System.out.println(kUniqueString(s, k));
-        int target = sc.nextInt();
+
 
-        ArrayList<Integer> a = new ArrayList<>();
+    public static int kUniqueString(String s, int k) {
-        ArrayList<Integer> b = new ArrayList<>();
+        HashMap<Character, Integer> freq = new HashMap<>();
-        ArrayList<Integer> c = new ArrayList<>();
+
-        ArrayList<Integer> d = new ArrayList<>();
+		for(int i = 0; i < s.length(); i++){
 			freq.put(s.charAt(i), freq.getOrDefault(s.charAt(i), 0) + 1);
-		for(int i = 0;i < n; i++){
+
-			a.add(sc.nextInt());
+
         Set<MyPair> st = new TreeSet<>(new Comparator<MyPair>() {
 			@Override
-        for(int i = 0;i < m; i++){
+			public int compare(MyPair a, MyPair b) {
-			b.add(sc.nextInt());
+				if(a.frequency == b.frequency)
 					return a.ch - b.ch;
 				return a.frequency - b.frequency;
-        for(int i = 0;i < p; i++){
+			}
-			c.add(sc.nextInt());
+		});
 
         for(Map.Entry<Character, Integer> x : freq.entrySet()){
-        for(int i = 0;i < q; i++){
+			st.add(new MyPair(x.getKey(), x.getValue()) );
-			d.add(sc.nextInt());
+		}
 
-		System.out.println(countQuadruplets(a, b, c, d, target));
+        int distinct = freq.size(), changes = 0;
 
         for(MyPair x : st){
-    public static int countQuadruplets(ArrayList<Integer> a, ArrayList<Integer> b, ArrayList<Integer> c, ArrayList<Integer> d, int target) {
+            if(distinct <= k)
-        HashMap<Integer, Integer> map = new HashMap<>();
+                break;
-
+
-        for (int i : a) {
+			changes += x.frequency;
-            for (int j : b) {
+            distinct--;
-                if (map.containsKey(i + j)) {
+
-                    map.put(i + j, map.get(i + j) + 1);
+
-                } else
+        return changes;
-                    map.put(i + j, 1);
+
-            }
+
-        }
+
-
+
-        int count = 0;
+class MyPair{
-
+	public char ch;
-        for (int i : c) {
+    public int frequency;
-            for (int j : d) {
+
-                if (map.containsKey(target - i - j)) {
+	public MyPair(char ch, int frequency){
-                    count += map.get(target - i - j);
+		this.ch = ch;
-                }
+		this.frequency = frequency;
-            }
+	}
-        }
+
-
+