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[...
Rearrange array elements in a zig-zag manner where every odd index element is greater than its neighbors.
Iterate through the array and swap elements at odd indices to satisfy the zig-zag condition.
Ensure that the swapped elements are greater than their neighbors.
Multiple correct zig-zag rearrangements may exist for a given array.
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 ...
Calculate the total sum of all possible root-to-leaf paths in a binary tree.
Traverse the tree from root to leaf nodes, keeping track of the current path sum.
Add the path sum to the total sum when reaching a leaf node.
Use recursion to explore all possible paths in the tree.
Return the total sum modulo (10^9 + 7) as the final result.
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 ...
Reverse a linked list in groups of size K.
Iterate through the linked list in groups of size K.
Reverse each group of nodes.
Handle cases where the number of elements in the last group is less than K.
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...
Find all nodes at a specified distance K from a given node in a binary tree.
Traverse the binary tree to find the target node.
Use depth-first search to explore nodes at distance K from the target node.
Keep track of the distance from the target node while traversing.
Return a list of node values at distance K from the target node.
Handle cases where no nodes are found at the specified distance.
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...
Find the node where two linked lists merge.
Traverse both lists to find their lengths and the difference in lengths
Move the pointer of the longer list by the difference
Move both pointers simultaneously until they meet at the merging node
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...
Find the most frequent word in a paragraph that is not in a list of banned words.
Split the paragraph into words and convert them to uppercase for case-insensitivity.
Count the frequency of each word, excluding banned words.
Return the word with the highest frequency in uppercase.
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.
Generate all possible combinations of balanced parentheses for a given number of pairs.
Use recursion to generate all possible combinations of balanced parentheses.
Keep track of the number of open and close parentheses used in each combination.
Return the valid combinations as an array of strings.
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.
Remove duplicates from an array of integers while maintaining order.
Iterate through the array and add elements to a new array if they are not already present
Use a hash set to keep track of unique elements
Return the new array with unique elements in the same order as the original array
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.
Merge K sorted arrays into a single sorted array.
Create a min heap to store the first element of each array along with the array index.
Pop the top element from the heap, add it to the result array, and push the next element from the same array back to the heap.
Repeat the process until all elements are processed.
Time complexity: O(N log K) where N is the total number of elements and K is the number of arrays.
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,...
Reverse a linked list in groups of size K
Iterate through the linked list in groups of size K
Reverse each group of nodes
Handle cases where the last group has fewer nodes than K
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...
Merge two binary trees by summing overlapping nodes and retaining non-null nodes.
Traverse both trees simultaneously in preorder fashion
If both nodes are not null, sum their values for the new node
If one node is null, use the non-null node as the new node
Recursively merge the left and right subtrees
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...
Maximize vaccines administered on a specific day while following certain rules.
Distribute vaccines evenly over the given number of days.
Ensure the difference in vaccines administered between consecutive days is at most 1.
Maximize the number of vaccines administered on the specified day.
Keep track of the total number of vaccines administered to not exceed the maximum limit.
Implement a function to calculate the maximum n...
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 ...
Find nodes at distance K from a given node in a binary tree.
Perform a depth-first search starting from the target node to find nodes at distance K.
Use a recursive function to traverse the tree and keep track of the distance from the target node.
Maintain a set to store visited nodes and avoid revisiting them.
Return the list of nodes found at distance K from the target node.
Example: If the target node is 5 and K is 2, th
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 (...
The task is to maximize the total sweetness of the part that Ninja will get by dividing chocolates into K + 1 parts.
Iterate through the array of sweetness values to find the maximum sweetness value.
Use binary search to find the maximum sweetness that Ninja can obtain by making cuts.
Consider the constraints while implementing the solution.
Handle multiple test cases efficiently.
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 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...
Multiply two numbers represented as linked lists and return the resultant multiplied linked list.
Create a function that takes two linked lists as input and returns the product as a linked list
Traverse both linked lists to extract the numbers, multiply them, and create a new linked list for the product
Handle carry over while multiplying digits and adding to the result linked list
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...
The diameter of a binary tree is the longest path between any two end nodes in the tree.
Traverse the tree to find the longest path between two leaf nodes.
Use depth-first search (DFS) to calculate the height of each subtree.
The diameter of the tree is the maximum of the sum of heights of left and right subtrees + 1.
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...
Add two numbers represented by linked lists and return the head of the sum list.
Traverse both linked lists simultaneously while keeping track of carry from previous sum
Create a new linked list to store the sum of the two numbers
Handle cases where one linked list is longer than the other by padding with zeros
Update the sum and carry values accordingly while iterating through the linked lists
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 ...
The task is to determine the maximum profit that can be achieved by performing up to two buy-and-sell transactions on a given set of stock prices.
Iterate through the array of stock prices to find the maximum profit that can be achieved by buying and selling stocks.
Keep track of the maximum profit after the first transaction and the maximum profit overall.
Consider all possible combinations of buying and selling stocks t...
Determine if the given binary tree is height-balanced. A tree is considered height-balanced when:
Check if a binary tree is height-balanced by ensuring left and right subtrees are balanced with a height difference of at most 1.
Check if the left and right subtrees are balanced recursively.
Calculate the height of each subtree and compare their heights.
Return 'True' if the tree is height-balanced, 'False' otherwise.
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 a binary tree with node values, find the total sum of all root to leaf paths formed by concatenating node values.
Traverse the tree in a depth-first manner, keeping track of the current path sum and updating it as you go along.
When reaching a leaf node, add the current path sum to the total sum.
Return the total sum modulo (10^9 + 7) as the final result.
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...
Find the maximum sum of a subsequence without choosing adjacent elements in an array.
Use dynamic programming to keep track of the maximum sum at each index, considering whether to include the current element or not.
At each index, the maximum sum can be either the sum of the current element and the element two positions back, or the sum at the previous index.
Iterate through the array and update the maximum sum at each i...
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' -> '...
Rearrange the nodes of a singly linked list in a specific order without altering the data of the nodes.
Use two pointers to split the linked list into two halves, reverse the second half, and then merge the two halves alternately.
Ensure to handle cases where the number of nodes is odd or even separately.
Keep track of the head and tail of each half to properly rearrange the nodes.
Ensure to update the next pointers of the...
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...
Find the minimum number of trampoline jumps Bob needs to make to reach the final shop, or return -1 if impossible.
Use BFS to traverse through the shops and keep track of the minimum jumps needed to reach each shop.
If a shop has already been visited with fewer jumps, skip it.
If a shop has Arr[i] = 0, it is impossible to reach the last shop.
Return the minimum jumps to reach the last shop or -1 if impossible.
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...
Find all possible placements of N queens on an N x N chessboard such that no two queens threaten each other.
Use backtracking algorithm to explore all possible configurations
Keep track of rows, columns, and diagonals to ensure queens do not threaten each other
Recursively place queens on the board and backtrack when a conflict is found
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.
Flatten a binary tree into a linked list following pre-order traversal order.
Use the binary tree's right pointer as the linked list's 'next' pointer.
Set each node's left pointer to NULL.
Implement the solution without printing within the function.
Follow pre-order traversal to flatten the binary tree into a linked list.
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,...
Dijkstra's algorithm is used to find the shortest path from a source node to all other nodes in a graph with weighted edges.
Implement Dijkstra's algorithm to find the shortest path distances from the source node to all other nodes.
Use a priority queue to efficiently select the next node with the shortest distance.
Initialize distances to all nodes as infinity except for the source node which is 0.
Update distances to nei...
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 ...
The problem involves printing the spiral order of a given matrix of integers.
Iterate through the matrix in a spiral order by keeping track of the boundaries.
Print the elements in the order: top row, right column, bottom row, left column.
Continue this process until all elements are printed in spiral order.
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...
Yes, the 0/1 Knapsack problem can be solved using a space complexity of not more than O(W) using dynamic programming.
Use a 2D array to store the maximum value that can be stolen for each weight capacity up to W and each item up to N.
Iterate through each item and weight capacity, updating the maximum value that can be stolen based on whether the item is included or not.
The final answer will be stored in the bottom-right...
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...
Dijkstra's algorithm is used to find the shortest path distance from a source node to all vertices in an undirected graph.
Implement Dijkstra's algorithm to calculate shortest path distances
Use a priority queue to efficiently select the next node to visit
Initialize distances to all nodes as infinity, except for the source node as 0
Update distances based on the weights of edges and choose the shortest path
Handle disconne...
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...
Print a two-dimensional matrix in spiral order.
Iterate through the matrix in a spiral order by keeping track of the boundaries.
Print elements in the order: top row, right column, bottom row, left column.
Repeat the process for inner submatrices until all elements are printed.
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...
Yes, the 0/1 Knapsack problem can be solved using a space complexity of not more than O(W) using dynamic programming.
Use a 1D array to store the maximum value that can be stolen for each weight from 0 to W.
Iterate through the items and update the array based on the current item's weight and value.
The final value in the array will be the maximum value that can be stolen within the weight capacity of the knapsack.
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
| ₹0 L/yr - ₹0 L/yr |
Front end Developer
50
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Developer
41
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Quality Analyst
24
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
20
salaries
| ₹0 L/yr - ₹0 L/yr |
TCS
Infosys
Wipro
HCLTech