Recently, Josh Technology conducted an on-campus recruitment drive for the Software Developer (SD) role for the 2025 graduating batch. I’m here to share my experience. The recruitment process for the Software Developer role at Josh Technology Group consists of 8 levels, with each being an elimination round.
Pre-Interview Rounds:
Round 1: MCQ Round (Elimination)
This round featured 50 MCQs on topics like pointers, OOPs, output prediction and DSA fundamentals. The time limit was 50 minutes, and a good understanding of pointers, OOPs and DSA gives you an edge.
Round 2: Subjective Round (Elimination)
With 75 minutes, this round covered sections like English, logic, reasoning, aptitude, and two coding problems with sectional timings for each section, making it more challenging. The coding problems were straightforward, mainly covering arrays and trees. The questions were easy.
One Question resembled, Leetcode #283 Move Zeroes (Easy)
Another Question resembled, Leetcode #513 Find Bottom Left Tree Value (Moderate)
Round 3: Coding Round (Elimination)
Three coding problems in 75 minutes. They involved topics like linked lists, binary trees, and arrays. You can find similar questions on leetcode and gfg.
- LeetCode #1448 – Count Good Nodes in Binary Tree (Moderate)
- LeetCode #739 – Daily Temperatures (Easy)
- GFG: Sort a linked list of 0s, 1s and 2s.(Easy)
Two questions passed all test cases, while the third only passed two. Yet, writing comments and providing time complexity improved my performance and allowed me to proceed for interview rounds.
Round 4: Personality Test(Non-Elimination)
Before the interview rounds, they sent an assessment link for a personality test, which consisted of 124 questions to be completed in 45 minutes. This assessment was provided a day before the scheduled interviews and evaluated aspects like personality traits and communication skills.
Interview Rounds:
Only 8 candidates were shortlisted for the interview process. They scheduled three technical interviews for the same day.
Round 5: Technical Interview 1 (Elimination)
The first interview, conducted through Pod AI for 1 hr 9 mins, The interview started with my introduction and then shifted to DSA questions. I was given two DSA questions on linked lists and binary trees. You can these both questions on gfg.
- Maximum sum of nodes in Binary tree such that no two are adjacent (Moderate)
- Rotate the sub-list of a linked list from position M to N to the right by K places(Moderate)
The interviewer was friendly and provided hints, but I struggled with optimizing my approach, which ultimately led to my rejection.
Verdict: Rejected
Final Thoughts:
Though the outcome was disappointing, it was an invaluable learning experience. The interviewer gave constructive feedback on my weaknesses and suggested areas for improvement.
The key takeaway: focus on optimizing your solutions, practice mock interviews, and solve more questions on trees, arrays, and linked lists on platforms like LeetCode and GeeksforGeeks.
Thanks for reading about my experience. Keep coding and Never Give Up!