Josh Technology Group Interview Questions, Process, and Tips

Aptitude+CS fundamentals questions were asked

4 questions majorly based on trees and linked list

Again 3 ques 1 was based on trees,another in linked list and 3rd on kadanes algorithm

Q1. Left view of tree
Ans. 
Left view of a tree is the set of nodes visible when the tree is viewed from the left side.
• Traverse the tree in a level order manner

• Keep track of the first node encountered at each level

• Add the first node encountered at each level to the result array
Answered by AI
Add your answer
Q2. Riddle based question
Add your answer
Q3. Detect a loop in linked list
Ans. 
Use Floyd's Tortoise and Hare algorithm to detect a loop in a linked list.
• Initialize two pointers, slow and fast, at the head of the linked list.

• Move slow pointer by one step and fast pointer by two steps.

• If they meet at any point, there is a loop in the linked list.
Answered by AI
Add your answer

They only focuses on DSA

Q1. Basic C and C++ mcqs
Add your answer
Q2. Function, pointers , time complexity
Add your answer

In first round there were two test
1st is the personality test.
2nd is the aptitude test were they asked about 10 aptitude questions and around 40 coding based questions, some of them were mcq and rest were output based.

Contains 4 DSA based questions, 1 question was hard, and other 3 questions were of medium level.

Basic multiple-choice questions on programming languages.

DSA round 1 , 3 questions on arrays, LL, trees

DSA round 2 : 3 questions on stack and queue, trees, dp

I was asked 60 question with various snppits or problems to be solved within a time frame of 1 hour

3 dsa 2 medium 1 hard

To create a project in which i was asked to simply create a exact same page as given in design