Add solution #2095

Author: JoshCrozier

README.md

@@ -237,6 +237,7 @@
 2011|[Final Value of Variable After Performing Operations](./2011-final-value-of-variable-after-performing-operations.js)|Easy|
 2016|[Maximum Difference Between Increasing Elements](./2016-maximum-difference-between-increasing-elements.js)|Easy|
 2047|[Number of Valid Words in a Sentence](./2047-number-of-valid-words-in-a-sentence.js)|Easy|
+2095|[Delete the Middle Node of a Linked List](./2095-delete-the-middle-node-of-a-linked-list.js)|Medium|
 2114|[Maximum Number of Words Found in Sentences](./2114-maximum-number-of-words-found-in-sentences.js)|Easy|
 
 ## License

solutions/2095-delete-the-middle-node-of-a-linked-list.js

@@ -0,0 +1,42 @@
+/**
+ * 2095. Delete the Middle Node of a Linked List
+ * https://leetcode.com/problems/delete-the-middle-node-of-a-linked-list/
+ * Difficulty: Medium
+ *
+ * You are given the head of a linked list. Delete the middle node, and return the head
+ * of the modified linked list.
+ *
+ * The middle node of a linked list of size n is the ⌊n / 2⌋th node from the start using
+ * 0-based indexing, where ⌊x⌋ denotes the largest integer less than or equal to x.
+ *
+ * For n = 1, 2, 3, 4, and 5, the middle nodes are 0, 1, 1, 2, and 2, respectively.
+ */
+
+/**
+ * Definition for singly-linked list.
+ * function ListNode(val, next) {
+ *     this.val = (val===undefined ? 0 : val)
+ *     this.next = (next===undefined ? null : next)
+ * }
+ */
+/**
+ * @param {ListNode} head
+ * @return {ListNode}
+ */
+var deleteMiddle = function(head) {
+  let slow = new ListNode(0, head);
+  let fast = head;
+
+  if (!head.next) {
+    return null;
+  }
+
+  while (fast && fast.next) {
+    slow = slow.next;
+    fast = fast.next.next;
+  }
+
+  slow.next = slow.next.next;
+
+  return head;
+};