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

Questions related to input and output.

Subjective Round:4 questions related to coding.

Q1. 3 Interview round and finally HR round
Add your answer

They would ask searching sorting , binary search in first round

Q1. Most of question were from Tree and DP
Add your answer
Q2. Delete a node from a binary tree.
Ans. 
Delete a node from a binary tree.
• Find the node to be deleted

• If the node has no children, simply delete it

• If the node has one child, replace it with its child

• If the node has two children, find the minimum value in its right subtree, replace the node with that value, and delete the minimum value node
Answered by AI
Add your answer

Round duration - 150 Minutes
Round difficulty - Medium

3 coding question + 50 dsa

Q1. 
Majority Element Problem Statement
Given an array/list 'ARR' consisting of 'N' integers, your task is to find the majority element in the array. If there is no majority element present, return -1.
Exampl...read more
Ans. 
Find the majority element in an array, return -1 if no majority element exists.
• Iterate through the array and keep track of the count of each element using a hashmap.

• Check if any element's count is greater than floor(N/2) to determine the majority element.

• Return the majority element or -1 if no majority element exists.
Answered by AI
Add your answer
Q2. 
Height of a Binary Tree
You are provided with an arbitrary binary tree consisting of 'N' nodes where each node is associated with a certain value. The task is to determine the height of the tree.
Explana...read more
Ans. 
Calculate the height of a binary tree given its level order traversal.
• Traverse the binary tree level by level and keep track of the height as you go down the tree.

• Use a queue data structure to perform level order traversal efficiently.

• The height of a binary tree is the maximum number of edges from the root to any leaf node.

• Handle NULL nodes represented by -1 in the input.

• Return the height of the binary tree as a single
Answered by AI
Add your answer
Q3. 
Number of Islands Problem Statement
You are provided with a 2-dimensional matrix having N rows and M columns, containing only 1s (land) and 0s (water). Your goal is to determine the number of islands in t...read more
Ans. 
Count the number of islands in a 2D matrix of 1s and 0s.
• Use Depth First Search (DFS) or Breadth First Search (BFS) to traverse the matrix and count the number of connected components.

• Maintain a visited array to keep track of visited cells to avoid counting the same island multiple times.

• Iterate through each cell in the matrix and if it is a land (1) and not visited, perform DFS/BFS to explore the connected land cells.

• I...read more
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Hard

2 coding questions

Q1. 
Maximum Length Pair Chain Problem Statement
You are given 'N' pairs of integers where the first number is always smaller than the second number, i.e., in pair (a, b) -> a < b always. A pair chain is...read more
Ans. 
Find the length of the longest pair chain that can be formed using the given pairs.
• Sort the pairs based on the second element in ascending order.

• Iterate through the sorted pairs and keep track of the maximum chain length.

• Update the chain length if the current pair can be added to the chain.

