AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
Filter interviews by
Josh Technology Group Software Developer Intern Interview Questions, Process, and Tips
Top Josh Technology Group Software Developer Intern Interview Questions and Answers
- Q1. Multiply Linked Lists Problem Statement Your task is to multiply two numbers represented as linked lists and return the resultant multiplied linked list. Explanation: Th ...read more
- Q2. Longest Alternating Subsequence Problem Given an array ARR of integers, determine the length of the longest alternating subsequence. Input: ARR = {Array elements} Output ...read more
- Q3. Buy and Sell Stock Problem Statement 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 ...read more
Josh Technology Group Software Developer Intern Interview Experiences
9 interviews found
I applied via campus placement at Lovely Professional University (LPU) and was interviewed in Sep 2023. There were 4 interview rounds.
It was aptitude + oops concpets mcqs
This round had 3 dsa questions (tree, linked list, array) and 1 output based answer(bst)
This was another coding round of higher difficulty (linked list, tree)
Interview Preparation Tips
I applied via Campus Placement and was interviewed in Apr 2023. There were 2 interview rounds.
Aptitude test consisted of around 45 MCQs from basic topics like C, C++, OOPS
2nd round had 3 medium level (Leetcode) questions and 1 output question: 1. Level order traversal, 2. count zeros(not sure), 3. Linked List traversal related.
Interview Preparation Tips
I was interviewed in Aug 2021.
(2 Questions)
Round duration - 75 minutes
Round difficulty - Medium
Round held at 12 noon. There were 2 interviewers
- Q1.
Zig-Zag Array Rearrangement
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 elementARR[... - Q2.
Sum Root to Leaf Path Problem
You are given an arbitrary binary tree consisting of
Nnodes where each node is associated with an integer value from 1 to 9. Each root-to-leaf path in the tree represents a ...
(2 Questions)
Round duration - 120 minutes
Round difficulty - Easy
Round held at 4pm. There were 2 interviewers
- Q1.
Reverse Linked List in Groups of K
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 ...
- Q2.
Nodes at Distance K from a Given Node
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...
Interview Preparation Tips
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
Skills evaluated in this interview
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.
(1 Question)
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.
- Q1.
Reverse Linked List in K-Groups
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,...
(2 Questions)
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.
- Q1.
Merge Two Binary Trees Problem Statement
You are given the roots of two binary trees,
root1androot2. Merge these two trees into a new binary tree. If two nodes overlap, sum the node values as the new no... - Q2.
Covid Vaccination Distribution Problem
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...
(2 Questions)
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.
- Q1.
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 ...
- Q2.
Divide Chocolates Problem Statement
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 intoK + 1parts (...
Round duration - 25 Minutes
Round difficulty - Easy
Interview Preparation Tips
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.
Skills evaluated in this interview
Josh Technology Group interview questions for designations
I was interviewed in Jan 2021.
(2 Questions)
Round duration - 75 minutes
Round difficulty - Medium
It was a coding round.
- Q1.
Multiply Linked Lists Problem Statement
Your task is to multiply two numbers represented as linked lists and return the resultant multiplied linked list.
Explanation:
The multiplied list should be a lin...
- Q2.
Binary Tree Diameter Problem Statement
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...
(3 Questions)
Round duration - 70 mintues
Round difficulty - Medium
It was an online coding round.
- Q1.
Add Two Numbers Represented by Linked Lists
Your task is to find the sum list of two numbers represented by linked lists and return the head of the sum list.
Explanation:
The sum list should be a linked...
- Q2.
Buy and Sell Stock Problem Statement
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 ...
- Q3.
Is Height Balanced Binary Tree Problem Statement
Determine if the given binary tree is height-balanced. A tree is considered height-balanced when:
- The left subtree is balanced.
- The right subtree is bala...
(3 Questions)
Round duration - 90 minutes
Round difficulty - Medium
In this round, three questions were asked and all of them were based on DSA.
- Q1.
Sum Root to Leaf Numbers
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...
- Q2.
Maximum Non-Adjacent Subsequence Sum
Given an array of integers, determine the maximum sum of a subsequence without choosing adjacent elements in the original array.
Input:
The first line consists of an...
- Q3.
Rearrange Linked List Problem Statement
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' -> '...
(3 Questions)
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.
- Q1.
Minimum Jumps Problem Statement
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...
- Q2.
N Queens Problem
Given an integer
N, find all possible placements ofNqueens on anN x Nchessboard such that no two queens threaten each other.Explanation:
A queen can attack another queen if they ar...
- Q3.
Flatten Binary Tree to Linked List
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.
Explanation:
...
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.
Interview Preparation Tips
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.
Skills evaluated in this interview
Get interview-ready with Top Josh Technology Group Interview Questions
I was interviewed in Feb 2021.
(3 Questions)
Round duration - 60 minutes
Round difficulty - Medium
Timing was late. Environment was good.
- Q1.
Dijkstra's Shortest Path Problem
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,...
- Ans. Using Adjacency Matrix
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...
- Q2.
Spiral Matrix Path Problem Statement
Given a N x M matrix of integers, print the spiral order of the matrix.
Input:
The input starts with an integer 'T' representing the number of test cases. Each test ...
- Ans. Recursive
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):
- Check for base cases, i.e. if ...
- Q3.
0/1 Knapsack Problem Statement
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...
- Ans. Dynamic Programming
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...
Interview Preparation Tips
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.
Skills evaluated in this interview
I was interviewed in Feb 2021.
(3 Questions)
Round duration - 60 minutes
Round difficulty - Medium
Timing was late. Environment was good.
- Q1.
Dijkstra's Shortest Path Problem Statement
You are given an undirected graph with
Vvertices (numbered from 0 to V-1) andEedges. Each edge connects two nodesuandvand has an associated weight represe... - Q2.
Spiral Matrix Problem Statement
Given a two-dimensional matrix of integers, print the matrix in a spiral order.
Input:
The first line contains an integer 't' indicating the number of test cases. For eac... - Q3.
0/1 Knapsack Problem Statement
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...
Interview Preparation Tips
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.
Skills evaluated in this interview
I was interviewed in Oct 2020.
(12 Questions)
- Q1.
Multiply Linked Lists Problem Statement
Your task is to multiply two numbers represented as linked lists and return the resultant multiplied linked list.
Explanation:
The multiplied list should be a lin...
- Q2.
Longest Alternating Subsequence Problem
Given an array
ARRof integers, determine the length of the longest alternating subsequence.Input:
ARR = {Array elements}Output:
Length of the longest alterna... - Q3.
Rotate Matrix K Times Problem Statement
Given a matrix, rotate its elements clockwise by 90 degrees, K times.
Each rotation by 90 degrees counts as one.
Input:
Line 1: Two integers M and N, denoting th... - Q4.
Add Two Numbers Represented by Linked Lists
Your task is to find the sum list of two numbers represented by linked lists and return the head of the sum list.
Explanation:
The sum list should be a linked...
- Q5.
Buy and Sell Stock Problem Statement
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 ...
- Q6.
Is Height Balanced Binary Tree Problem Statement
Determine if the given binary tree is height-balanced. A tree is considered height-balanced when:
- The left subtree is balanced.
- The right subtree is bala...
- Q7.
Sum Root to Leaf Numbers
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...
- Q8.
Remove BST Keys Outside Given Range
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...
- Q9.
Maximum Non-Adjacent Subsequence Sum
Given an array of integers, determine the maximum sum of a subsequence without choosing adjacent elements in the original array.
Input:
The first line consists of an...
- Q10.
Minimum Jumps Problem Statement
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...
- Q11.
N Queens Problem
Given an integer
N, find all possible placements ofNqueens on anN x Nchessboard such that no two queens threaten each other.Explanation:
A queen can attack another queen if they a...
- Q12.
Closest Leaf in a Binary Tree
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...
Interview Preparation Tips
Josh Technology Group interview Rounds:Round 1
Round type - Online Coding Interview
Round duration - 50 minutes
Round difficulty - Medium
Round description -
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.
Round 2
Round type - Online Coding Test
Round duration - 75 minutes
Round difficulty - Medium
Round description -
It was a online coding round.
Round 3
Round type - Online Coding Test
Round duration - 70 mintues
Round difficulty - Medium
Round description -
It was an online coding round.
Round 4
Round type - Video Call
Round duration - 90 minutes
Round difficulty - Medium
Round description -
In this round, three questions were asked and all of them were based on DSA.
Round 5
Round type - Video Call
Round duration - 120 minutes
Round difficulty - Medium
Round description -
In this round, three questions were asked and all of them were based on DSA and a little bit about projects.
Round 6
Round type - HR Round
Round duration - 25 mintues
Round difficulty - Easy
Round description -
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.
Skills evaluated in this interview
I was interviewed before Sep 2020.
(1 Question)
Round duration - 45 minutes
Round difficulty - Medium
Online coding round.
We could only write pseudo code and couldn't test against test cases.
- Q1.
Binary Tree Level Order Traversal
You are given a binary tree of integers. Your task is to return the level order traversal of the given tree.
Input:
The first line contains an integer 'T', representing... - Ans.
Again i had already done this question in the course itself so it was a cake walk for me.
Solution:
Step 1: Create an empty queue which accepts BinaryTreeNode.
Step 2: Put root of the binary tree in the queue.
Step 3: Loop while queue is not empty
3a. store the current size of the queue which will help us know how many nodes are there which needs to be printed at one level.
3b. Dequeue the first node from the queue.
3c. Print...
(2 Questions)
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.
- Q1.
Kth Ancestor in a Binary Tree
You are given an arbitrary binary tree consisting of
Nnodes numbered from 1 toN, an integerK, and a nodeTARGET_NODE_VALfrom the tree. Your task is to find the Kth ancest... - Ans.
I solved this question recursively.
Step 1: Find the given node in the tree.
Step 2: If node not found then simply return null, else check if K is greater than 0, if yes that means we haven't found the Kth ancestor, so we decrement the value of K.
Also we check if K value is 0 then we have found Kth ancestor, and we print it and return null and with base case if root == null, we return. - Q2.
Equilibrium Indices in a Sequence
You are given an array/list named 'SEQUENCE', which consists of 'N' integers. The task is to identify all equilibrium indices in this sequence.
Explanation:
An equilibr...
- Ans. Brute Force Approach
For an index to be at equilibrium we need to calculate the sum of all the elements present at indices lower than the index and the sum of all the elements present at indices higher than the index. If both the sums match then we can add that index to the sequence of equilibrium indices. Hence, for a given sequence we can iterate through each of the indexes and store it as ‘currentIndex’.
N...
(1 Question)
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.
- Q1.
Reverse Linked List Problem Statement
Given a singly linked list of integers, return the head of the reversed linked list.
Example:
Initial linked list: 1 -> 2 -> 3 -> 4 -> NULL
Reversed link... - Ans. Brute Force
The brute force approach is to use recursion. First, we reach the end of the Linked List recursively and at last node, we return the last node, which becomes the new head of the partially reversed Linked List. While coming back from each recursion call we add the current node in the current recursion call to the last node of the partially reversed Linked List and assign the current node to null.
Steps:
&...
(2 Questions)
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.
- Q1.
Replace with Sum of Greater Nodes Problem Statement
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...
- Ans.
Step 1: I made a helper function where i passed the root node and 0 which worked as the sum in it.
Step 2: Made a base case, if root is null, return.
Step 3: Went to the rightmost node of the tree as the rightmost node is the only node which will have highest value in whole BST.
Step 4: Added the root's data to the sum variable which was passed in the helper function.
Step 5: After adding the root's sum with the sum variab... - Q2.
Nuts and Bolts Problem
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...
- Ans.
Solution 1: I tried solving this problem with brute force way first, starting with the first bolt and compare it with each nut until we find a match. In the worst case we require n comparisons. Doing this for all bolts gives O(n^2) complexity. hence i was asked to optimize it further,
Solution 2:I tried using the hashmap and came up to the solution as well.
Step 1: Traverse the nuts array and create a hashmap
Step 2: Trav...
Interview Preparation Tips
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.
Skills evaluated in this interview
Top trending discussions
Interview questions from similar companies
Software Developer Intern Interview Questions & Answers
Junglee Games
Anonymous
posted on 15 Oct 2024
I applied via campus placement at KIIT University, Bhuvaneshwar and was interviewed in Apr 2024. There were 3 interview rounds.
Medium level coding questions on hackerrank ,1:30hr, topic- Array , DP , Matrix , Binary Search
(1 Question)
- Q1. Was Asked to Implement Hashmap and Question on OOPS and Dbms , SQL and Indexing
(2 Questions)
- Q1. Brief Introduction
- Q2. Rotten Oranges and basics of bfs and DFS
Josh Technology Group Interview FAQs
Tell us how to improve this page.
Josh Technology Group Interviews By Designations
- Josh Technology Group Software Developer Interview Questions
- Josh Technology Group Front end Developer Interview Questions
- Josh Technology Group Software Developer Intern Interview Questions
- Josh Technology Group Software Engineer Interview Questions
- Josh Technology Group Frontend Developer Intern Interview Questions
- Josh Technology Group Full Stack Developer Interview Questions
- Josh Technology Group Software Development Engineer Intern Interview Questions
- Josh Technology Group Web Developer Interview Questions
- Show more
Interview Questions for Popular Designations
- Software Engineer Interview Questions
- Senior Software Engineer Interview Questions
- Associate Software Engineer Interview Questions
- Softwaretest Engineer Interview Questions
- Software Engineer Trainee Interview Questions
- Software Developer Interview Questions
- Software Development Engineer Interview Questions
- Junior Software Developer Interview Questions
- Show more
Josh Technology Group Software Developer Intern Interview Process
based on 2 interviews
1 Interview rounds
- Coding Test Round
Top Skills for Josh Technology Group Software Developer Intern
Software Developer Intern Interview Questions from Similar Companies
Fast track your campus placements
Josh Technology Group Software Developer Intern Reviews and Ratings
based on 4 reviews
Rating in categories
|
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
- Home >
- Interviews >
- Josh Technology Group Interview Questions >
- Josh Technology Group Software Developer Intern Interview Questions
