IsPalindrome done

Author: Ram swaroop

src/me/ramswaroop/linkedlists/DeleteNode.java

@@ -20,9 +20,9 @@ public void deleteNode(SingleLinkedNode<E> node) {
 
     public static void main(String a[]) {
         DeleteNode<Integer> linkedList = new DeleteNode<>();
-        linkedList.add(34);
-        linkedList.add(64);
-        linkedList.add(43);
+        linkedList.add(00);
+        linkedList.add(11);
+        linkedList.add(22);
         linkedList.printList();
         linkedList.deleteNode(linkedList.getNode(1));
         linkedList.printList();

src/me/ramswaroop/linkedlists/DetectLoop.java

@@ -66,6 +66,7 @@ public boolean isLoopPresentUsingHashMap(SingleLinkedNode<E> node) {
 
     public static void main(String a[]) {
         DetectLoop<Integer> linkedList = new DetectLoop<>();
+        linkedList.add(00);
         linkedList.add(11);
         linkedList.add(22);
         linkedList.add(33);

src/me/ramswaroop/linkedlists/IsPalindrome.java

@@ -0,0 +1,47 @@
+package me.ramswaroop.linkedlists;
+
+import me.ramswaroop.common.SingleLinkedList;
+import me.ramswaroop.common.SingleLinkedNode;
+
+/**
+ * Created by IntelliJ IDEA.
+ *
+ * @author: ramswaroop
+ * @date: 6/18/15
+ * @time: 2:35 PM
+ */
+public class IsPalindrome<E> extends SingleLinkedList<E> {
+
+    /**
+     * Recursive function to test whether a linked list
+     * is palindrome or not.
+     * <p/>
+     * NOTE: This method moves the head reference. (disadvantage)
+     *
+     * @param node
+     * @return
+     */
+    public boolean isPalindrome(SingleLinkedNode<E> node) {
+        if (node == null) return true;
+
+        boolean isPalindrome = isPalindrome(node.next);
+
+        if (head.item == node.item) {
+            head = head.next;
+            return isPalindrome;
+        } else {
+            return false;
+        }
+    }
+
+    public static void main(String a[]) {
+        IsPalindrome<Integer> linkedList = new IsPalindrome<>();
+        linkedList.add(00);
+        linkedList.add(11);
+        linkedList.add(22);
+        linkedList.add(11);
+        linkedList.add(00);
+        linkedList.printList();
+        System.out.println(linkedList.isPalindrome(linkedList.getNode(0)));
+    }
+}

src/me/ramswaroop/linkedlists/MiddleNode.java

@@ -24,6 +24,7 @@ public SingleLinkedNode<E> getMiddleNode(SingleLinkedNode<E> node) {
 
     public static void main(String a[]) {
         MiddleNode<Integer> linkedList = new MiddleNode<>();
+        linkedList.add(00);
         linkedList.add(11);
         linkedList.add(22);
         linkedList.add(33);

src/me/ramswaroop/linkedlists/NthNodeFromLast.java

@@ -29,6 +29,7 @@ public SingleLinkedNode<E> getNthNodeFromLast(SingleLinkedNode<E> node, int n) {
 
     public static void main(String a[]) {
         NthNodeFromLast<Integer> linkedList = new NthNodeFromLast<>();
+        linkedList.add(00);
         linkedList.add(11);
         linkedList.add(22);
         linkedList.add(33);