Some minor refactorings

Author: rampatra

src/main/java/com/ctci/linkedlists/DeleteMiddleNode.java

@@ -1,8 +1,67 @@
 package com.ctci.linkedlists;
 
+import static com.ctci.linkedlists.Node.printList;
+
 /**
  * @author rampatra
  * @since 2019-01-27
  */
 public class DeleteMiddleNode {
+
+    /**
+     * Implement an algorithm to delete a node in the middle (i.e., any node but the first and last node, not
+     * necessarily the exact middle) of a singly linked list, given only access to that node.
+     * <p>
+     * EXAMPLE
+     * Input: the node c from the linked list a->b->c->d->e->f
+     * Result: nothing is returned, but the new linked list looks like a->b->d->e->f
+     *
+     * @param middle the node to be deleted
+     */
+    private static void deleteMiddleNode(Node middle) {
+        if (middle == null || middle.next == null) {
+            return;
+        }
+        // copy the data from the next node over to the middle node, and then to delete the next node
+        Node next = middle.next;
+        middle.val = next.val;
+        middle.next = next.next;
+    }
+
+    public static void main(String[] args) {
+        Node l1 = new Node(1);
+        l1.next = new Node(2);
+        l1.next.next = new Node(3);
+        l1.next.next.next = new Node(4);
+        l1.next.next.next.next = new Node(5);
+        l1.next.next.next.next.next = new Node(6);
+        printList(l1);
+        deleteMiddleNode(l1.next.next);
+        printList(l1);
+
+        System.out.println("----");
+
+        l1 = new Node(1);
+        l1.next = new Node(2);
+        l1.next.next = new Node(3);
+        printList(l1);
+        deleteMiddleNode(l1.next);
+        printList(l1);
+
+        System.out.println("----");
+
+        l1 = new Node(1);
+        l1.next = new Node(3);
+        printList(l1);
+        deleteMiddleNode(l1);
+        printList(l1);
+
+        System.out.println("----");
+
+        l1 = new Node(1);
+        l1.next = new Node(3);
+        printList(l1);
+        deleteMiddleNode(l1.next);
+        printList(l1);
+    }
 }

src/main/java/com/hackerrank/algorithms/strings/AlternatingCharacters.java

