LeetCode 2058. Find the Minimum and Maximum Number of Nodes Between Critical Points Java Solution

Problem Description Problem: LeetCode 2058. Nodes Between Critical Points Description: Given a singly linked list, we need to find the minimum and maximum distance between nodes that are local maxima (a value greater than its neighbors) or local mi...