I don’t remember the questions exactly, but one was of DP and the other was a Tree question
Round 2: Technical Interview
Stock buy and sell: You are given an array of prices where prices[i] is the price of a given stock on an ith day. You want to maximize your profit by choosing a single day to buy one stock and choosing a different day in the future to sell that stock. Return the maximum profit you can achieve from this transaction. If you cannot achieve any profit, return 0.