I applied through college or university. The process took 1 day. I interviewed at Josh Technology Group (Gurgaon, Haryana) in Dec 2024
Interview
There were 3 rounds of Technical Interviews, all were focused on Data Structures and Algorithms. Topics asked were LinkedList, Binary Trees, Arrays, Sorting. Each round of an elimination round. After getting selected in all 3, last round was the HR round.
Interview questions [1]
Question 1
the interviews totally revolved around Data Structures and Algorithms
I applied through college or university. I interviewed at Josh Technology Group (Mohali, Punjab) in Jun 2026
Interview
The recruitment process consisted of multiple assessment rounds before the final interview stage. I participated in the first two assessment rounds.
The first round was a technical test containing MCQs on C, C++, Data Structures & Algorithms, and output-based programming questions. The second round included aptitude, logical reasoning, English questions, and two coding problems.
The coding questions involved comparing two linked lists and checking whether two binary trees contained the same leaf node values. Candidates who cleared these rounds were shortlisted for a further coding assessment and interview process. I was not shortlisted beyond the second assessment round.
Interview questions [1]
Question 1
Technical questions focused on C, C++, DSA concepts, and predicting the output of code snippets. The second assessment included aptitude, logical reasoning, English questions, and two coding problems. One coding problem involved comparing linked lists, while the other required checking whether two binary trees had the same leaf node values despite potentially different structures.
I applied through college or university. The process took 1 week. I interviewed at Josh Technology Group (Gurgaon, Haryana) in Apr 2025
Interview
3 rounds. 1. Coding MCQ(50 minutes) 2. Subjective Round (75 minutes) 3. Coding Round (75 minutes) . it was a on campus opportunity for SD intern. In MCQ round questions are C output based.