Summary
I interviewed for an SDE Backend (Java) role at TechMojo Solutions, bringing 1.2 years of experience. The process included an online coding test, two technical rounds covering Java concurrency, DSA, design patterns (specifically Strategy), and Kafka, which led to a scheduled HR discussion.
Full Experience
My interview journey at TechMojo Solutions for an SDE Backend position, focusing on Java, began when HR reached out to me through my Naukri profile. With 1.2 years of full-time backend development experience, I was eager to explore this opportunity.
The initial stage was Round 1, an online test administered on HackerRank. It lasted 60 minutes and comprised two coding questions of medium difficulty; unfortunately, I don't recall the exact problems.
Next was Technical Round 1, which concentrated on Java and Data Structures & Algorithms. I was asked to write Java code to demonstrate a deadlock scenario, which was an interesting challenge. We then had a discussion on Design Patterns, with a particular emphasis on the Strategy pattern. Finally, I solved a DSA problem titled 'Number of Good Binary Strings'.
Technical Round 2 delved deeper into Backend concepts and presented another DSA problem. There were in-depth questions about Kafka, requiring a solid understanding of its workings. For the DSA part, I had to solve 'Minimum Value to Get Positive Step by Step Sum'. My past work experience also formed a significant portion of the discussion during this round.
After successfully navigating these technical rounds, I received confirmation that I had been shortlisted for the HR round. I was informed that salary discussions and other formalities would take place in this final stage.
Interview Questions (4)
Asked to write Java code for a deadlock scenario. The task involved demonstrating how a deadlock occurs between multiple threads accessing shared resources and potentially implementing a solution or explanation for preventing it.
Questions on Design Patterns, with a specific focus on the Strategy pattern. This involved discussing its principles, use cases, advantages, and possibly how to implement it in Java.
A Data Structures and Algorithms problem titled 'Number of Good Binary Strings'.
A Data Structures and Algorithms problem titled 'Minimum Value to Get Positive Step by Step Sum'.