I participated in the **Juspay Hiring Challenge** on HackerEarth.\n\n**Round 1 :** It consisted of 3 questions on graphs each with a slightly harder difficulty than the last. Although they were based on basic graph traversal algorithms like **BFS** and **DFS**. \n\n**Round 2 :** Next Round was a hackathon which was divided in 2 parts over 2 weekends.\n**Part 1:** A Question was asked based on a Tree where we had to implement some operations on the nodes viz. lock, unlock and upgrade. There was plenty of time and after some brainstorming for edge cases it was easy enough. \uD83D\uDE05\n**Part 2:** A follow up discussion over the solution for Part 1 and some new constraints regarding thread safety with and without the use of mutex. This round was based on slack and google meet and lasted for about 7 hours (give or take \uD83D\uDE10). **TIP:** try to assume that the kernel doesn\'t support mutex and try to design one of your own.\n\n**Round 3 :** After Part 2 there was a Systems round and it was quite tough, (i haven\'t appeared for a systems round before but it was something else). I was supposed to give analogies for Context switching and timing in some Single Processor Compute Environment. I did a very bad job of trying to explain it. \uD83D\uDE25\n\n**Round 4 :** Lastly there was a culture fit round with the Founder, this round was one of the best interactions i had in an interview. It was more like a discussion and he told me about the company vision and asked about my school and college life so far, he was a kind of person you want to interact with. \n\nFinally i got the call that i was selected and got the offer.\nThe style of recruiting was very fresh and i liked the journey as i was challenged to solve problems that i wouldn\'t be able to solve in an 1 hour interview otherwise.

I participated in the Juspay Hiring Challenge on HackerEarth.\n\nRound 1 : It consisted of 3 questions on graphs each with a slightly harder difficulty than the