₹15.88 LPA at JTG? My Software Developer Interview Experience

Company: Josh Technology Group (JTG)
Role: Software Developer
Location: Gurugram
Applied Through: College Placement Drive
Package: ₹15.88 LPA
Difficulty: Medium–Hard

I participated in Josh Technology Group’s (JTG) recruitment process for the Software Developer role through my college placement drive.The process included three college-level assessments, a separate coding assessment at JTG, and multiple technical interview rounds.

One important detail was that all the online assessments were conducted using the Safe Exam Browser (SEB) application.

Here’s how my interview process went.

1. College-Level Online Assessments

The process started with three online assessment rounds conducted at my college. All three were elimination rounds.

Round 1: Subjective Test

The first round was a technical assessment consisting mainly of MCQ-based and code-output questions. I had to analyze code snippets and answer questions based on their behavior.

Round 2: Objective Test

The second round included technical questions along with aptitude questions. It tested my understanding of technical concepts and my general problem-solving ability.

Round 3: Coding Test

The third round was a coding assessment containing three programming questions.

After clearing all three rounds, I was shortlisted for the next stage and had to travel to JTG's Gurugram office.

2. JTG Coding Assessment

After reaching the JTG office, I appeared for another online coding assessment. This round consisted of two DSA problems.

Problem 1: Deepest Level Sum of a Binary Tree

I was given a binary tree and had to calculate the sum of all nodes present at its deepest level.

Problem 2: Maximum Sum of Three Increasing Values

I was given an array of prices or values and had to select three indices (i < j < k) such that:

[
price[i] < price[j] < price[k]
]

The objective was to maximize:

[
price[i] + price[j] + price[k]
]

I was able to pass all the test cases in this assessment.

3. Technical Interview Process

After completing the JTG assessment, I expected to proceed through the technical interview rounds in sequence. However, I received an email directly for Technical Interview Round 2, skipping Round 1.

Towards the end of the process, the interviewer explained that my assessment solutions had been considered fully optimal, which was why I had been moved directly to Round 2.

All the technical interviews were conducted face-to-face at the JTG Gurugram office. Each round lasted approximately two hours, making the process quite intensive.

4. Technical Interview

The interview began with a brief introduction, followed by an in-depth discussion about my project.

The interviewer asked me about:

• My project's overall functionality

• Project architecture

• Technologies used

• My individual contribution

• How different components worked together

After the project discussion, we moved to DSA. The problems were around medium difficulty.

Problem 1: Minimum Length Subarray to Sort

I was given an array and had to find the length of the smallest contiguous subarray that needed to be sorted so that the entire array would become sorted.

If the array was already sorted, the expected output was -1.

Problem 2: Longest Consecutive Sequence in a Binary Tree

I was asked to find the longest downward path in a binary tree where each child node's value was exactly one greater than its parent's value.

The path could move only downward, from parent to child.

This problem was essentially the Binary Tree Longest Consecutive Sequence problem.

5. Technical Interview

After completing Round 2, I received an email for the next technical interview.

This round was also conducted face-to-face at the Gurugram office and lasted approximately two hours.

The interviewer started with my introduction and then discussed my project, including its implementation and technical details. After that, I was given two DSA problems that were around medium-to-hard difficulty.

Problem 1: Maximum Sum Subarray Using Inorder Traversal

I was given a binary tree and had to consider its inorder traversal to find the maximum sum of a contiguous subarray.

I recognized the connection with Kadane's Algorithm and explained how I could combine inorder traversal with Kadane's approach to solve the problem.

Problem 2: Split N into M Positive Integer Parts

I was given two integers, N and M, and had to generate all possible ways to divide N into exactly M positive integers such that their sum equaled N.

For example, the task was to generate every valid combination of positive integer parts satisfying the given conditions.

I identified backtracking as a suitable approach and explained my reasoning to the interviewer.

The difficulty increased as I progressed through the recruitment process.

My Overall Experience

My JTG interview experience was heavily focused on DSA, problem-solving, and project understanding. The interviewers were interested not only in the solutions I proposed but also in how I broke down problems and explained my reasoning.

Overall, the process progressed from college-level assessments to a dedicated coding assessment and then lengthy technical interviews. It tested both my coding ability and my understanding of the decisions behind my solutions.