← Interview experiences
JTRejected

Software Developer (Internship + Full time) at Josh Technology Group

Difficulty
Process took
1-2 Weeks
Rounds
3
Format
On site
Applied via
Other

How it went

  • Don't expect anything, even if you solve all the OA questions; someone who solves only two questions might still get accepted for the interviews. They randomly select at the end in case of on-campus placements.

What they would tell you

  • Don't expect anything, even if you solve all the OA questions; someone who solves only two questions might still get accepted for the interviews. They randomly select at the end in case of on-campus placements.

How to prepare

  • Do c/c++ output-based questions from websites like GFG
  • Trees, graphs, and linked lists are the most important topics; do all the standard problems on these.

Their background

FInal year student

Round by round

  1. 1

    Tech MCQ60 min

    This was a on-campus drive

    This round consisted of guess te output (c language) and technical MCQ (both C and C++) This round wasn't that hard and just going through all the guess the output sets in gfg is enough to clear it. Very basic oops questions were also asked.

    In each round ~50% of the students were eliminated

  2. 2

    LR + Quant + Easy coding60 min

    This was also a very easy round 40 points were for LR and quant and two coding questions were asked with 40 points total The difficulty of questions was easy

    LR - Basic direction test and blood relation questions were asked, I don't remember all of these Quant - Time and work, Upstream down stream, profit loss , Don't remember all of of them .

    Coding questions

    • A linked list was given with nodes N, N is even always, maintain two types of score even score and odd score, all the nodes at even index contributes to even score and all the nodes at odd index contributes to odd score, return both even and odd score in the end. Example 1->4->5->3->9->3 , odd score = 1 + 5 + 9 = 15 and even score = 4 + 3 + 3 = 10
    • Next was a tree question like child sum in which you have to return the final sum with rules: if parent is -1 then sum the children , if parent is -2 then subtract the left child with right example -1 -2 -1 10 4 5 6 as 10 and 4 has parent -2 they will be subtracted and 6 will be returned as 5 and 6 has the parent -1 they will be added and 11 will be returned this will make the tree: -1 6 11 now as -1 is the parent they will be added and 17 will be returned as the final answer.
  3. 3

    Easy - medium coding round77 min

    In this three standard coding questions were asked 1 easy and two mediums

What came up

Easy MediumOn site0 1 years

A candidate-reported account, lightly edited. Interview processes change by team and date.

Sources