Add files via upload

Author: jainx24

LinkedList/GetNodeValule.java

@@ -0,0 +1,36 @@
+/*
+Get Node Value
+
+You’re given the pointer to the head node of a linked list and a specific position. 
+Counting backwards from the tail node of the linked list, get the value of the node at the given position. 
+A position of 0 corresponds to the tail, 1 corresponds to the node before the tail and so on.
+
+Get Nth element from the end in a linked list of integers
+Number of elements in the list will always be greater than N.
+Node is defined as 
+
+  class Node {
+     int data;
+     Node next;
+  }
+
+*/
+    
+int GetNode(Node head,int n) {
+     // This is a "method-only" submission. 
+     // You only need to complete this method. 
+
+    Node prev=head,ahead=head;
+    
+    for(int i=1;i<=n;i++)
+        ahead=ahead.next;
+    
+    while(ahead.next!=null)
+    {
+        prev=prev.next;
+        ahead=ahead.next;
+    }
+    
+    return prev.data;
+
+}

LinkedList/MergeTwoSortedlinkedLists.java

@@ -0,0 +1,87 @@
+/*
+Merge two sorted linked lists
+
+You’re given the pointer to the head nodes of two sorted linked lists. 
+The data in both lists will be sorted in ascending order. 
+Change the next pointers to obtain a single, merged linked list which also has data in ascending order. 
+Either head pointer given may be null meaning that the corresponding list is empty.
+
+  Merge two linked lists 
+  head pointer input could be NULL as well for empty list
+  Node is defined as 
+  class Node {
+     int data;
+     Node next;
+  }
+*/
+
+Node mergeLists(Node headA, Node headB) {
+     // This is a "method-only" submission. 
+     // You only need to complete this method 
+    Node head = null;
+    Node temp = null;
+    
+    
+    if(headA==null)
+        return headB;
+    if(headB==null)
+        return headA;
+    
+    while(headA!=null && headB!=null)
+    {
+        if(headA.data<headB.data)
+        {
+            if(head==null)
+            {
+                head=headA;
+                headA=headA.next;
+                head.next=null;
+                temp=head;
+            }
+            else
+            {
+                temp.next=headA;
+                headA=headA.next;
+                temp=temp.next;
+                temp.next=null;
+            }
+        }
+        
+        else
+        {
+            if(head==null)
+            {
+                head=headB;
+                headB=headB.next;
+                head.next=null;
+                temp=head;
+            }
+            else
+            {
+                temp.next=headB;
+                headB=headB.next;
+                temp=temp.next;
+                temp.next=null;
+            }
+        }
+    }
+    
+    while(headA!=null)
+    {
+        temp.next=headA;
+        headA=headA.next;
+        temp=temp.next;
+        temp.next=null;
+    }
+    
+    while(headB!=null)
+    {
+        temp.next=headB;
+        headB=headB.next;
+        temp=temp.next;
+        temp.next=null;
+    }
+    
+    return head;
+
+}