Filter interviews by
I was interviewed in Oct 2020.
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 an array ARR
of integers, determine the length of the longest alternating subsequence.
ARR = {Array elements}
Length of the longest alterna...
Given a matrix, rotate its elements clockwise by 90 degrees, K times.
Each rotation by 90 degrees counts as one.
Line 1: Two integers M and N, denoting th...
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:
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 Search Tree (BST) and a specified range [min, max], your task is to remove all keys from the BST that fall outside this range. The BST should remain vali...
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...
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 s...
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 a...
Ninja is stuck in a maze represented as a binary tree, and he is at a specific node ‘X’. Help Ninja find the shortest path to the nearest leaf node, which is considered an e...
There were around 50 MCQ's on C/C++/DSA.
There were no negative marking though.
There were option to go back also and you can check which question you answered or not.
It was a online coding round.
It was an online coding round.
In this round, three questions were asked and all of them were based on DSA.
In this round, three questions were asked and all of them were based on DSA and a little bit about projects.
It was on the same day of the last technical round, I was on the same site as the technical interview round, and it is about myself and basic information.
Josh Technology Group interview preparation:Topics to prepare for the interview - DSA, Project, Development, Programming Languages, OOPSTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekersTip 1 : Be strong at your basics.
Tip 2 : 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 before Sep 2020.
Round duration - 60 mins
Round difficulty - Medium
Given a railway seat number represented as an integer, determine if it is a valid seat number and identify its berth type. Possible berth types include lower berth, middle...
Given a railway seat number, determine if it is valid and identify its berth type.
Parse input integer 't' for number of test cases
For each test case, check if seat number is valid (1 <= N <= 100)
Identify berth type based on seat number and output the result
Possible berth types are Lower, Middle, Upper, Side Lower, and Side Upper
Round duration - 90 mins
Round difficulty - Hard
First they asked me to introduce myself then they started questioning on oops concept from basic to advance level such as inheritance, polymorphism, abstraction, exception handling , STL etc. Next they started questioning on data structures. They asked me the logic of “how to find the middle of a linked list”.
You are provided with a square matrix. Your task is to return true
if the matrix is symmetric; otherwise, return false
.
A symmetric matrix is characterized by its transpose being eq...
Check if a square matrix is symmetric by comparing it with its transpose.
Iterate through the matrix and compare each element with its corresponding element in the transpose
If any pair of elements do not match, return false immediately
If all pairs match, return true at the end
Tip 1 : Clear the basic concepts of data structure and OOPs.
Tip 2 : Use coding ninja platform and Hackerearth for practice on coding skills.
Tip 3 : Use Geeks For Geeks for interview preparation.
Tip 1: Make your resume short and try to make it of one page only.
Tip 2: Add relevant keywords
I applied via Naukri.com and was interviewed in May 2021. There were 3 interview rounds.
I applied via Company Website and was interviewed before Mar 2022. There were 3 interview rounds.
An online open assisment is given and it has around 50 MCQs that need to be done in 50 mins
An assignmnet is given that need to be done in 7 days
Josh Technology Group interview questions for popular designations
I applied via Naukri.com and was interviewed in Oct 2020. There were 4 interview rounds.
Regression test cases ensure that changes to the application do not negatively impact existing functionality.
Identify critical functionalities and test cases that cover them
Test for compatibility with different browsers and devices
Test for data integrity and consistency
Test for performance and scalability
Test for security vulnerabilities
Test for user experience and accessibility
Get interview-ready with Top Josh Technology Group Interview Questions
I was interviewed before Sep 2020.
Round duration - 45 minutes
Round difficulty - Medium
Online coding round.
We could only write pseudo code and couldn't test against test cases.
You are given a binary tree of integers. Your task is to return the level order traversal of the given tree.
The first line contains an integer 'T', representing...
Return the level order traversal of a binary tree given in level order.
Use a queue to perform level order traversal of the binary tree
Start by pushing the root node into the queue
While the queue is not empty, dequeue a node, print its value, and enqueue its children
Round duration - 50 minutes
Round difficulty - Easy
It was onsite face to face technical round where i was asked 2 coding questions.
It lasted for 40-50 minutes.
You are given an arbitrary binary tree consisting of N
nodes numbered from 1 to N
, an integer K
, and a node TARGET_NODE_VAL
from the tree. Your task is to find the Kth ancest...
Find the Kth ancestor of a given node in a binary tree.
Traverse the tree to find the path from the target node to the root node.
Store the path in a list and return the Kth element from the end.
Handle cases where the Kth ancestor does not exist by returning -1.
You are given an array/list named 'SEQUENCE', which consists of 'N' integers. The task is to identify all equilibrium indices in this sequence.
An equilibr...
Identify equilibrium indices in a given sequence by finding positions where sum of elements before and after is equal.
Iterate through the sequence and calculate prefix sum and suffix sum at each index
Compare prefix sum and suffix sum to find equilibrium indices
Handle edge cases where no equilibrium index exists
Return the indices as a sequence of integers or an empty sequence
Round duration - 50 minutes
Round difficulty - Medium
Only 7 students were shortlisted after the first face to face round out of 40 students.
The interviewer seemed cool and was trying to calm down me as i was getting nervous.
Again there were 2 coding questions.
Given a singly linked list of integers, return the head of the reversed linked list.
Initial linked list: 1 -> 2 -> 3 -> 4 -> NULL
Reversed link...
Reverse a singly linked list of integers and return the head of the reversed linked list.
Iterate through the linked list and reverse the pointers to reverse the list
Use three pointers to keep track of current, previous, and next nodes
Update the head of the reversed linked list once the reversal is complete
Round duration - 90 minutes
Round difficulty - Medium
This was the last technical round and there were only 5 students left at the end of day.
The interview started at around 6:30 in the evening.
Convert a given binary search tree (BST) with 'N' nodes into a Greater Tree. In the Greater Tree, each node's data should be updated to the sum of its o...
Convert a binary search tree into a Greater Tree by updating each node's data to the sum of its original data plus the data of all nodes with greater or equal values.
Traverse the BST in reverse inorder (right, root, left) to update nodes with the sum of greater nodes.
Keep track of the sum of greater nodes encountered so far while traversing.
Update each node's data with the sum of greater nodes and continue traversal.
You are given a collection of 'N' nuts and 'N' bolts, each having unique sizes. Your objective is to match each nut with its corresponding bolt based on size, adhering to a one-to-o...
Matching nuts and bolts based on size in a one-to-one mapping strategy.
Iterate through the nuts and bolts arrays to find matching pairs based on size.
Use sorting algorithms like quicksort to efficiently match nuts and bolts.
Ensure the implementation modifies the input arrays directly to reflect the proper matched order.
Tip 1 : Take your time before directly jumping onto the solution even if you have done the code already, it might be possible that interviewer would add any constraints of his own choice.
Tip 2 : Speak out loud, that's very important. If you are stuck onto something in between the interview, don't just sit idle or give up. Talk to your interviewer, let him/her know what's going in your mind, what approach are you trying to implement. The interviewer is your only friend in that room.
Tip 3 : Don't worry if you haven't been into Competitive Programming before, you can still crack a lot of companies with decent DSA skills, projects are add on.
Tip 4 : For preparation, go through coding ninja's course thoroughly. It's very likely to encounter same questions that are already in the course itself. Common problems like, stock span, balanced parentheses, edit distance-DP, etc.
Tip 5 : Don't panic on seeing a question that you haven't done before. Try to break the given problem into small problems first just like we do in DP, it will surely help you out in building logic if not solution.
Tip 1 : Take a nice template for resume, you can even refer sites like novoresume.com. It has got good templates, just pick any with no fancy fonts and colors. Keep it simple.
Tip 2 : Be very specific. Write out important stuff only if you applying for a tech job. No one's going to see your dance/acting skills while interviewing you.
Tip 3 : If you have mentioned your projects, make sure you add your source code's link/github repo link as hyperlink to it. That's very important, it helps interviewer know that you have done this project and you're not faking it.
I applied via Campus Placement and was interviewed before Jul 2020. There was 1 interview round.
Check if binary tree is balanced or not.
A balanced binary tree has the height of left and right subtrees differ by at most 1.
Recursively check the height of left and right subtrees and compare.
Use a helper function to calculate the height of a subtree.
Time complexity: O(nlogn) for a balanced tree, O(n^2) for a skewed tree.
Detect loops in a linked list.
Use two pointers, one moving at a faster pace than the other.
If there is a loop, the faster pointer will eventually catch up to the slower one.
To detect the start of the loop, reset one pointer to the head and move both pointers at the same pace.
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