Junglee Games | SDE II - Backend | June 2021 | Bangalore | Offer
Summary
I recently interviewed at Junglee Games for an SDE II - Backend position and received an offer. The interview process spanned four rounds, covering data structures, algorithms, core Java, system design, and in-depth project discussions.
Full Experience
I recently interviewed with Junglee Games for an SDE II - Backend position. My background includes previous roles at Teradata and Wissen Technology, bringing 2 years of experience. I hold an M.Tech from the University of Hyderabad and a B.Tech from the University of Calcutta.
The interview process consisted of four distinct rounds:
- Round 1 (HackerRank): This was an online coding assessment where I had to solve 3 standard problems, including DP and Two Pointer techniques, within 90 minutes. Additionally, there were 10 MCQs focused on core Computer Science subjects.
- Round 2 (SDE II Interview): This round primarily focused on my projects and the technologies I had worked on, with a significant emphasis on AWS and Spark given my prior experience. The interviewer also delved into Cassandra and Kafka. Towards the end, I was asked to solve two coding problems:
- Remove duplicates from a linked list, requiring a solution in a single traversal.
- Given an integer 'n', print all binary representations of integers between 1 and 'n', with the constraint of not using any bitwise operators.
- Round 3 (SDE III Interview): This was an entirely technical round, without any specific data structures or algorithms questions. There was extensive discussion on my projects and an in-depth examination of core Java concepts, including Multithreading, Inheritance, and Collections. A strong understanding of core Java was crucial here. Questions also extended to AWS, Redis, and Kafka.
- Round 4 (VP of Engineering Interview): This round was taken by the VP of Engineering and centered on system design. I was tasked with a design problem for an e-commerce platform, discussing data structures, scalability, and concurrency handling. Following this, I answered some conceptual core Java questions.
Interview Questions (2)
Remove duplicates from a given linked list in a single traversal.
Given an integer n, print all binary representations of integers between 1 and n. The constraint is that no bitwise operators can be used.
Preparation Tips
My preparation involved extensive practice on LeetCode, where I solved a significant number of problems, including 132 hard problems. I consistently participated in weekly and bi-weekly contests, making sure not to miss them. Most importantly, I practiced regularly and persisted with hard problems until I solved them, sometimes taking 3-4 days for a single problem.
I also prepared core Java very thoroughly. Given my previous work experience with AWS and Spark, I revised those concepts again before the interview. For system design, I read a lot of articles and watched numerous YouTube videos.