MediumNo. 1019

Next Greater Node In Linked List — LeetCode 1019 Python Solution

Topics
Stack, Array, Linked List, Monotonic Stack
Reading time
4 min

The problem

You are given the head of a linked list with n nodes. For each node in the list, find the value of the next greater node.

Example

Input
head = [2,1,5]
Output
[5,5,0]

Python solution

PythonSolution
# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, val=0, next=None):
#         self.val = val
#         self.next = next
class Solution:
    def nextLargerNodes(self, head: Optional[ListNode]) -> List[int]:
        nums = []
        while head:
            nums.append(head.val)
            head = head.next
        stk = []
        n = len(nums)
        ans = [0] * n
        for i in range(n - 1, -1, -1):
            while stk and stk[-1] <= nums[i]:
                stk.pop()
            if stk:
                ans[i] = stk[-1]
            stk.append(nums[i])
        return ans

Complexity

Time
O(n)
Space · auxiliary
O(n)

Pattern: Linked List

Rewire pointers in place, with a dummy head and a saved next to keep it safe. LeetCode 1019. Next Greater Node In Linked List is filed here because LeetCode tags it Linked List, which is the vocabulary this hub collects.

The linked list guide has the Python template for the pattern and the 75 LeetCode problems that use it.

Related problems

Related problems
No.ProblemDifficulty
2289Steps to Make Array Non-decreasingMedium
0084Largest Rectangle in HistogramHard
0456132 PatternMedium
0503Next Greater Element IIMedium
0654Maximum Binary TreeMedium
0739Daily TemperaturesMedium

Frequently asked questions

How hard is LeetCode 1019. Next Greater Node In Linked List?

LeetCode 1019. Next Greater Node In Linked List is rated Medium on LeetCode.

What is the time complexity of LeetCode 1019. Next Greater Node In Linked List?

The Python solution on this page runs in O(n).

What is the space complexity of LeetCode 1019. Next Greater Node In Linked List?

The Python solution on this page uses O(n) auxiliary space.

What topics does LeetCode 1019. Next Greater Node In Linked List cover?

LeetCode 1019. Next Greater Node In Linked List is tagged Stack, Array, Linked List and Monotonic Stack on LeetCode.

Stuck on problems like this in a live interview?

Stealth Interview is a desktop app for macOS and Windows. It reads the problem off your screen and returns a working solution with a step-by-step explanation and its time and space complexity, invisible to screen sharing.

Free to download. Check it runs on your machine, then pick a plan.