Create 876. Middle of the Linked List.md

Author: developer-mohitsoni

Linked List Problem/876. Middle of the Linked List.md

@@ -0,0 +1,61 @@
+## Problem
+
+https://leetcode.com/problems/middle-of-the-linked-list/
+
+## Problem Description
+
+Given the head of a singly linked list, return the middle node of the linked list.
+
+If there are two middle nodes, return the second middle node.
+
+**Example 1:**
+
+**Input:** head = [1,2,3,4,5]  
+
+**Output:** [3,4,5]  
+
+**Explanation:** The middle node of the list is node 3.  
+<br>
+
+**Example 2:**
+
+**Input:** head = [1,2,3,4,5,6]  
+
+**Output:** [4,5,6]  
+
+**Explanation:** Since the list has two middle nodes with values 3 and 4, we return the second one.
+
+
+## Code
+
+- C++ Code:(**"Iterative Approach"**)
+
+```cpp
+class Solution {
+public:
+    ListNode* middleNode(ListNode* head) {
+        
+        int count=0;
+        
+        ListNode *temp = head;
+        
+        while(temp != NULL)
+        {
+            count++;
+            
+            temp = temp->next;
+        }
+        
+        int Middle = count /= 2;
+        
+        temp = head;
+        
+        while(Middle--)
+        {
+            temp = temp->next;
+        }
+        return temp;
+        
+    }
+};
+```