Amazon Interview Questions and Answers

Find the maximum profit by buying and selling a stock once based on given prices.

• Iterate through the prices array and keep track of the minimum price seen so far and the maximum profit achievable.

• Calculate the profit by subtracting the current price from the minimum price and update the maximum profit if needed.

• Return the maximum profit, ensuring it is not negative.

• Example: prices = [2, 100, 150, 120], Buy at 2, sell at 150, profit = 150 - 2 = 148.

The challenge involves forming dance pairs from available boys and girls based on potential pairings to maximize the number of pairs.

• Parse the input to get the number of test cases, boys, girls, and potential pairings.

• Iterate through the potential pairings and form pairs based on the given indexes.

• Output '1' if a set of maximum possible pairs is returned, else output '0'.

• There can be multiple valid configurations of pairs.

• Example: For input '2 2 2' and pairings '1 1' and '2 2...read more

The question asks to construct a k-ary tree using the given k and DFS traversal string.

• Iterate through the DFS traversal string

• If the current character is 'P', create a parent node

• If the current character is 'L', create a leaf node

• Link the nodes according to the DFS traversal order

Splitwise is a system for managing shared expenses among groups of people.

• Classes: User, Expense, Group

• Functions: addExpense(), settleUp(), calculateBalance()

To determine if a graph has a node with n degree, iterate through all nodes and count their edges.

• Iterate through each node in the graph

• Count the number of edges connected to each node

• If any node has n edges, then the graph has a node with n degree