Leetcode 1019: Finding the next greatest node — the Domino effect
The Problem and example I/O:
The problem statement is to find the next greatest element in a linked List. So for the ith node we have to find the jth node, such that node value of j is greater than ith.
The catch here is that we have to find the most recent one. Let’s take an example:
output => [5,5,0]