Round 1: This was a DS/Algo round (60 mins)\n\n1. https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/\n2. Left/Right view of Binary Tree\n3. Find pivot element in an array such that all elements to the left are less than it while all elements to the right are more than it.\n\nExpectation was to write a pseudo code and dry run.\n\nRound 2: LLD Design(60 mins)\nWas asked to design a food delivery service like Swiggy.\n\nGot a rejection email from the HR.

Round 1: This was a DS/Algo round (60 mins)\n\n1. https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/\n2. Left/Right view of Binary Tree\n3. Find 