diff --git a/LinkedListPackage/polynomial_addition_using_linked_list.java b/LinkedListPackage/polynomial_addition_using_linked_list.java
new file mode 100644
index 0000000..e6f1d39
--- /dev/null
+++ b/LinkedListPackage/polynomial_addition_using_linked_list.java
@@ -0,0 +1,131 @@
+import java.io.*;
+import java.util.Scanner;
+
+class Polynomial {
+	public static Node addPolynomial(Node p1, Node p2)
+	{
+
+		Node a = p1, b = p2, newHead = new Node(0, 0),
+			c = newHead;
+
+		while (a != null || b != null) {
+
+			if (a == null) {
+				c.next = b;
+				break;
+			}
+			else if (b == null) {
+				c.next = a;
+				break;
+			}
+
+			else if (a.pow == b.pow) {
+				c.next = new Node(a.coeff + b.coeff, a.pow);
+
+				a = a.next;
+				b = b.next;
+			}
+
+			else if (a.pow > b.pow) {
+				c.next = new Node(a.coeff, a.pow);
+
+				a = a.next;
+			}
+
+			else if (a.pow < b.pow) {
+				c.next = new Node(b.coeff, b.pow);
+
+				b = b.next;
+			}
+
+			c = c.next;
+		}
+
+		return newHead.next;
+	}
+}
+
+// Utilities for Linked List Nodes
+class Node {
+	int coeff;
+	int pow;
+	Node next;
+	Node(int a, int b)
+	{
+		coeff = a;
+		pow = b;
+		next = null;
+	}
+}
+
+//Linked List main class
+class LinkedList {
+
+	public static void main(String args[])
+	{
+
+		Node start1 = null, cur1 = null, start2 = null,
+			cur2 = null;
+
+		int[] list1_coeff = { 5, 4, 2 };
+		int[] list1_pow = { 2, 1, 0 };
+		int n = list1_coeff.length;
+
+		int i = 0;
+		while (n-- > 0) {
+			int a = list1_coeff[i];
+			int b = list1_pow[i];
+
+			Node ptr = new Node(a, b);
+
+			if (start1 == null) {
+				start1 = ptr;
+				cur1 = ptr;
+			}
+
+			else {
+				cur1.next = ptr;
+				cur1 = ptr;
+			}
+
+			i++;
+		}
+
+		int[] list2_coeff = { -5, -5 };
+		int[] list2_pow = { 1, 0 };
+		n = list2_coeff.length;
+
+		i = 0;
+		while (n-- > 0) {
+			int a = list2_coeff[i];
+			int b = list2_pow[i];
+
+			Node ptr = new Node(a, b);
+
+			if (start2 == null) {
+				start2 = ptr;
+				cur2 = ptr;
+			}
+
+			else {
+				cur2.next = ptr;
+				cur2 = ptr;
+			}
+
+			i++;
+		}
+
+		Polynomial obj = new Polynomial();
+
+		Node sum = obj.addPolynomial(start1, start2);
+
+		Node trav = sum;
+		while (trav != null) {
+			System.out.print(trav.coeff + "x^" + trav.pow);
+			if (trav.next != null)
+				System.out.print(" + ");
+			trav = trav.next;
+		}
+		System.out.println();
+	}
+}
diff --git a/LinkedListPackage/substaction_of_two_num_represented_As_linked_list.java b/LinkedListPackage/substaction_of_two_num_represented_As_linked_list.java
new file mode 100644
index 0000000..6924c6c
--- /dev/null
+++ b/LinkedListPackage/substaction_of_two_num_represented_As_linked_list.java
@@ -0,0 +1,196 @@
+// Java program to subtract smaller valued
+// list from larger valued list and return
+// result as a list.
+import java.util.*;
+import java.lang.*;
+import java.io.*;
+
+class LinkedList {
+	static Node head; // head of list
+	boolean borrow;
+
+	/* Node Class */
+	static class Node {
+		int data;
+		Node next;
+
+		// Constructor to create a new node
+		Node(int d)
+		{
+			data = d;
+			next = null;
+		}
+	}
+
+	/* A utility function to get length of
+	linked list */
+	int getLength(Node node)
+	{
+		int size = 0;
+		while (node != null) {
+			node = node.next;
+			size++;
+		}
+		return size;
+	}
+
+	/* A Utility that padds zeros in front
+	of the Node, with the given diff */
+	Node paddZeros(Node sNode, int diff)
+	{
+		if (sNode == null)
+			return null;
+
+		Node zHead = new Node(0);
+		diff--;
+		Node temp = zHead;
+		while ((diff--) != 0) {
+			temp.next = new Node(0);
+			temp = temp.next;
+		}
+		temp.next = sNode;
+		return zHead;
+	}
+
+	/* Subtract LinkedList Helper is a recursive
+	function, move till the last Node, and
+	subtract the digits and create the Node and
+	return the Node. If d1 < d2, we borrow the
+	number from previous digit. */
+	Node subtractLinkedListHelper(Node l1, Node l2)
+	{
+		if (l1 == null && l2 == null && borrow == false)
+			return null;
+
+		Node previous
+			= subtractLinkedListHelper(
+				(l1 != null) ? l1.next
+							: null,
+				(l2 != null) ? l2.next : null);
+
+		int d1 = l1.data;
+		int d2 = l2.data;
+		int sub = 0;
+
+		/* if you have given the value to
+		next digit then reduce the d1 by 1 */
+		if (borrow) {
+			d1--;
+			borrow = false;
+		}
+
+		/* If d1 < d2, then borrow the number from
+		previous digit. Add 10 to d1 and set
+		borrow = true; */
+		if (d1 < d2) {
+			borrow = true;
+			d1 = d1 + 10;
+		}
+
+		/* subtract the digits */
+		sub = d1 - d2;
+
+		/* Create a Node with sub value */
+		Node current = new Node(sub);
+
+		/* Set the Next pointer as Previous */
+		current.next = previous;
+
+		return current;
+	}
+
+	/* This API subtracts two linked lists and
+	returns the linked list which shall have the
+	subtracted result. */
+	Node subtractLinkedList(Node l1, Node l2)
+	{
+		// Base Case.
+		if (l1 == null && l2 == null)
+			return null;
+
+		// In either of the case, get the lengths
+		// of both Linked list.
+		int len1 = getLength(l1);
+		int len2 = getLength(l2);
+
+		Node lNode = null, sNode = null;
+
+		Node temp1 = l1;
+		Node temp2 = l2;
+
+		// If lengths differ, calculate the smaller
+		// Node and padd zeros for smaller Node and
+		// ensure both larger Node and smaller Node
+		// has equal length.
+		if (len1 != len2) {
+			lNode = len1 > len2 ? l1 : l2;
+			sNode = len1 > len2 ? l2 : l1;
+			sNode = paddZeros(sNode, Math.abs(len1 - len2));
+		}
+
+		else {
+			// If both list lengths are equal, then
+			// calculate the larger and smaller list.
+			// If 5-6-7 & 5-6-8 are linked list, then
+			// walk through linked list at last Node
+			// as 7 < 8, larger Node is 5-6-8 and
+			// smaller Node is 5-6-7.
+			while (l1 != null && l2 != null) {
+				if (l1.data != l2.data) {
+					lNode = l1.data > l2.data ? temp1 : temp2;
+					sNode = l1.data > l2.data ? temp2 : temp1;
+					break;
+				}
+				l1 = l1.next;
+				l2 = l2.next;
+			}
+		}
+
+		// After calculating larger and smaller Node,
+		// call subtractLinkedListHelper which returns
+		// the subtracted linked list.
+		borrow = false;
+		return subtractLinkedListHelper(lNode, sNode);
+	}
+
+	// function to display the linked list
+	static void printList(Node head)
+	{
+		Node temp = head;
+		while (temp != null) {
+			System.out.print(temp.data + " ");
+			temp = temp.next;
+		}
+	}
+
+	// Driver program to test above
+	public static void main(String[] args)
+	{
+		Node head = new Node(1);
+		head.next = new Node(0);
+		head.next.next = new Node(0);
+
+		Node head2 = new Node(1);
+
+		LinkedList ob = new LinkedList();
+		Node result = ob.subtractLinkedList(head, head2);
+
+		printList(result);
+	}
+}
+
+/*
+
+Input: l1 = 1 -> 0 -> 0 -> NULL,  l2 = 1 -> NULL
+Output: 0->9->9->NULL
+Explanation: Number represented as 
+lists are 100 and 1, so 100 - 1 is 099
+
+Input: l1 = 7-> 8 -> 6 -> NULL,  l2 = 7 -> 8 -> 9 NULL
+Output: 3->NULL
+Explanation: Number represented as 
+lists are 786 and  789, so 789 - 786 is 3, 
+as the smaller value is subtracted from 
+the larger one.
+
+*/