Good pay in the office and a good atmosphere.
None ever found any of.
3 coding questions based on trees and graphs: 1. Find the set of strings from the dictionary of strings. 2. Find the maximum possible path for the given tree from the given set of nodes. 3. Shortest path sum logic in a graph question.
Two technical rounds were conducted. All rounds were elimination rounds. The first round was an Online Assessment where medium to hard level DSA questions were asked. The second round was a technical interview.
I had a total of 4 interview rounds, as follows: * The first 2 were DSA rounds. * Then, 1 Low-Level Design (LLD) round. * Finally, 1 High-Level Design (HLD) round. All rounds had the last 10-15 minutes dedicated to questions based on any of t
3 coding questions based on trees and graphs: 1. Find the set of strings from the dictionary of strings. 2. Find the maximum possible path for the given tree from the given set of nodes. 3. Shortest path sum logic in a graph question.
Two technical rounds were conducted. All rounds were elimination rounds. The first round was an Online Assessment where medium to hard level DSA questions were asked. The second round was a technical interview.
I had a total of 4 interview rounds, as follows: * The first 2 were DSA rounds. * Then, 1 Low-Level Design (LLD) round. * Finally, 1 High-Level Design (HLD) round. All rounds had the last 10-15 minutes dedicated to questions based on any of t