876. Middle of The Linked List - https://leetcode.com/problems/middle-of-the-linked-list/

middleNode.java

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode() {}
 *     ListNode(int val) { this.val = val; }
 *     ListNode(int val, ListNode next) { this.val = val; this.next = next; }
 * }
 */
class Solution {
    public ListNode middleNode(ListNode head) {
        ListNode node = head;
        ListNode[] nodes = new ListNode[100];

        int index = 0;
        while(node != null) {
            nodes[index++] = node;
            node = node.next;
        }

        return nodes[index / 2];
    }
}