Solution #496 (Python) - Daniel - 16/06/2025 - commit Dijkstra-Edu#1

Author: Daniel Nallapalli

Arrays101/#496 - Next Greater Element - Easy/Solution.py

@@ -0,0 +1,20 @@
+class Solution(object):
+    def nextGreaterElement(self, nums1, nums2):
+        """
+        :type nums1: List[int]
+        :type nums2: List[int]
+        :rtype: List[int]
+        """
+        next_greater = {}
+        stack = []
+
+        for num in nums2:
+            while stack and num > stack[-1]:
+                prev = stack.pop()
+                next_greater[prev] = num
+            stack.append(num)
+
+        for num in stack:
+            next_greater[num] = -1
+
+        return [next_greater[num] for num in nums1]