diff --git a/Miscellaneous/POLY_MUL.java b/Miscellaneous/POLY_MUL.java
new file mode 100644
index 0000000..3739c4a
--- /dev/null
+++ b/Miscellaneous/POLY_MUL.java
@@ -0,0 +1,157 @@
+// Multiplication of Two polynomial using Linked List
+
+import java.util.*; 
+class POLY_MUL
+{ 
+  
+// Node structure containing powerer  
+// and coefficient of variable  
+static class Node {  
+    int coeff, power;  
+    Node next;  
+};  
+  
+// Function add a new node at the end of list  
+static Node addnode(Node start, int coeff, int power)  
+{  
+    // Create a new node  
+    Node newnode = new Node();  
+    newnode.coeff = coeff;  
+    newnode.power = power;  
+    newnode.next = null;  
+  
+    // If linked list is empty  
+    if (start == null)  
+        return newnode;  
+  
+    // If linked list has nodes  
+    Node ptr = start;  
+    while (ptr.next != null)  
+        ptr = ptr.next;  
+    ptr.next = newnode;  
+  
+    return start;  
+}  
+  
+// Functionn To Display The Linked list  
+static void printList( Node ptr)  
+{  
+    while (ptr.next != null) {  
+        System.out.print( ptr.coeff + "x^" + ptr.power + " + ");  
+  
+        ptr = ptr.next;  
+    }  
+    System.out.print( ptr.coeff  +"\n");  
+}  
+  
+// Function to add coefficients of  
+// two elements having same powerer  
+static void removeDuplicates(Node start)  
+{  
+    Node ptr1, ptr2, dup;  
+    ptr1 = start;  
+  
+    /* Pick elements one by one */
+    while (ptr1 != null && ptr1.next != null) {  
+        ptr2 = ptr1;  
+  
+        // Compare the picked element  
+        // with rest of the elements  
+        while (ptr2.next != null) {  
+  
+            // If powerer of two elements are same  
+            if (ptr1.power == ptr2.next.power) {  
+  
+                // Add their coefficients and put it in 1st element  
+                ptr1.coeff = ptr1.coeff + ptr2.next.coeff;  
+                dup = ptr2.next;  
+                ptr2.next = ptr2.next.next;  
+  
+            }  
+            else
+                ptr2 = ptr2.next;  
+        }  
+        ptr1 = ptr1.next;  
+    }  
+}  
+  
+// Function two Multiply two polynomial Numbers  
+static Node multiply(Node poly1, Node poly2,  
+            Node poly3)  
+{  
+  
+    // Create two pointer and store the  
+    // address of 1st and 2nd polynomials  
+    Node ptr1, ptr2;  
+    ptr1 = poly1;  
+    ptr2 = poly2;  
+    while (ptr1 != null) {  
+        while (ptr2 != null) {  
+            int coeff, power;  
+  
+            // Multiply the coefficient of both  
+            // polynomials and store it in coeff  
+            coeff = ptr1.coeff * ptr2.coeff;  
+  
+            // Add the powerer of both polynomials  
+            // and store it in power  
+            power = ptr1.power + ptr2.power;  
+  
+            // Invoke addnode function to create  
+            // a newnode by passing three parameters  
+            poly3 = addnode(poly3, coeff, power);  
+  
+            // move the pointer of 2nd polynomial  
+            // two get its next term  
+            ptr2 = ptr2.next;  
+        }  
+  
+        // Move the 2nd pointer to the  
+        // starting point of 2nd polynomial  
+        ptr2 = poly2;  
+  
+        // move the pointer of 1st polynomial  
+        ptr1 = ptr1.next;  
+    }  
+  
+    // this function will be invoke to add  
+    // the coefficient of the elements  
+    // having same powerer from the resultant linked list  
+    removeDuplicates(poly3);  
+    return poly3;  
+}  
+  
+// Driver Code  
+public static void main(String args[])  
+{  
+  
+    Node poly1 = null, poly2 = null, poly3 = null;  
+  
+    // Creation of 1st Polynomial: 3x^2 + 5x^1 + 6  
+    poly1 = addnode(poly1, 3, 2);  
+    poly1 = addnode(poly1, 5, 1);  
+    poly1 = addnode(poly1, 6, 0);  
+  
+    // Creation of 2nd polynomial: 6x^1 + 8  
+    poly2 = addnode(poly2, 6, 1);  
+    poly2 = addnode(poly2, 8, 0);  
+  
+    // Displaying 1st polynomial  
+    System.out.print("--------------1st Polynomial:------------------------ ");  
+    printList(poly1);  
+  
+    // Displaying 2nd polynomial  
+    System.out.print("--------------2nd Polynomial:------------------------ ");  
+    printList(poly2);  
+  
+    // calling multiply function  
+    poly3 = multiply(poly1, poly2, poly3);  
+  
+    // Displaying Resultant Polynomial  
+    System.out.print( "-------------------Resultant Polynomial:- -------------");  
+    printList(poly3);  
+  
+}  
+  
+  
+} 
diff --git a/Miscellaneous/Solve.java b/Miscellaneous/Solve.java
new file mode 100644
index 0000000..e28c2de
--- /dev/null
+++ b/Miscellaneous/Solve.java
@@ -0,0 +1,25 @@
+// Solving problem Of tower of hanoi using Recursive Func.
+  
+class Solve
+{ 
+   
+    static void towerOfHanoi(int n, char from_rod, char to_rod, char aux_rod) 
+    { 
+        if (n == 1) 
+        { 
+            System.out.println("Move disk 1 from rod " +  from_rod + " to rod " + to_rod); 
+            return; 
+        } 
+        towerOfHanoi(n-1, from_rod, aux_rod, to_rod); 
+        System.out.println("Move disk " + n + " from rod " +  from_rod + " to rod " + to_rod); 
+        towerOfHanoi(n-1, aux_rod, to_rod, from_rod); 
+    } 
+      
+    //  Driver method 
+    public static void main(String args[]) 
+    { 
+        int n = 4; // Number of disks 
+        towerOfHanoi(n, 'A', 'C', 'B');  /*A, B and 
+                                                           C are names of rods */
+    } 
+} 
\ No newline at end of file
diff --git a/Multi of 2 polynomial.txt b/Multi of 2 polynomial.txt
new file mode 100644
index 0000000..47952a1
--- /dev/null
+++ b/Multi of 2 polynomial.txt	
@@ -0,0 +1,157 @@
+// Multiplication of Two polynomial using Linked List
+
+mport java.util.*; 
+class POLY_MUL
+{ 
+  
+// Node structure containing powerer  
+// and coefficient of variable  
+static class Node {  
+    int coeff, power;  
+    Node next;  
+};  
+  
+// Function add a new node at the end of list  
+static Node addnode(Node start, int coeff, int power)  
+{  
+    // Create a new node  
+    Node newnode = new Node();  
+    newnode.coeff = coeff;  
+    newnode.power = power;  
+    newnode.next = null;  
+  
+    // If linked list is empty  
+    if (start == null)  
+        return newnode;  
+  
+    // If linked list has nodes  
+    Node ptr = start;  
+    while (ptr.next != null)  
+        ptr = ptr.next;  
+    ptr.next = newnode;  
+  
+    return start;  
+}  
+  
+// Functionn To Display The Linked list  
+static void printList( Node ptr)  
+{  
+    while (ptr.next != null) {  
+        System.out.print( ptr.coeff + "x^" + ptr.power + " + ");  
+  
+        ptr = ptr.next;  
+    }  
+    System.out.print( ptr.coeff  +"\n");  
+}  
+  
+// Function to add coefficients of  
+// two elements having same powerer  
+static void removeDuplicates(Node start)  
+{  
+    Node ptr1, ptr2, dup;  
+    ptr1 = start;  
+  
+    /* Pick elements one by one */
+    while (ptr1 != null && ptr1.next != null) {  
+        ptr2 = ptr1;  
+  
+        // Compare the picked element  
+        // with rest of the elements  
+        while (ptr2.next != null) {  
+  
+            // If powerer of two elements are same  
+            if (ptr1.power == ptr2.next.power) {  
+  
+                // Add their coefficients and put it in 1st element  
+                ptr1.coeff = ptr1.coeff + ptr2.next.coeff;  
+                dup = ptr2.next;  
+                ptr2.next = ptr2.next.next;  
+  
+            }  
+            else
+                ptr2 = ptr2.next;  
+        }  
+        ptr1 = ptr1.next;  
+    }  
+}  
+  
+// Function two Multiply two polynomial Numbers  
+static Node multiply(Node poly1, Node poly2,  
+            Node poly3)  
+{  
+  
+    // Create two pointer and store the  
+    // address of 1st and 2nd polynomials  
+    Node ptr1, ptr2;  
+    ptr1 = poly1;  
+    ptr2 = poly2;  
+    while (ptr1 != null) {  
+        while (ptr2 != null) {  
+            int coeff, power;  
+  
+            // Multiply the coefficient of both  
+            // polynomials and store it in coeff  
+            coeff = ptr1.coeff * ptr2.coeff;  
+  
+            // Add the powerer of both polynomials  
+            // and store it in power  
+            power = ptr1.power + ptr2.power;  
+  
+            // Invoke addnode function to create  
+            // a newnode by passing three parameters  
+            poly3 = addnode(poly3, coeff, power);  
+  
+            // move the pointer of 2nd polynomial  
+            // two get its next term  
+            ptr2 = ptr2.next;  
+        }  
+  
+        // Move the 2nd pointer to the  
+        // starting point of 2nd polynomial  
+        ptr2 = poly2;  
+  
+        // move the pointer of 1st polynomial  
+        ptr1 = ptr1.next;  
+    }  
+  
+    // this function will be invoke to add  
+    // the coefficient of the elements  
+    // having same powerer from the resultant linked list  
+    removeDuplicates(poly3);  
+    return poly3;  
+}  
+  
+// Driver Code  
+public static void main(String args[])  
+{  
+  
+    Node poly1 = null, poly2 = null, poly3 = null;  
+  
+    // Creation of 1st Polynomial: 3x^2 + 5x^1 + 6  
+    poly1 = addnode(poly1, 3, 2);  
+    poly1 = addnode(poly1, 5, 1);  
+    poly1 = addnode(poly1, 6, 0);  
+  
+    // Creation of 2nd polynomial: 6x^1 + 8  
+    poly2 = addnode(poly2, 6, 1);  
+    poly2 = addnode(poly2, 8, 0);  
+  
+    // Displaying 1st polynomial  
+    System.out.print("--------------1st Polynomial:------------------------ ");  
+    printList(poly1);  
+  
+    // Displaying 2nd polynomial  
+    System.out.print("--------------2nd Polynomial:------------------------ ");  
+    printList(poly2);  
+  
+    // calling multiply function  
+    poly3 = multiply(poly1, poly2, poly3);  
+  
+    // Displaying Resultant Polynomial  
+    System.out.print( "-------------------Resultant Polynomial:- -------------");  
+    printList(poly3);  
+  
+}  
+  
+  
+} 
\ No newline at end of file