utkarsh006 / LeetCode-Grind

This Repo is a one way solution to ace your Technical Interviews and crack your dream Job by upsolving LeetCode standard problems.
MIT License
50 stars 26 forks source link

15-October LeetCode Daily Challenge #260

Closed Dharansh-Neema closed 2 years ago

Dharansh-Neema commented 2 years ago

Description

Delete the Middle Node of a Linked List

You are given the head of a linked list. Delete the middle node, and return the head of the modified linked list. Example :

Input: head = [1,2,3,4] Output: [1,2,4] Explanation: The figure represents the given linked list. For n = 4, node 2 with value 3 is the middle node, which is marked in red.

image

Code of Conduct