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
92 Interview questions
Merge K Sorted Arrays Problem Statement
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.
Input
...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.
Segregate Odd-Even Problem Statement
In a wedding ceremony at NinjaLand, attendees are blindfolded. People from the bride’s side hold odd numbers, while people from the groom’s side hold even numbers. For ...
Rearrange a linked list such that odd numbers appear before even numbers while preserving the order.
Create two separate linked lists for odd and even numbers
Traverse the original list and append nodes to respective odd/even lists
Combine the odd and even lists while maintaining the order
Return the rearranged linked list
Check If Linked List Is Palindrome
Given a singly linked list of integers, determine if the linked list is a palindrome.
Explanation:
A linked list is considered a palindrome if it reads the same forward...
Check if a given singly linked list of integers is a palindrome or not.
Create a function to reverse the linked list.
Use two pointers to find the middle of the linked list.
Compare the first half of the linked list with the reversed second half to determine if it's a palindrome.
Balanced Parentheses Combinations
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.
Explanatio...
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.
Most Frequent Non-Banned Word Problem Statement
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 the...
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.
Intersection of Linked List Problem
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 th...
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
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 rep...
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.
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' -> 'L...
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 o...
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:
...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.
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 ...
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
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
- Software Developer Interview Questions
- Front end Developer Interview Questions
- Software Developer Intern Interview Questions
- Software Engineer Interview Questions
- Team Lead Interview Questions
- Business Analyst Interview Questions
- Senior Engineer Interview Questions
- Associate Software Engineer Interview Questions
- Show more
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
|
Software Developer
102
salaries
|  ₹6.8 L/yr - ₹19 L/yr |
|
Front end Developer
55
salaries
| ₹8.4 L/yr - ₹16.7 L/yr |
|
Senior Software Developer
32
salaries
| ₹8.5 L/yr - ₹22 L/yr |
|
Software Quality Analyst
32
salaries
| ₹4.2 L/yr - ₹7.1 L/yr |
|
Software Engineer
22
salaries
| ₹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
