class Solution:

def nextGreaterElement(self, nums1: List[int], nums2: List[int]) -> List[int]:

# O (n + m)

nums1Idx = { n:i for i, n in enumerate(nums1) }

res = [-1] * len(nums1)

stack = []

for i in range(len(nums2)):

cur = nums2[i]

# while stack exists and current is greater than the top of the stack

while stack and cur > stack[-1]:

val = stack.pop() # take top val

idx = nums1Idx[val]

res[idx] = cur

if cur in nums1Idx:

stack.append(cur)

return res

# O (n * m)

nums1Idx = { n:i for i, n in enumerate(nums1) }

res = [-1] * len(nums1)

for i in range(len(nums2)):

if nums2[i] not in nums1Idx:

continue

for j in range(i + 1, len(nums2)):

if nums2[j] > nums2[i]:

idx = nums1Idx[nums2[i]]

res[idx] = nums2[j]

break

return res

classSolution:

defcalPoints(self,operations:List[str])->int:

score_stack= []

foroinoperations:

ifo=="+"andlen(score_stack)>=2:

summed=score_stack[-2]+score_stack[-1]

score_stack.append(summed)

elifo=="D"andlen(score_stack)>=1:

doubled=score_stack[-1]*2

score_stack.append(doubled)

elifo=="C"andlen(score_stack)>=1:

score_stack.pop()

else:

score_stack.append(int(o))

returnsum(score_stack)