Josh Technology Group Software Developer Interview Questions, Process, and Tips

It is very impressive work on Josh technology assessment because we learn many new skills.

Q1. What is api and how it is work ?
Ans. 
API stands for Application Programming Interface. It is a set of rules and protocols that allows different software applications to communicate with each other.
• APIs define the methods and data formats that applications can use to request and exchange information.

• APIs can be used to access services provided by other software applications, such as retrieving data from a database or sending notifications.

• Examples of APIs ...read more
Answered by AI
Add your answer
Q2. What is software development life cycle and which steps are following?
Ans. 
Software development life cycle (SDLC) is a process used by software developers to design, develop, and test software.
• 1. Planning: Define the project scope, requirements, and objectives.

• 2. Analysis: Gather and analyze user requirements.

• 3. Design: Create a detailed design of the software.

• 4. Implementation: Develop the software based on the design.

• 5. Testing: Test the software for bugs and issues.

• 6. Deployment: Release t...read more
Answered by AI
Add your answer

All multiple-choice questions on object-oriented programming and pointers.

Questions related to linked lists and trees.

Three questions, all regarding LinkedIn, focusing on lists and trees.

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

It was an 1 hour round with pseudocodes of c different subject questions and it was an objective test

It was difficult with question of medium to hard level

Q1. IT WAS MCQ CODING OUTPUT BASED ROUND IN WHICH TOTAL 45 QUESTION
Add your answer

Q1. IT WAS SUBJECTIVE CODING ROUND IN WHICH 1 OUTPUT BASED AND 3 CODING ROUND
Add your answer

IT WAS 3RD CODING ROUND IN WHICH 3 CODING QUESTIONS AND DURATION 75MIN