Role - Backend Developer
Experience - 3 years 1 month
Location - Gurugram

Round 1 - DSA

• Design a data structure to implement a song player where n songs are to be played in a shuffled manner. Each song is to be chosen randomly and no song is to be repeated. Expected space complexity - O(1)
• Find the top k scores at each stage from the incoming stream of millions of users
  Verdict - Positive

Round 2 - DSA and Core Java Round

• The round started with project discussion and follow-up questions
• DSA question - A project has several sub-tasks given along with the execution time for each. Each sub-task is either independent or requires the execution of some dependent task previously. Given that tasks can be executed in parallel, find the optimal sequence of sub-tasks execution so that the entire project completion takes the least amount of time. This is a good question related to topological sorting and BFS.
• Write the syntax of singleton class - few follow-up questions were asked.
  Verdict - Negative as I couldn't answer the follow-up questions.

Rejected - as each round was eliminatory.