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
Virtual DOM is a lightweight copy of the actual DOM that allows efficient updates and rendering in JavaScript frameworks.
Virtual DOM is a concept used in JavaScript frameworks like React.
It is a lightweight copy of the actual DOM tree.
Changes made to the virtual DOM are compared with the actual DOM to determine the minimal updates needed.
This helps in efficient rendering and improves performance.
Virtual DOM allows...
Design a signin page using HTML and CSS only
Create a form element with input fields for username and password
Style the form using CSS to make it visually appealing
Add a submit button for users to sign in
Consider adding error messages or validation for user input
Use CSS to make the page responsive for different screen sizes
Hoisting is a JavaScript behavior where variable and function declarations are moved to the top of their containing scope.
Hoisting applies to both variable and function declarations.
Variable declarations are hoisted but not their initializations.
Function declarations are fully hoisted, including their definitions.
Hoisting can lead to unexpected behavior if not understood properly.
Temporal Dead Zone is a behavior in JavaScript where variables are not accessible before they are declared.
Temporal Dead Zone occurs when accessing variables before they are declared
Variables in the Temporal Dead Zone cannot be accessed or assigned
The Temporal Dead Zone is a result of JavaScript's hoisting behavior
Example: accessing a variable before it is declared will throw a ReferenceError
Promises in JavaScript are objects that represent the eventual completion or failure of an asynchronous operation.
Promises are used to handle asynchronous operations such as fetching data from a server or reading a file.
They simplify the process of writing asynchronous code by providing a more structured approach.
Promises have three states: pending, fulfilled, or rejected.
They can be chained together using methods...
JSX is a syntax extension for JavaScript that allows you to write HTML-like code in your JavaScript files.
JSX stands for JavaScript XML
It is commonly used with React to define the structure and appearance of components
JSX elements are transpiled into regular JavaScript function calls
It allows you to write HTML-like code with JavaScript expressions embedded within curly braces
Example:
Hello, {name}!
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 element ARR[i...
Rearrange array elements in a zig-zag manner where every odd index element is greater than its neighbors.
Iterate through the array and swap elements at odd indices to satisfy the zig-zag condition.
Ensure that the swapped elements are greater than their neighbors.
Multiple correct zig-zag rearrangements may exist for a given array.
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. Return...
Find all nodes at a specified distance K from a given node in a binary tree.
Traverse the binary tree to find the target node.
Use depth-first search to explore nodes at distance K from the target node.
Keep track of the distance from the target node while traversing.
Return a list of node values at distance K from the target node.
Handle cases where no nodes are found at the specified distance.
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 i...
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 number of elements in the last group is less than K.
Sum Root to Leaf Path Problem
You are given an arbitrary binary tree consisting of N nodes where each node is associated with an integer value from 1 to 9. Each root-to-leaf path in the tree represents a n...
Calculate the total sum of all possible root-to-leaf paths in a binary tree.
Traverse the tree from root to leaf nodes, keeping track of the current path sum.
Add the path sum to the total sum when reaching a leaf node.
Use recursion to explore all possible paths in the tree.
Return the total sum modulo (10^9 + 7) as the final result.
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
- Associate Interview Questions
- Team Lead Interview Questions
- Senior Associate Interview Questions
- Sales Executive 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
