As a part of the Juspay Hiring Challenge:\n\n**Round 1**\n* MCQ round.\n* Consisted of mostly easy questions surrounding C++, DBMS, OOPS, Complexity Analysis, etc.\n* 30 minutes long, 30 questions, 1 min/question\n* Got shortlisted\n\n**Round 2**\n* 1.5 hours\n* 3 questions on Graphs (easy to medium level)\n* Check whether node X can reach node Y.\n* How many nodes to remove to disconnect node X from node Y?\n* Find minimum cost path from node X to node Y.

As a part of the Juspay Hiring Challenge:\n\nRound 1\n MCQ round.\n Consisted of mostly easy questions surrounding C++, DBMS, OOPS, Complexity Analysis, etc.\n 