AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
Filter interviews by
Josh Technology Group Interview Questions and Answers
98 Interview questions
Size of Largest BST in a Binary Tree
Given a binary tree with 'N' nodes, determine the size of the largest subtree that is also a Binary Search Tree (BST).
Explanation:
A Binary Search Tree (BST) is defi...
Find the size of the largest BST subtree in a binary tree.
Traverse the tree in a bottom-up manner to check if each subtree is a BST.
Keep track of the size of the largest BST found so far.
Recursively check if the current subtree is a BST and update the size accordingly.
Longest Common Subsequence Problem Statement
Given two strings STR1 and STR2, determine the length of their longest common subsequence.
A subsequence is a sequence that can be derived from another sequenc...
The problem involves finding the length of the longest common subsequence between two given strings.
Use dynamic programming to solve the problem efficiently.
Create a 2D array to store the lengths of common subsequences of substrings.
Iterate through the strings to fill the array and find the length of the longest common subsequence.
Example: For input STR1 = 'abcde' and STR2 = 'ace', the longest common subsequence i...
Longest Palindromic Substring Problem Statement
You are provided with a string STR of length N. The task is to find the longest palindromic substring within STR. If there are several palindromic substrings...
Given a string, find the longest palindromic substring within it.
Iterate through the string and expand around each character to find palindromes
Keep track of the longest palindrome found so far
Return the longest palindromic substring
Rotate Linked List Problem Statement
Given a linked list consisting of 'N' nodes and an integer 'K', your task is to rotate the linked list by 'K' positions in a clockwise direction.
Example:
Input:
Lin...
Rotate a linked list by K positions in a clockwise direction.
Traverse the linked list to find the length and the last node.
Connect the last node to the head to form a circular linked list.
Find the new head by moving (length - K) steps from the last node.
Break the circular list at the new head to get the rotated linked list.
Balanced Binary Trees Problem Statement
You are provided with an integer 'H'. Your task is to determine and print the maximum number of balanced binary trees possible with height 'H'.
A balanced binary tr...
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 bal...
Wave Array Sorting Problem
Your goal is to sort a given unsorted array ARR such that it forms a wave array.
Explanation:
After sorting, the array should satisfy the wave pattern conditions:
ARR[0] &g...
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
Validate Binary Tree Nodes Problem
You are provided with 'N' binary tree nodes labeled from 0 to N-1, where node i has two potential children, recorded in the LEFT_CHILD[i] and RIGHT_CHILD[i] arrays. Deter...
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
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 n...
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 resul...
Maximum Sum BST Problem Statement
You are presented with a Binary Tree 'root', which may not necessarily be a Binary Search Tree (BST). Your objective is to identify the maximum sum of node values in any s...
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
Pair Sum in BST Problem Statement
Given a Binary Search Tree (BST) and a target value K, determine if there exist two unique elements in the BST such that their sum equals K.
Input:
An integer T, the num...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...
Josh Technology Group Interview Experiences
71 interviews found
Pratham Singh
Selected
I applied via Campus Placement and was interviewed in Jul 2024. There were 8 interview rounds.
**1st Round: Online Assessment**
The first elimination round consisted of an online assessment focused on HTML, CSS, and JavaScript. The questions ranged from basic to advanced, with a significant emphasis on JavaScript concepts like promises and async operations. This round included negative marking, so accuracy was key.
**2nd Round: DSA Online Test**
The second elimination round tested Data Structures and Algorithms (DSA). It involved two compulsory problems: one focused on string manipulation and the other on array manipulation, both requiring solutions with O(1) space complexity.
**3rd Round: Personality Test**
This non-elimination round assessed grammar and communication skills. It included:
- Fill-in-the-blank questions focused on subject-verb agreement.
- Sentence repetition tasks where we had to listen and repeat the given sentences.
- Audio-based tasks requiring us to repeat sentences after listening to them.
**4th Round: Home Assignment**
In this elimination round, we were tasked with cloning a webpage using only HTML, CSS, and JavaScript. The goal was to create a pixel-perfect design without the use of frameworks or libraries like Bootstrap.
Candidates who cleared this round invited to the JTG campus for further process.
**5th Round: DSA **
This elimination round began with solving DSA problems focused on string and array manipulation.
**6th Round: Live Coding Assignment**
Round 5th was followed by a live coding task where we had to build a to-do application using only HTML, CSS, and JavaScript. The application needed to leverage local storage for data persistence. The technical interview in this round was based on the live coding task.
(1 Question)
- Q1. **6th and 7th Rounds: Technical Interviews** The next two elimination rounds were back-to-back technical interviews. They covered advanced concepts in HTML, CSS, and JavaScript, along with DSA problems.
(1 Question)
- Q1. **9th Round: HR Interview** The final round was an HR interview, where the focus was on personality traits, career aspirations, and alignment with the company’s values. **Verdict: Selected**
Interview Preparation Tips
From our college, only two students were selected. We joined the company in September 2024 as Frontend Developer Interns, with a Pre-Placement Offer (PPO) of 12 LPA.
**Exciting News!**
I am also starting a YouTube channel where I will teach each concept in detail. The content will focus on helping candidates prepare for developer interviews by covering topics like HTML, CSS, JavaScript, and DSA. Do subscribe to my channel to stay updated and take your preparation to the next level!
Channel link - -----/@prathamsingh191?si=gE5UHeJcrq5mBDUI
Linkedin profile - -----/
Anonymous
I appeared for an interview in Sep 2024.
It was relatively simple some language basics some cs basics and it was good togo
This was a coding plus English plus math round the coding problems where easy
This was 3rd round also a coding round the level of problems was medium
(2 Questions)
- Q1. You are provided with a linked list have to make sure that it is in decreasing order
- Ans.
Check if a linked list is sorted in decreasing order by comparing adjacent nodes.
Traverse the linked list from head to tail.
For each node, compare its value with the next node's value.
If any node's value is less than the next node's value, the list is not in decreasing order.
Example: For list 5 -> 3 -> 2, it is in decreasing order.
Example: For list 5 -> 6 -> 2, it is not in decreasing order.
- Q2. You are given a random bst's node and you have to check whether a given element is part of the tree or not
- Ans.
Check if a given element exists in a Binary Search Tree (BST) node using its properties.
A BST is structured such that for any node, left children are smaller and right children are larger.
To find an element, start at the given node and compare it with the node's value.
If the element is equal to the node's value, it exists in the tree.
If the element is less, recursively search the left subtree; if greater, search the ri...
Interview Preparation Tips
Question directly come from the leetcode.
(2 Questions)
- Q1. Data structure must be completed
- Q2. From Tree and graphs.
Interview Preparation Tips
I applied via Campus Placement and was interviewed in Oct 2024. There were 3 interview rounds.
Medium level questions asked
Simple easy to medium 2 questions asked of string and array
(2 Questions)
- Q1. Tell me about yourself
- Q2. JavaScript like fetch axios and others
I appeared for an interview in Apr 2025, where I was asked the following questions.
- Q1. Convert the Binary Search Tree (BST) to a Greater Tree.
- Ans.
Convert a BST to a Greater Tree by replacing each node's value with the sum of all greater values.
Traverse the tree in reverse in-order (right, root, left) to accumulate values.
Start with a variable to keep track of the cumulative sum.
For each node, update its value to the cumulative sum and add its original value to the sum.
Example: For BST with values [4, 1, 6, 0, 2, 5, 7], the Greater Tree will have values [22, 27, ...
- Q2. Given a Binary Search Tree (BST), find if there exists a pair of nodes whose values sum up to a given target. The time complexity required for this solution is O(n), and the space complexity should be less...
- Ans.
Check for a pair of nodes in a BST that sum to a target using O(n) time and O(1) space.
Use an in-order traversal to get sorted values from the BST.
Utilize two pointers: one at the start and one at the end of the sorted array.
If the sum of the values at the two pointers equals the target, return true.
If the sum is less than the target, move the left pointer right; if greater, move the right pointer left.
Example: For BST...
Aryan Srivastava
I applied via Campus Placement
(2 Questions)
- Q1. Oops related questions
- Q2. C language quizzes
I applied via Campus Placement and was interviewed in Jun 2024. There were 3 interview rounds.
Consist of aptitude, logical reasoning and verbal ability questions. Debugging questions also there . Do specific questions bcz there is negative marking
(2 Questions)
- Q1. About software quality assurance
- Q2. Ai tools importance in sqa
- Ans.
AI tools play a crucial role in Software Quality Assurance by automating testing processes, improving efficiency, and detecting defects early.
AI tools can automate repetitive testing tasks, saving time and effort.
AI tools can analyze large amounts of data quickly and accurately, helping to identify potential defects.
AI tools can improve test coverage by generating test cases based on historical data and patterns.
AI too...
(2 Questions)
- Q1. Introduction test cases of various objects near you
- Ans.
Introduction test cases for objects near me
Test case for testing a chair: verify stability, check for any damages, test weight capacity
Test case for testing a computer: check if it powers on, test functionality of keyboard and mouse, verify internet connectivity
Test case for testing a pen: check if it writes smoothly, test ink flow, verify if cap fits securely
- Q2. Testing related questions
Interview Preparation Tips
I applied via Campus Placement and was interviewed in Aug 2024. There were 2 interview rounds.
Duration 60 min, topics: DBMS, computer networking, outputs, SQL queries
Topics: Trees, DP, Greedy
Interview Preparation Tips
It is very impressive work on Josh technology assessment because we learn many new skills.
(2 Questions)
- Q1. What is api and how it is work ?
- Ans.
API stands for Application Programming Interface. It is a set of rules and protocols that allows different software applications to communicate with each other.
APIs define the methods and data formats that applications can use to request and exchange information.
APIs can be used to access services provided by other software applications, such as retrieving data from a database or sending notifications.
Examples of APIs ...
- Q2. What is software development life cycle and which steps are following?
- Ans.
Software development life cycle (SDLC) is a process used by software developers to design, develop, and test software.
1. Planning: Define the project scope, requirements, and objectives.
2. Analysis: Gather and analyze user requirements.
3. Design: Create a detailed design of the software.
4. Implementation: Develop the software based on the design.
5. Testing: Test the software for bugs and issues.
6. Deployment: Release t...
Skills evaluated in this interview
(1 Question)
- Q1. Pointer i c++ and css
Dsa round with medium tto hard level questions
Top trending discussions
Josh Technology Group Interview FAQs
The duration of Josh Technology Group 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 Web Developer Interview Questions
- Josh Technology Group Software Development Engineer Intern Interview Questions
- Show more
Interview Questions for Popular Designations
Overall Interview Experience Rating
based on 54 interview experiences
Difficulty level
Duration
Explore Interview Questions and Answers for Top Skills at Josh Technology Group
Interview Questions from Similar Companies
Josh Technology Group Reviews and Ratings
based on 79 reviews
Rating in categories
2-5 Yrs
Not Disclosed
|
Software Developer
103
salaries
|  ₹10.5 L/yr - ₹18.9 L/yr |
|
Front end Developer
56
salaries
| ₹9 L/yr - ₹16.2 L/yr |
|
Senior Software Developer
33
salaries
| ₹12 L/yr - ₹21.7 L/yr |
|
Software Quality Analyst
32
salaries
| ₹4.2 L/yr - ₹7.1 L/yr |
|
Software Engineer
22
salaries
| ₹8.6 L/yr - ₹15 L/yr |
Maxgen Technologies
JoulestoWatts Business Solutions
Value Point Systems
F1 Info Solutions and Services
- Home >
- Interviews >
- Josh Technology Group Interview Questions