@@ -5,8 +5,8 @@
 /**
  * Created by IntelliJ IDEA.
  *
- * @author: ramswaroop
- * @date: 10/22/15
+ * @author rampatra
+ * @since 10/22/15
  * @time: 9:24 AM
  */
 public class AlternatingCharacters {

src/main/java/com/hackerrank/algorithms/strings/Pangram.java

@@ -5,8 +5,8 @@
 /**
  * Created by IntelliJ IDEA.
  *
- * @author: ramswaroop
- * @date: 10/22/15
+ * @author rampatra
+ * @since 10/22/15
  * @time: 8:47 AM
  */
 public class Pangram {

src/main/java/com/hackerrank/algorithms/strings/TwoStrings.java

@@ -5,8 +5,8 @@
 /**
  * Created by IntelliJ IDEA.
  *
- * @author: ramswaroop
- * @date: 10/22/15
+ * @author rampatra
+ * @since 10/22/15
  * @time: 10:08 AM
  */
 public class TwoStrings {

src/main/java/com/hackerrank/bitmanipulation/CounterGame.java

@@ -6,8 +6,8 @@
 /**
  * Created by IntelliJ IDEA.
  *
- * @author: ramswaroop
- * @date: 6/24/15
+ * @author rampatra
+ * @since 6/24/15
  * @time: 12:03 PM
  */
 public class CounterGame {

src/main/java/com/hackerrank/bitmanipulation/Solution.java

@@ -7,8 +7,8 @@
 /**
  * Created by IntelliJ IDEA.
  *
- * @author: ramswaroop
- * @date: 6/24/15
+ * @author rampatra
+ * @since 6/24/15
  * @time: 10:25 PM
  */
 public class Solution {

src/main/java/com/hackerrank/bitmanipulation/TwosCompliment.java

@@ -5,8 +5,8 @@
 /**
  * Created by IntelliJ IDEA.
  *
- * @author: ramswaroop
- * @date: 6/24/15
+ * @author rampatra
+ * @since 6/24/15
  * @time: 10:25 PM
  */
 public class TwosCompliment {

src/main/java/com/hackerrank/java/oops/JavaInheritance.java

@@ -3,8 +3,8 @@
 /**
  * Created by IntelliJ IDEA.
  *
- * @author: ramswaroop
- * @date: 7/19/15
+ * @author rampatra
+ * @since 7/19/15
  * @time: 3:36 PM
  */
 public class JavaInheritance {

src/main/java/com/hackerrank/projecteuler/MultiplesOf3and5.java

@@ -5,8 +5,8 @@
 /**
  * Created by IntelliJ IDEA.
  *
- * @author: ramswaroop
- * @date: 1/1/16
+ * @author rampatra
+ * @since 1/1/16
  * @time: 8:48 AM
  */
 public class MultiplesOf3and5 {

src/main/java/com/rampatra/arrays/ArrangeNosToFormBiggestNo.java

@@ -6,8 +6,8 @@
 /**
  * Created by IntelliJ IDEA.
  *
- * @author: ramswaroop
- * @date: 11/1/15
+ * @author rampatra
+ * @since 11/1/15
  * @time: 8:53 PM
  */
 public class ArrangeNosToFormBiggestNo {

src/main/java/com/rampatra/arrays/BooleanMatrix.java

@@ -3,8 +3,8 @@
 /**
  * Created by IntelliJ IDEA.
  *
- * @author: ramswaroop
- * @date: 9/11/15
+ * @author rampatra
+ * @since 9/11/15
  * @time: 3:28 PM
  * @see: http://www.geeksforgeeks.org/a-boolean-matrix-question/
  */

src/main/java/com/rampatra/arrays/CelebrityProblem.java

@@ -6,8 +6,8 @@
 /**
  * Created by IntelliJ IDEA.
  *
- * @author: ramswaroop
- * @date: 10/2/15
+ * @author rampatra
+ * @since 10/2/15
  * @time: 10:48 PM
  * <p/>
  * In a party of N people, only one person is known to everyone. Such a person may be present in the party, if yes,

src/main/java/com/rampatra/arrays/ConsecutiveElements.java

@@ -3,8 +3,8 @@
 /**
  * Created by IntelliJ IDEA.
  *
- * @author: ramswaroop
- * @date: 8/28/15
+ * @author rampatra
+ * @since 8/28/15
  * @time: 10:32 AM
  */
 public class ConsecutiveElements {

src/main/java/com/rampatra/arrays/CountSmallerElementsOnRHS.java

@@ -5,8 +5,8 @@
 /**
  * Created by IntelliJ IDEA.
  *
- * @author: ramswaroop
- * @date: 9/19/15
+ * @author rampatra
+ * @since 9/19/15
  * @time: 11:33 PM
  */
 public class CountSmallerElementsOnRHS {

src/main/java/com/rampatra/arrays/DuplicatesInArray.java

@@ -5,8 +5,8 @@
 /**
  * Created by IntelliJ IDEA.
  *
- * @author: ramswaroop
- * @date: 8/21/15
+ * @author rampatra
+ * @since 8/21/15
  * @time: 9:41 AM
  */
 public class DuplicatesInArray {

src/main/java/com/rampatra/arrays/DuplicatesInArrayWithinKDistance.java

@@ -6,8 +6,8 @@
 /**
  * Created by IntelliJ IDEA.
  *
- * @author: ramswaroop
- * @date: 10/18/15
+ * @author rampatra
+ * @since 10/18/15
  * @time: 8:40 PM
  */
 public class DuplicatesInArrayWithinKDistance {

src/main/java/com/rampatra/arrays/EqualProbabilityRandomNoGenerator.java

@@ -9,8 +9,8 @@
  * which uses f(n) to generate non repeating random numbers from
  * {@code 0} (inclusive) to {@code n} (exclusive)?
  *
- * @author: ramswaroop
- * @date: 8/13/15
+ * @author rampatra
+ * @since 8/13/15
  * @time: 1:41 PM
  */
 public class EqualProbabilityRandomNoGenerator {

src/main/java/com/rampatra/arrays/EquilibriumIndex.java

@@ -3,8 +3,8 @@
 /**
  * Created by IntelliJ IDEA.
  *
- * @author: ramswaroop
- * @date: 8/22/15
+ * @author rampatra
+ * @since 8/22/15
  * @time: 11:56 AM
  */
 public class EquilibriumIndex {

src/main/java/com/rampatra/arrays/FixedPoint.java

@@ -3,8 +3,8 @@
 /**
  * Created by IntelliJ IDEA.
  *
- * @author: ramswaroop
- * @date: 9/8/15
+ * @author rampatra
+ * @since 9/8/15
  * @time: 11:34 PM
  */
 public class FixedPoint {

src/main/java/com/rampatra/arrays/IntersectionAndUnionOf2SortedArrays.java

@@ -5,8 +5,8 @@
 /**
  * Created by IntelliJ IDEA.
  *
- * @author: ramswaroop
- * @date: 8/13/15
+ * @author rampatra
+ * @since 8/13/15
  * @time: 3:56 PM
  */
 public class IntersectionAndUnionOf2SortedArrays {

src/main/java/com/rampatra/arrays/InversionsInArray.java

@@ -5,8 +5,8 @@
 /**
  * Created by IntelliJ IDEA.
  *
- * @author: ramswaroop
- * @date: 7/29/15
+ * @author rampatra
+ * @since 7/29/15
  * @time: 8:37 PM
  */
 public class InversionsInArray {

src/main/java/com/rampatra/arrays/KLargestElements.java

@@ -7,8 +7,8 @@
 /**
  * Created by IntelliJ IDEA.
  *
- * @author: ramswaroop
- * @date: 8/3/15
+ * @author rampatra
+ * @since 8/3/15
  * @time: 3:47 PM
  */
 public class KLargestElements {

src/main/java/com/rampatra/arrays/KthLargestElement.java

@@ -8,8 +8,8 @@
 /**
  * Created by IntelliJ IDEA.
  *
- * @author: ramswaroop
- * @date: 8/1/15
+ * @author rampatra
+ * @since 8/1/15
  * @time: 11:26 PM
  */
 public class KthLargestElement {

src/main/java/com/rampatra/arrays/LargestProductContiguousSubArray.java

@@ -3,8 +3,8 @@
 /**
  * Created by IntelliJ IDEA.
  *
- * @author: ramswaroop
- * @date: 5/28/15
+ * @author rampatra
+ * @since 5/28/15
  * @time: 12:44 PM
  */
 public class LargestProductContiguousSubArray {

src/main/java/com/rampatra/arrays/LargestSumContiguousSubArray.java

@@ -3,8 +3,8 @@
 /**
  * Created by IntelliJ IDEA.
  *
- * @author: ramswaroop
- * @date: 5/28/15
+ * @author rampatra
+ * @since 5/28/15
  * @time: 12:44 PM
  */
 public class LargestSumContiguousSubArray {

src/main/java/com/rampatra/arrays/LeadersInArray.java

@@ -5,8 +5,8 @@
 /**
  * Created by IntelliJ IDEA.
  *
- * @author: ramswaroop
- * @date: 7/29/15
+ * @author rampatra
+ * @since 7/29/15
  * @time: 12:06 PM
  */
 public class LeadersInArray {

src/main/java/com/rampatra/arrays/LongestBitonicSubArray.java

@@ -3,8 +3,8 @@
 /**
  * Created by IntelliJ IDEA.
  *
- * @author: ramswaroop
- * @date: 9/18/15
+ * @author rampatra
+ * @since 9/18/15
  * @time: 5:10 PM
  */
 public class LongestBitonicSubArray {

src/main/java/com/rampatra/arrays/MajorityElement.java

@@ -3,8 +3,8 @@
 /**
  * Created by IntelliJ IDEA.
  *
- * @author: ramswaroop
- * @date: 5/20/15
+ * @author rampatra
+ * @since 5/20/15
  * @time: 2:36 PM
  */
 

src/main/java/com/rampatra/arrays/MajorityElementInSortedArray.java

@@ -3,8 +3,8 @@
 /**
  * Created by IntelliJ IDEA.
  *
- * @author: ramswaroop
- * @date: 7/31/15
+ * @author rampatra
+ * @since 7/31/15
  * @time: 10:02 AM
  */
 public class MajorityElementInSortedArray {

src/main/java/com/rampatra/arrays/MatrixInSpiral.java

@@ -5,8 +5,8 @@
 /**
  * Created by IntelliJ IDEA.
  *
- * @author: ramswaroop
- * @date: 9/9/15
+ * @author rampatra
+ * @since 9/9/15
  * @time: 2:55 PM
  */
 public class MatrixInSpiral {

src/main/java/com/rampatra/arrays/MaxDiffWithLargerElementAfterSmallerElement.java

@@ -3,8 +3,8 @@
 /**
  * Created by IntelliJ IDEA.
  *
- * @author: ramswaroop
- * @date: 8/12/15
+ * @author rampatra
+ * @since 8/12/15
  * @time: 5:40 PM
  */
 public class MaxDiffWithLargerElementAfterSmallerElement {