Satyanarayana Raju & Co. Software Engineer interview questions

def find_values(A): n = len(A) next_greater = [-1] * n next_smaller = [-1] * n stack = [] for i in range(n): while stack and A[i] > A[stack[-1]]: next_greater[stack.pop()] = i stack.append(i) stack = [] for i in range(n): while stack and A[i] < A[stack[-1]]: next_smaller[stack.pop()] = i stack.append(i) result = []