My-LeetCode-Solvings
C# Code Challenges Solved on LeetCode
Project maintained by F4NT0
Hosted on GitHub Pages — Theme by mattgraham
876. Middle of the Linked List
Level: ![Easy](https://img.shields.io/badge/Easy-lightgreen)
Language: C#
Topic: Linked List
Unit Tests: ![876 - Testing Results](https://github.com/F4NT0/My-LeetCode-Solvings/actions/workflows/876.yml/badge.svg)
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:
![image1](https://assets.leetcode.com/uploads/2021/07/23/lc-midlist1.jpg)
- Input: head = [1,2,3,4,5]
- Output: [3,4,5]
- Explanation: The middle node of the list is node 3.
Example 2:
![image2](https://assets.leetcode.com/uploads/2021/07/23/lc-midlist2.jpg)
- 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.
Constraints:
- The number of nodes in the list is in the range [1, 100].
- 1 <= Node.val <= 100