added

Author: deepzsenu

Linked List/LinkedList.class

@@ -0,0 +1,66 @@
+import java.util.*;
+class Node<T>{
+    T data;
+    Node<T> next;
+}
+class LinkedList<T> {
+    Node<T> head;
+    Node<T> tail;
+    int size;
+
+    void add(T value){
+        Node<T> temp = new Node<>();
+        temp.data = value;
+        temp.next = null;
+        if (size == 0){
+            head = tail = temp;
+        }
+
+        else{
+            tail.next = temp;
+            tail = temp;
+        }
+        size++;
+    }
+    int size(){
+        return size;
+    }
+
+    void display(){
+        Node<T> temp = head;
+        while(temp!= null){
+            System.out.print(temp.data+" ");
+            temp = temp.next;
+        }
+    }
+
+    void removeFirst(){
+        if (head == null){
+            System.out.println("List is empty");
+        }
+        else{
+            head = head.next;
+            size--;
+        }
+    }
+
+    <T> Object getAt(Node<T> head){
+        return T;
+    }
+
+
+}
+
+public class Main{
+    public static void main(String[] args) {
+        int arr[] = {1,2,3,4,5,6,7,8,9};
+        LinkedList<Integer> ll = new LinkedList<>();
+        for(int i=0;i<arr.length;i++){
+            ll.add(arr[i]);
+        }
+        ll.display();
+        System.out.println("\n"+ll.size());
+        ll.removeFirst();
+        ll.display();
+    }
+}

Linked List/LinkedList.java

@@ -0,0 +1,75 @@
+/* package codechef; // don't place package name! */
+
+import java.util.*;
+import java.lang.*;
+import java.io.*;
+
+/* Name of the class has to be "Main" only if the class is public. */
+class Codechef
+{   static HashMap<Long, Long> sortByValue(HashMap<Long, Long> hm)
+    {
+        // Create a list from elements of HashMap
+        List<Map.Entry<Long, Long> > list =
+               new LinkedList<Map.Entry<Long, Long> >(hm.entrySet());
+ 
+        // Sort the list
+        Collections.sort(list, new Comparator<Map.Entry<Long, Long> >() {
+            public int compare(Map.Entry<Long, Long> o1,
+                               Map.Entry<Long, Long> o2)
+            {
+                return (o1.getValue()).compareTo(o2.getValue());
+            }
+        });
+         
+        // put data from sorted list to hashmap
+        HashMap<Long, Long> temp = new LinkedHashMap<Long, Long>();
+        for (Map.Entry<Long, Long> aa : list) {
+            temp.put(aa.getKey(), aa.getValue());
+        }
+        return temp;
+    }
+    static long minChec(long arr[] , long arr2[], int n ){
+    HashMap<Long, Long> mp = new HashMap<>();
+    for (int i = 0;i<n ;i++ ){
+        if(mp.containsKey(arr[i])){
+            mp.put(arr[i], mp.get(arr[i])+1);
+        }
+        else{
+            mp.put(arr[i],1);
+        }
+    } 
+    for (int i = 0;i<n ;i++ ){
+        if(mp.containsKey(arr2[i])){
+            mp.put(arr2[i], mp.get(arr2[i])+1);
+        }
+        else{
+            mp.put(arr2[i],1);
+        }
+    } 
+    HashMap<, Long> hm = sortByValue(mp);
+    for(Long i  : hm.keySet()){
+        System.out.print(i+" ");
+    }
+    return 0;
+    
+    }
+	public static void main (String[] args) throws java.lang.Exception
+	{
+		// your code goes here
+		Scanner sc = new Scanner(System.in);
+		int t = sc.nextInt();
+		while(t>0){
+		    int n = sc.nextInt();
+		    long arr[] = new long[n];
+		    long ar2[] = new long[n];
+		    for (int i = 0 ; i <n; i++){
+		        arr[i] = sc.nextLong();
+		    }
+		    for (int i = 0 ; i <n; i++){
+		        ar2[i] = sc.nextLong();
+		    }
+		    System.out.println(minChec(arr, ar2, n));
+		    t--;
+		}
+	}
+}