• Return the maximum chain length at the end.
Answered by AI
Add your answer
Q2. 
Maximize Stock Trading Profit
You are given an array prices, representing stock prices over N consecutive days. Your goal is to compute the maximum profit achievable by performing multiple transactions (i...read more
Ans. 
Find maximum profit by buying and selling stocks multiple times.
• Iterate through the array and find all increasing sequences of stock prices.

• Calculate profit by buying at the start and selling at the end of each increasing sequence.

• Sum up all profits to get the maximum profit achievable.
Answered by AI
Add your answer

Round duration - 45 minutes
Round difficulty - Medium

Data structures,java script,web dev related questions,dbms questions

Q1. Can you describe how to design a web crawler?
Ans. 
Designing a web crawler involves defining the scope, selecting a crawling strategy, implementing the crawler, handling data storage, and ensuring politeness.
• Define the scope of the web crawler by determining the websites to crawl and the depth of the crawl.

• Select a crawling strategy such as breadth-first or depth-first search based on the requirements.

• Implement the web crawler using a programming language like Python o...read more
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

Students who qualified in first round gets link for this round, this round had 4 questions in total, out of which 1 was output based and 3 was DSA based.

Q1. 
Validate Binary Tree Nodes Problem
You are provided with 'N' binary tree nodes labeled from 0 to N-1, where node i has two potential children, recorded in the LEFT_CHILD[i] and RIGHT_CHILD[i] arrays. Dete...read more
Ans. 
The task is to determine if the given binary tree nodes form exactly one valid binary tree.
• Check if there is only one root node (a node with no parent)

• Check if each node has at most one parent

• Check if there are no cycles in the tree

• Check if all nodes are connected and form a single tree
Answered by AI
Add your answer

Round duration - 75 minutes
Round difficulty - Medium

This round was of 70-75 minutes and had 3 coding questions of easy to medium level. There was some restrictions like we cannot use built-in functions in both second and third subjective round.

Q1. 
Balanced Binary Trees Problem Statement
You are provided with an integer 'H'. Your task is to determine and print the maximum number of balanced binary trees possible with height 'H'.
A balanced binary t...read more
Ans. 
The maximum number of balanced binary trees possible with a given height is to be counted and printed.
• A balanced binary tree is one in which the difference between the left and right subtree heights is less than or equal to 1.

• The number of balanced binary trees can be calculated using dynamic programming.

• The number of balanced binary trees with height 'H' can be obtained by summing the product of the number of balanced...read more
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

This was face to face interview round of 60 minutes. It was mostly based on DSA, some questions was also asked related to my projects and DBMS. Interviewer was kind and good.

Q1. 
Wave Array Sorting Problem
Your goal is to sort a given unsorted array ARR such that it forms a wave array.
Explanation:
After sorting, the array should satisfy the wave pattern conditions:
• ARR[0] &...read more
Ans. 
The task is to sort an array in a wave form, where each element is greater than or equal to its adjacent elements.
• Iterate through the array and swap adjacent elements if they do not follow the wave pattern

• Start from the second element and compare it with the previous element, swap if necessary

• Continue this process until the end of the array

• Repeat the process for the remaining elements

• Return the sorted wave array
Answered by AI
Add your answer
Q2. 
Maximum Sum BST Problem Statement
You are presented with a Binary Tree 'root', which may not necessarily be a Binary Search Tree (BST). Your objective is to identify the maximum sum of node values in any ...read more
Ans. 
The task is to find the maximum sum of node values of any subtree that is a Binary Search Tree(BST).
• Traverse the binary tree in a bottom-up manner

• For each node, check if it forms a BST and calculate the sum of its subtree

• Keep track of the maximum sum encountered so far

• Return the maximum sum
Answered by AI
Add your answer

Round duration - 135 minutes
Round difficulty - Hard

This was the final technical round, it was around 2.5 hours long and based on mostly DSA and little bit Projects, DBMS, OS. Josh mainly focus on DSA and on Tree Data Structure in interview.

Q1. 
Pair Sum in BST Problem Statement
Given a Binary Search Tree (BST) and a target value K, determine if there exist two unique elements in the BST such that their sum equals K.
Input:
An integer T, the nu...read more
Ans. 
The task is to check if there exist two unique elements in the given BST such that their sum is equal to the given target 'K'.
• Traverse the BST in-order and store the elements in a sorted array

• Use two pointers, one at the beginning and one at the end of the array

• Check if the sum of the elements at the two pointers is equal to the target 'K'

• If the sum is less than 'K', move the left pointer to the right

• If the sum is grea...read more
Answered by AI
Add your answer
Q2. 
Find Nodes at Distance K in a Binary Tree
Your task is to find all nodes that are exactly a distance K from a given node in an arbitrary binary tree. The distance is defined as the number of edges between ...read more
Ans. 
The task is to find all nodes in a binary tree that are at a distance K from a given node.
• Implement a function that takes the binary tree, target node, and distance K as input.

• Use a depth-first search (DFS) algorithm to traverse the tree and find the nodes at distance K.

• Keep track of the distance from the current node to the target node while traversing.

• When the distance equals K, add the current node to the result lis...read more
Answered by AI
Add your answer

Round duration - 20 minutes
Round difficulty - Easy

This was the simple 20 minutes round