Filter interviews by
I was interviewed in Aug 2021.
Round duration - 75 minutes
Round difficulty - Medium
Round held at 12 noon. There were 2 interviewers
You are provided with an array of distinct elements, and your task is to rearrange the array elements in a zig-zag manner. Specifically, for every odd index i
, the element ARR[...
You are given an arbitrary binary tree consisting of N
nodes where each node is associated with an integer value from 1 to 9. Each root-to-leaf path in the tree represents a ...
Round duration - 120 minutes
Round difficulty - Easy
Round held at 4pm. There were 2 interviewers
You are provided with a linked list containing 'N' nodes and an integer 'K'. The task is to reverse the linked list in groups of size K, which means reversing the nodes ...
Given an arbitrary binary tree, a specified node within the tree, and an integer 'K', find all nodes that are exactly 'K' distance away from the specified node. Retur...
Tip 1 : For every topic of DSA do at least 30 question so that you get good grasp on each topic
Tip 2 : Must go through OOPS, DBMS in details as they are very much asked in interview
Tip 3 : Also you should have complete knowledge of the technology used in your personal projects.
Tip 1 : Your resume must be of 1 page only
Tip 2 : You must have projects in your resume along with the practical impact it is making
I was interviewed in Aug 2021.
Round duration - 60 minutes
Round difficulty - Medium
Online Coding Test on Calyxpod platform. There were 2 coding questions
You are provided with two singly linked lists containing integers, where both lists converge at some node belonging to a third linked list.
Your task is to determine t...
Given a paragraph consisting of letters in both lowercase and uppercase, spaces, and punctuation, along with a list of banned words, your task is to find th...
Round duration - 70 minutes
Round difficulty - Easy
Advance Subjective Round on Calyxpod platform: 5 questions. One question was related to data structures and algorithms. Other 4 were related to Html, CSS and Javascript.
Given an integer N
representing the number of pairs of parentheses, find all the possible combinations of balanced parentheses using the given number of pairs.
Tip 1 : Be good in aptitude and data structures as it is the 1st/2nd round in most companies.
Tip 2 : Be prepared to explain your projects mentioned in the resume
Tip 3 : Do atleast 2 good projects.
Tip 1 : Do not write any false information on your resume.
Tip 2 : Keep your resume restricted to one page only.
I was interviewed in Jul 2021.
Round duration - 180 Minutes
Round difficulty - Medium
General Questions Like - Introduction & How all the round have gone so far
Round duration - 90 Minutes
Round difficulty - Medium
One-to-One Interview based on DSA and Front-End Technologies including HTML, CSS & JS.
You are given an array of integers. The task is to remove all duplicate elements and return the array while maintaining the order in which the elements were provided.
We will traverse the whole array and check if that element previously occurred or not.
The steps are as follows:
Round duration - 90 Minutes
Round difficulty - Hard
One-to-One Interview based on Front-End Technologies including HTML, CSS & JS.
In the last 10-20 minutes, some behavioral questions were asked:
1 How would you grade yourself in the interview so far?
2. You are present in a team and you have to convince your team members & client that your approach is better than the other team members.
3. You are the team leader & you have to point out & convey the negative points of a member of your team without getting him/her hurt.
- At last, they asked me if I have questions for them( I asked 2 questions ) & then the interview ended.
Given 'K' different arrays that are individually sorted in ascending order, merge all these arrays into a single array that is also sorted in ascending order.
O(N * K), Where ‘K’ is the number of arrays and ‘N’ is the average number of elements in every array.
We are using an array/list of size O(N * K) to store all the elements of the ‘K’ arrays/lists. T...
Tip 1 : Make at least 1 full-stack project from scratch.
Tip 2 : Understand each & every concept & topic in depth.
Tip 1 : Make it authentic.
Tip 2 : Sync your resume with company JD.
I was interviewed before Jun 2021.
Round duration - 50 minutes
Round difficulty - Medium
It was an online objective round held at 10:00AM. The platform had proctoring enabled for tab switches, refreshes, etc.
Round duration - 75 minutes
Round difficulty - Easy
This round was help at 2pm after the first round. Each round had elimination. Only those who cleared a round were allowed in the next round. This was also a proctored round. It had question on arrays and linked list.
Given a linked list consisting of 'N' nodes and an integer 'K', reverse the linked list in groups of size K. Specifically, reverse the nodes in each group starting from (1,...
Round duration - 45 minutes
Round difficulty - Easy
It was a technical interview round. It was held in the morning. We had to keep our camera on as it was video proctored. The interviewer did not turned on their camera. Initially I was asked for an introduction in which I told about myself and my projects and internships.
The interviewer gave me 2 coding problem. Although I was able to solve them easily, the interviewer seemed to be ready to help if stuck. The interviewer asked for extensive dry run on both the problems.
You are given the roots of two binary trees, root1
and root2
. Merge these two trees into a new binary tree. If two nodes overlap, sum the node values as the new no...
As the Government ramps up vaccination drives to combat the second wave of Covid-19, you are tasked with helping plan an effective vaccination schedule. Your goal is...
Round duration - 50 minutes
Round difficulty - Medium
It was a technical interview round. It was held in the morning. We had to keep our camera on as it was video proctored. The interviewer did not turned on their camera. Initially I was asked for an introduction in which I told about myself and my projects and internships. He also cross questioned on my projects.
The interviewer gave me 2 coding problem.. The interviewer gave hints whenever I got stuck.
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 ...
Ninja bought chocolate consisting of several chunks, and the sweetness of each chunk is represented in an array ARR
. He wants to divide the chocolate into K + 1
parts (...
Round duration - 25 Minutes
Round difficulty - Easy
Tip 1 : Practice up to the level to able to solve medium level questions.
Tip 2 : Question might get focused on Trees, Linked List and Arrays in the initial rounds.
Tip 3 : If you are going to tell about your projects, make sure to you know what you have done and if done in a team what you have contributed individually.
Tip 4 : During round 3 or HR interviews make sure to highlight your soft skills like communication and leadership by relating to real life project if possible.
Tip 1 : Have at least two projects in you resume and mention what you achieved.
Tip 2 : Write about your role and responsibilities if mentioning any internships.
Tip 3 : Also mention extra curriculars if any to highlight soft skills.
Josh Technology Group interview questions for popular designations
I applied via campus placement at Noida Institute of Engineering & Technology, Greater Noida and was interviewed before Jun 2021. There were 4 interview rounds.
High level of aptitute which will check ones ability to think in a pressureful env.
Coding round will be the toughest round as coding questions should be 100% correct for selection towards the next round.
Coding contains all the questions related to DSA, Algorithm, linkedlist trees arrays, DP ques. etc.
Get interview-ready with Top Josh Technology Group Interview Questions
I applied via Campus Placement and was interviewed in Jul 2021. There were 5 interview rounds.
I was interviewed in Jan 2021.
Round duration - 75 minutes
Round difficulty - Medium
It was a coding round.
Your task is to multiply two numbers represented as linked lists and return the resultant multiplied linked list.
The multiplied list should be a lin...
Given a binary tree, determine the length of its diameter. The diameter is defined as the longest path between any two end nodes in the tree. The path's length is re...
Round duration - 70 mintues
Round difficulty - Medium
It was an online coding round.
Your task is to find the sum list of two numbers represented by linked lists and return the head of the sum list.
The sum list should be a linked...
Imagine you are Harshad Mehta's friend, and you have been given the stock prices of a particular company for the next 'N' days. You can perform up to two buy-and-sell ...
Determine if the given binary tree is height-balanced. A tree is considered height-balanced when:
Round duration - 90 minutes
Round difficulty - Medium
In this round, three questions were asked and all of them were based on DSA.
You are given an arbitrary binary tree consisting of N nodes, each associated with an integer value from 1 to 9. Each root-to-leaf path can be considered a number formed by concat...
Given an array of integers, determine the maximum sum of a subsequence without choosing adjacent elements in the original array.
The first line consists of an...
Given a singly linked list in the form 'L1' -> 'L2' -> 'L3' -> ... 'Ln', your task is to rearrange the nodes to the form 'L1' -> 'Ln' -> 'L2' -> '...
Round duration - 120 minutes
Round difficulty - Medium
In this round, three questions were asked and all of them were based on DSA and a little bit about projects.
Bob and his wife are in the famous 'Arcade' mall in the city of Berland. This mall has a unique way of moving between shops using trampolines. Each shop is laid out in a st...
Given an integer N
, find all possible placements of N
queens on an N x N
chessboard such that no two queens threaten each other.
A queen can attack another queen if they ar...
Transform a binary tree with integer values into a linked list by ensuring the linked list's nodes follow the pre-order traversal order of the binary tree.
Round duration - 20 mintues
Round difficulty - Easy
It was on the next day of the last technical round, I was on the same site as the technical interview round.
Tip 1 : Be strong at your basics.
Tip 2 : Brush up fundamental concepts deeply
Tip 3 : Do at least 2 projects and ask to find answers like why are you choosing this tech stack? why did not you choose its alternatives Know your project in and out because they might ask you for a modification in your project?
Tip 1 : Have some projects on your resume.
Tip 2 : Do not put false things on your resume.
Tip 3 : Try to keep a single-page resume.
I was interviewed in Feb 2021.
Round duration - 60 minutes
Round difficulty - Medium
Timing was late. Environment was good.
Given an undirected graph with ‘V’ vertices (labeled 0, 1, ... , V-1) and ‘E’ edges, where each edge has a weight representing the distance between two connected nodes (X,...
The idea is to maintain two arrays, one stores the visited nodes, and the other array stores the distance (element at index ‘i’ denotes the distance from node 0 to node ‘i’). We pick an unvisited minimum distance vertex, then update the distance of all its adjacent vertices considering the path from source to an adjacent vertex to pass through the picked minimum distance vertex. Repeat the process...
Given a N x M matrix of integers, print the spiral order of the matrix.
The input starts with an integer 'T' representing the number of test cases. Each test ...
For each boundary, we will use the 4 loops. Now the problem is reduced to print the remaining submatrix which is handled with the help of recursion. Keep track of new dimensions(rows and columns) of the current submatrix which are passed with the help of parameters in each recursion call.
Algorithm:
spiralPrint(matrix[][], startingRow, startingCol, endingRow, endingCol):
A thief is planning to rob a store and can carry a maximum weight of 'W' in his knapsack. The store contains 'N' items where the ith item has a weight of 'wi' and a value of...
Approach: In the Dynamic programming we will work considering the same cases as mentioned in the recursive approach. In a DP[][] table let’s consider all the possible weights from ‘1’ to ‘W’ as the columns and weights that can be kept as the rows.
The state DP[i][j] will denote maximum value of ‘j-weight’ considering all values from ‘1 to ith’. So if we consider ‘wi’ (weight in ‘ith’ row) we can...
Tip 1 : Practice Data Structures and algorithms.
Tip 2 : Do 2 projects.
Tip 3 : Practice mcq too.
Tip 1 : Do not put false things on resume.
Tip 2 : Keep it short.
I was interviewed in Feb 2021.
Round duration - 60 minutes
Round difficulty - Medium
Timing was late. Environment was good.
You are given an undirected graph with V
vertices (numbered from 0 to V-1) and E
edges. Each edge connects two nodes u
and v
and has an associated weight represe...
Given a two-dimensional matrix of integers, print the matrix in a spiral order.
The first line contains an integer 't' indicating the number of test cases. For eac...
A thief is planning to rob a store and can carry a maximum weight of 'W' in his knapsack. The store contains 'N' items where the ith item has a weight of 'wi' and a value of...
Tip 1 : Practice Data Structures and algorithms.
Tip 2 : Do 2 projects.
Tip 3 : Practice mcq too.
Tip 1 : Do not put false things on resume.
Tip 2 : Keep it short.
I applied via Referral and was interviewed before Jun 2022. There were 4 interview rounds.
Duration 1 hour
Data structure and algorithms
Duration 1.5 hour
Data structure and algorithms
Use a binary tree traversal algorithm to find the next sibling on the right side of a given value.
Implement an in-order traversal algorithm to traverse the binary tree
Keep track of the parent node and the direction of traversal to find the next sibling on the right side
If the given value is the right child of its parent, move up the tree until finding a node that is the left child of its parent
Top trending discussions
The duration of Josh Technology Group interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 50 interviews
Interview experience
based on 75 reviews
Rating in categories
2-5 Yrs
Not Disclosed
3-6 Yrs
Not Disclosed
3-5 Yrs
Not Disclosed
Software Developer
98
salaries
| ₹6.8 L/yr - ₹19.5 L/yr |
Front end Developer
50
salaries
| ₹6.3 L/yr - ₹16.2 L/yr |
Senior Software Developer
41
salaries
| ₹8.2 L/yr - ₹24 L/yr |
Software Quality Analyst
24
salaries
| ₹4.2 L/yr - ₹7.5 L/yr |
Software Engineer
20
salaries
| ₹6 L/yr - ₹15 L/yr |
TCS
Infosys
Wipro
HCLTech