From 083659ef17be838e11e50d0c66e65b20f064dd3e Mon Sep 17 00:00:00 2001 From: Prerna Gupta <91413644+prernagupta2625@users.noreply.github.com> Date: Wed, 29 Mar 2023 17:57:12 +0530 Subject: [PATCH] Create README - LeetHub --- Delete Middle of Linked List - GFG/README.md | 29 ++++++++++++++++++++ 1 file changed, 29 insertions(+) create mode 100644 Delete Middle of Linked List - GFG/README.md diff --git a/Delete Middle of Linked List - GFG/README.md b/Delete Middle of Linked List - GFG/README.md new file mode 100644 index 0000000..cffc480 --- /dev/null +++ b/Delete Middle of Linked List - GFG/README.md @@ -0,0 +1,29 @@ +# Delete Middle of Linked List +## Easy +

Given a singly linked list, delete middle of the linked list. For example, if given linked list is 1->2->3->4->5 then linked list should be modified to 1->2->4->5.
+If there are even nodes, then there would be two middle nodes, we need to delete the second middle element. For example, if given linked list is 1->2->3->4->5->6 then it should be modified to 1->2->3->5->6.
+If the input linked list is NULL or has 1 node, then it should return NULL

+ +

Example 1:

+ +
Input:
+LinkedList: 1->2->3->4->5
+Output: 1 2 4 5
+
+ +

Example 2:

+ +
Input:
+LinkedList: 2->4->6->7->5->1
+Output: 2 4 6 5 1
+ +

Your Task:
+The task is to complete the function deleteMid() which should delete the middle element from the linked list and return the head of the modified linked list. If the linked list is empty then it should return NULL.

+ +

Expected Time Complexity: O(N).
+Expected Auxiliary Space: O(1).

+ +

Constraints:
+1 <= N <= 1000
+1 <= value <= 1000

+
\ No newline at end of file