Add office photos
Filter interviews by
Josh Technology Group Software Developer Interview Questions, Process, and Tips for Freshers
Top Josh Technology Group Software Developer Interview Questions and Answers for Freshers
- Q1. Validate Binary Tree Nodes You are given ‘N’ binary tree nodes numbered from 0 to N - 1 where node ‘i’ has two children LEFT_CHILD[i] and RIGHT_CODE[i]. Return ‘True’ if ...read more
- Q2. Balanced Binary Tree You are given an integer 'H'. Your task is to count and print the maximum number of balanced binary trees possible with height 'H'. The balanced bina ...read more
- Q3. Sort an array in wave form You have been given an unsorted array ‘ARR’. Your task is to sort the array in such a way that the array looks like a wave array. Example: If t ...read more
Josh Technology Group Software Developer Interview Experiences for Freshers
2 interviews found
CodingNinjas
I was interviewed in Sep 2021.
(1 Question)
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
You are given ‘N’ binary tree nodes numbered from 0 to N - 1 where node ‘i’ has two children LEFT_CHILD[i] and RIGHT_CODE[i]. Return ‘True’ if and only if all the given...
- 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
(1 Question)
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 Tree
You are given an integer 'H'. Your task is to count and print the maximum number of balanced binary trees possible with height 'H'.
The balanced binary tree is one in...
- 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...
(2 Questions)
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. Sort an array in wave form
You have been given an unsorted array ‘ARR’.
Your task is to sort the array in such a way that the array looks like a wave array.
Example:
If the given sequence ‘ARR’ has ‘N’... - 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
- Q2. Maximum Sum BST
You are given a Binary Tree ‘root’. The given Binary Tree may or may not be a Binary Search Tree(BST) itself. Your task is to find the maximum sum of node values of any subtree that is a Bi...
- 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
(2 Questions)
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.
You are given a Binary Search Tree (BST) and a target value ‘K’. Your task is to check if there exist two unique elements in the given BST such that their sum is equal to the given target ...
- 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...
- Q2. Print Nodes at Distance K From a Given Node
You are given an arbitrary binary tree, a node of the tree, and an integer 'K'. You need to find all such nodes which have a distance K from the given no...
- 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...
(1 Question)
Round duration - 20 minutes
Round difficulty - Easy
This was the simple 20 minutes round
- Q1. Basic HR Questions
In this interviewer asked me about my family, residence and if I will have any issue in relocating to Gurgaon. After 30 minutes of this round they send me mail regarding my selection.
- Ans.
The candidate was asked about their family, residence, and willingness to relocate to Gurgaon.
The interviewer wanted to know about the candidate's personal background and circumstances.
The candidate's response may have influenced their selection.
Examples of relevant information include family size, current residence location, and any potential challenges in relocating.
The candidate's answer should demonstrate their fle
Interview Preparation Tips
Tip 1 : Try to solve some good questions from every topic.
Tip 2 : If not have much time, then you can solve top interview questions from Leetcode.
Tip 3 : Made 2-3 good projects using any technology
Tip 1 : Keep resume short and crispy.
Tip 2 : Add coding profile handles and github link.
Skills evaluated in this interview
I was interviewed in Sep 2021.
(3 Questions)
Round duration - 180 min
Round difficulty - Hard
- Q1. Longest Common Subsequence
You have been given two Strings “STR1” and “STR2” of characters. Your task is to find the length of the longest common subsequence.
A String ‘a’ is a subsequence of a String ‘b...
- Ans.
In order to find out the complexity of brute force approach, we need to first know the number of possible different subsequences of a string with length n, i.e., find the number of subsequences with lengths ranging from 1,2,..n-1. Recall from theory of permutation and combination that number of combinations with 1 element are nC1. Number of combinations with 2 elements are nC2 and so forth and so on. We know that nC0 +...
- Q2. 0 1 Knapsack
A thief is robbing a store and can carry a maximal weight of W into his knapsack. There are N items and the ith item weighs wi and is of value vi. Considering the constraints of the maximum we...
- Ans.
In Fractional Knapsack, we can break items for maximizing the total value of knapsack. This problem in which we can break an item is also called the fractional knapsack problem.
A brute-force solution would be to try all possible subset with all different fraction but that will be too much time taking.
An efficient solution is to use the Greedy approach. The basic idea of the greedy approach is to calculate t... - Q3. K Largest Element
You are given an unsorted array containing ‘N’ integers. You need to find ‘K’ largest elements from the given array. Also, you need to return the elements in non-decreasing order.
Input...
- Ans.
1) Sort the elements in descending order in O(n*log(n))
2) Print the first k numbers of the sorted array O(k).
(3 Questions)
Round duration - 60 Minutes
Round difficulty - Medium
- Q1. Size of Largest BST in Binary Tree
You are given a binary tree with 'N' nodes. Your task is to return the size of the largest subtree of the binary tree which is also a BST.
A binary search tree ...
- Ans.
In method 1, we traverse the tree in top-down manner and do BST test for every node. If we traverse the tree in bottom-up manner, then we can pass information about subtrees to the parent. The passed information can be used by the parent to do BST test (for parent node) only in constant time (or O(1) time). A left subtree need to tell the parent whether it is BST or not and also needs to pass maximum value in it. So th...
- Q2. Matrix Chain Multiplication
You are given ‘N’ 2-D matrices and an array/list “ARR” of length ‘N + 1’ where the first ‘N’ integers denote the number of rows in the Matrices and the last element denotes the ...
- Ans. Recursive brute force
The idea is to use the recursion to try all the possible combinations of multiplying the matrices. After trying all the possible combinations we will take the minimum operations out of all the combinations.
For multiplying two matrices with dimensions (mXn) and (nXp), the number of operations required are m * n * p.
The steps are as follows :
- Define a function minOperations(i, j), he...
- Q3. Rotate Linked List
You have been given a Linked List having ‘N’ nodes and an integer ‘K’. You have to rotate the Linked List by ‘K’ positions in a clockwise direction.
Example :
Given Linked List : 1 2... - Ans.
To rotate a linked list by k, we can first make the linked list circular and then moving k-1 steps forward from head node, making (k-1)th node’s next to null and make kth node as head.
(2 Questions)
Round duration - 45 minutes
Round difficulty - Easy
- Q1. System Design Question
We have to code a todo alike app called PROJECT PLANNER with raw HTML, CSS & JS in 2:30-3:00 Hours, all the instructions related to UI Design+functionality and scoring criteria ab...
- Q2. Longest Palindromic Substring
You are given a string ('STR') of length 'N'. Find the longest palindromic substring. If there is more than one palindromic substring with the maximum length, ...
- Ans.
The time complexity can be reduced by storing results of sub-problems. The idea is similar to this post.
Maintain a boolean table[n][n] that is filled in bottom up manner.
The value of table[i][j] is true, if the substring is palindrome, otherwise false.
To calculate table[i][j], check the value of table[i+1][j-1], if the value is true and str[i] is same as str[j], then we make table[i][j] true.
Otherwise, the value ...
Interview Preparation Tips
Tip 1 : be thoroughly prepared with dsa
Tip 2 : focus on dbms.
Tip 3 : be prepared with skills mentioned in resume
Tip 1 : mention some good projects
Tip 2 : don't put false statement
Skills evaluated in this interview
Top trending discussions
Interview questions from similar companies
Software Developer Interview Questions & Answers
ConsultAdd
Siddharth Choudhary
posted on 17 Oct 2024
I applied via Walk-in
(2 Questions)
- Q1. How make a queue using a stack
- Ans.
To implement a queue using a stack, use two stacks and simulate the queue operations.
Use two stacks, one for enqueue operation and one for dequeue operation.
For enqueue operation, simply push elements onto the stack used for enqueueing.
For dequeue operation, if the dequeue stack is empty, pop all elements from enqueue stack and push onto dequeue stack.
Then pop from the dequeue stack to simulate dequeue operation.
- Q2. Create a linked list
- Ans.
A linked list is a data structure consisting of nodes where each node points to the next node in the sequence.
Create a Node class with data and next pointer
Initialize a head pointer to null
Add nodes by updating next pointers
Traverse the list by following next pointers
Skills evaluated in this interview
(1 Question)
- Q1. Print unique numbers in list
- Ans.
Print unique numbers in list
Iterate through the list and store each number in a set to keep track of unique numbers
Print out the numbers in the set to display the unique numbers
Skills evaluated in this interview
I applied via campus placement at Pimpri Chinchwad College of Engineering, Pimpri and was interviewed in Jul 2022. There were 5 interview rounds.
Basic Aptitude questions mainly on quantitative
Google docs was shared which has 5 coding questions mainly on array and string.
(4 Questions)
- Q1. Interviewer introduced himself , then told the flow of interview ie. 2 coding question will be asked then he asked to introduce myself
- Q2. Occurance of characters in string
- Ans.
The question is about finding the occurrence of characters in a string.
Iterate through the string and count the occurrence of each character.
Use a hash table to store the count of each character.
Consider the case sensitivity of the characters.
Handle special characters and spaces as required.
- Q3. Angle between hour and minute hand of clock at a given time
- Ans.
The angle between hour and minute hand of a clock at a given time.
Calculate the angle made by the hour hand with 12 o'clock
Calculate the angle made by the minute hand with 12 o'clock
Find the difference between the two angles
If the difference is greater than 180 degrees, subtract it from 360 degrees
The result is the angle between the hour and minute hand
- Q4. Both question I was able to solve quickly interview was sheduled for one hour but i solved questions in 23 minutes so interview ended. I was called for second techinal round
(4 Questions)
- Q1. Same format as above introduction and 2 coding questions
- Q2. 1 Integer to roman it took me some time to solve the question
- Q3. 2 given sum and we have to print all the subsequences in array with given sum
- Ans.
Printing all the subsequences in an array with a given sum.
Use recursion to generate all possible subsequences.
Check if the sum of each subsequence is equal to the given sum.
Print the subsequences that satisfy the condition.
Time complexity: O(2^n).
- Q4. The interview took almost 45 minutes and i was able to solve both questions so i was selected for third round ie technical + HR
(5 Questions)
- Q1. First introduction then as all rounds 2 coding questions and then HR questions were asked
- Q2. 1 print string without taking repeating characters eg helper - helpr
- Ans.
The task is to print a string without any repeating characters.
Iterate through the string and keep track of the characters seen so far.
If a character is already seen, skip it.
Otherwise, add it to the output string.
Return the output string.
- Q3. 2 sort array of 0s and 1s in only one loop solution was using two pointers
- Ans.
Sort an array of 0s and 1s in one loop using two pointers.
Use two pointers, one starting from the beginning and the other from the end.
Swap the values at the pointers if the value at the beginning pointer is greater than the value at the end pointer.
Continue until the pointers meet in the middle.
Time complexity is O(n).
- Q4. I solved both the questions then questions were asked on projects
- Q5. Difficulties in project how you learn new technology After two days I received mail and I was selected for software developer role
Interview Preparation Tips
- arrays
- string
- Also see puzzles on GFG they are also asked frequently
- No need to revise DBMS , OS for RSL interviews only coding is necessary
Skills evaluated in this interview
Senior Software Engineer Interview Questions & Answers
Impact Analytics
Anonymous
posted on 10 Sep 2024
I was interviewed in Aug 2024.
It was easy difficulty.
(1 Question)
- Q1. It was Medium difficulty.
(1 Question)
- Q1. It was medium difficulty.
(1 Question)
- Q1. It was managerial Round
(1 Question)
- Q1. It was quick offer discussion.
Selected
I applied via Campus Placement and was interviewed in Sep 2023. There were 4 interview rounds.
Duration:30 min
Question from percentage,ratios ,HCF/LCM etc.,
Logical reasoning, English
(1 Question)
- Q1. Reverse a string by making groups of given 'm' characters
- Ans.
Reverse a string by grouping 'm' characters together
Iterate through the string in groups of 'm' characters
Reverse each group of 'm' characters
Concatenate the reversed groups to get the final reversed string
(3 Questions)
- Q1. General HR questions
- Q2. What is your family background?
- Q3. Why should we hire you?
Skills evaluated in this interview
I applied via Walk-in and was interviewed in Jul 2023. There were 2 interview rounds.
Asked basic questions on aptitude and reasoning
It cosist of some aptitude questions
Interview Preparation Tips
- C
- C++
I applied via Cocubes and was interviewed in Jan 2022. There were 2 interview rounds.
Most rounds were regarding English proficiency and 1 round regarding logical reasoning
(4 Questions)
- Q1. What is your family background?
- Q2. Why should we hire you?
- Q3. What are your strengths and weaknesses?
- Q4. Tell me about yourself.
Interview Preparation Tips
Software Developer Interview Questions & Answers
ConsultAdd
Siddharth Choudhary
posted on 17 Oct 2024
I applied via Walk-in
(2 Questions)
- Q1. How make a queue using a stack
- Ans.
To implement a queue using a stack, use two stacks and simulate the queue operations.
Use two stacks, one for enqueue operation and one for dequeue operation.
For enqueue operation, simply push elements onto the stack used for enqueueing.
For dequeue operation, if the dequeue stack is empty, pop all elements from enqueue stack and push onto dequeue stack.
Then pop from the dequeue stack to simulate dequeue operation.
- Q2. Create a linked list
- Ans.
A linked list is a data structure consisting of nodes where each node points to the next node in the sequence.
Create a Node class with data and next pointer
Initialize a head pointer to null
Add nodes by updating next pointers
Traverse the list by following next pointers
Skills evaluated in this interview
Josh Technology Group Interview FAQs
Some of the top questions asked at the Josh Technology Group Software Developer interview for freshers -
The duration of Josh Technology Group Software Developer interview process can vary, but typically it takes about less than 2 weeks to complete.
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
- Senior Software Developer Interview Questions
- Associate Software Developer Interview Questions
- Lead Software Engineer Interview Questions
- Software Development Engineer II Interview Questions
- Software Engineer Interview Questions
- Software Development Engineer 1 Interview Questions
- Software Engineer Level 1 Interview Questions
- Java Software Developer Interview Questions
- Show more
Top Skills for Josh Technology Group Software Developer
Software Developer Interview Questions from Similar Companies
Fast track your campus placements
Josh Technology Group Software Developer Reviews and Ratings
based on 11 reviews
Rating in categories
|
Software Developer
94
salaries
|  ₹6.8 L/yr - ₹19.5 L/yr |
|
Front end Developer
48
salaries
| ₹6.3 L/yr - ₹17 L/yr |
|
Senior Software Developer
41
salaries
| ₹8.2 L/yr - ₹24 L/yr |
|
Software Quality Analyst
22
salaries
| ₹4.2 L/yr - ₹7.5 L/yr |
|
Software Engineer
19
salaries
| ₹6 L/yr - ₹15 L/yr |
TCS
Infosys
Wipro
HCLTech
Calculate your in-hand salary
- Home >
- Interviews >
- Josh Technology Group Interview Questions >
- Josh Technology Group Software Developer Interview Questions for Fresher
