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 for Freshers
67 Interview questions
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.
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 t...
Creating a simple CRUD app using HTML, CSS, and JavaScript to manage a list of items.
Set up a basic HTML structure with a form for input.
Use JavaScript to handle form submission and add items to an array.
Implement functions to read, update, and delete items from the array.
Display the list of items dynamically on the webpage.
Use local storage to persist data across page refreshes.
Merge Two Binary Trees Problem Statement
You are given the roots of two binary trees, root1 and root2. Merge these two trees into a new binary tree. If two nodes overlap, sum the node values as the new nod...
Merge two binary trees by summing overlapping nodes and retaining non-null nodes.
Traverse both trees simultaneously in preorder fashion
If both nodes are not null, sum their values for the new node
If one node is null, use the non-null node as the new node
Recursively merge the left and right subtrees
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 into K + 1 parts (c...
The task is to maximize the total sweetness of the part that Ninja will get by dividing chocolates into K + 1 parts.
Iterate through the array of sweetness values to find the maximum sweetness value.
Use binary search to find the maximum sweetness that Ninja can obtain by making cuts.
Consider the constraints while implementing the solution.
Handle multiple test cases efficiently.
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, ...
Reverse a linked list in groups of size K
Iterate through the linked list in groups of size K
Reverse each group of nodes
Handle cases where the last group has fewer nodes than K
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 ...
Maximize vaccines administered on a specific day while following certain rules.
Distribute vaccines evenly over the given number of days.
Ensure the difference in vaccines administered between consecutive days is at most 1.
Maximize the number of vaccines administered on the specified day.
Keep track of the total number of vaccines administered to not exceed the maximum limit.
Implement a function to calculate the maxi...
Matrix Chain Multiplication Problem
Given 'N' 2-dimensional matrices and an array ARR of length N + 1, where the first N integers denote the number of rows in each matrix and the last integer represents th...
Find the minimum number of multiplication operations required to multiply a series of matrices together.
Use dynamic programming to solve this problem efficiently.
Create a 2D array to store the minimum number of operations needed to multiply matrices.
Iterate through different combinations of matrices to find the optimal solution.
Consider the dimensions of the matrices to determine the number of operations required.
...
K Largest Elements Problem Statement
You are given an unsorted array containing 'N' integers. Your task is to find the 'K' largest elements from this array and return them in non-decreasing order.
Input:
Th...Yes, the problem can be solved in less than O(N*log(N)) time complexity using the Quick Select algorithm.
Implement Quick Select algorithm to find the Kth largest element in O(N) time complexity.
Partition the array around a pivot element and recursively search in the left or right partition based on the position of the pivot.
Once you find the Kth largest element, return all elements greater than or equal to it in n...
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 ...
Yes, the 0/1 Knapsack problem can be solved using dynamic programming with a space complexity of not more than O(W).
Use a 1D array to store the maximum value that can be stolen for each weight capacity from 0 to W.
Iterate through each item and update the array based on whether including the item would increase the total value.
The final value in the array at index W will be the maximum value that can be stolen.
Josh Technology Group Interview Experiences for Freshers
24 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 Jun 2024. There were 3 interview rounds.
It was a test that had like basic c questions that one needs to practice, basic logical reasoning and Mathematics, a couple of English grammar questions
There is a coding round with 4 questions 3 coding questions and one find the output of the c program question, one easy question, 2 medium questions one medium to hard level.Two linear data structure questions one array one linked list and one tree question.
Another coding test with 3 questions medium to hard level questions from trees and linked lists, with optimisation required
They have their own platform
Take home assignment
(1 Question)
- Q1. Live coding round of CRUD based small app.
- Ans.
Creating a simple CRUD app using HTML, CSS, and JavaScript to manage a list of items.
Set up a basic HTML structure with a form for input.
Use JavaScript to handle form submission and add items to an array.
Implement functions to read, update, and delete items from the array.
Display the list of items dynamically on the webpage.
Use local storage to persist data across page refreshes.
(1 Question)
- Q1. More on HTML, CSS, JS
(1 Question)
- Q1. Promises, async/await, settimeout etc.
Interview Preparation Tips
I applied via Referral and was interviewed in May 2024. There were 2 interview rounds.
3 question leetocde hard
(2 Questions)
- Q1. Managemet quesion
- Q2. Salery discussion
Interview Preparation Tips
I appeared for an interview in Feb 2024.
It was quite basic including the basic understanding of front-end and the aptitude
I applied via Campus Placement 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 3 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
Selected
I appeared for an interview before Jun 2024, where I was asked the following questions.
- Q1. Asked DSA question about trees
- Q2. Asked DSA question about linked list
Top trending discussions
Josh Technology Group Interview FAQs
Some of the top questions asked at the Josh Technology Group interview for freshers -
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
- Associate Interview Questions
- Team Lead Interview Questions
- Senior Associate Interview Questions
- Sales Executive Interview Questions
- Show more
Overall Interview Experience Rating
based on 10 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 >
- Josh Technology Group Interview Questions for Fresher
