Josh Technology Group Interview Questions, Process, and Tips

They would ask searching sorting , binary search in first round

Q1. Most of question were from Tree and DP
Add your answer
Q2. Delete a node from a binary tree.
Ans. 
Delete a node from a binary tree.
• Find the node to be deleted

• If the node has no children, simply delete it

• If the node has one child, replace it with its child

• If the node has two children, find the minimum value in its right subtree, replace the node with that value, and delete the minimum value node
Answered by AI
Add your answer

Basic English Comprehension, EQL questions and writing an email to assess content.

Q1. Basic on the basis of CV
Add your answer
Q2. Experience from the past roles.
Ans. 
I have over 5 years of experience in project management, client relations, and team leadership.
• Managed multiple projects simultaneously, ensuring timely delivery and client satisfaction

• Led cross-functional teams to achieve project goals and milestones

• Developed and maintained strong relationships with clients, resulting in repeat business and referrals
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Easy

It was just after the first round in the morning

Q1. 
Huffman Coding Challenge
Given an array ARR of integers containing 'N' elements where each element denotes the frequency of a character in a message composed of 'N' alphabets of an alien language, your ta...read more
Ans. Optimized Solution
We will be dividing our solution into three parts for better understanding. We will use a Min-Heap to build a binary tree and then traverse the binary tree to assign Huffman codes to each element.
 
 
1. Understanding the need of using a Min-Heap 
A basic idea would be to sort the frequency array and repeatedly give the smallest not used code to the character having maximum frequency. This ide...read more
Answered Anonymously
View 1 more answer

Round duration - 90 Minutes
Round difficulty - Medium

1 hr after the second round got over and results were announced in the morning.

Q1. 
Ways To Make Coin Change
Given an infinite supply of coins of varying denominations, determine the total number of ways to make change for a specified value using these coins. If it's not possible to make...read more
Ans. Recursion
 
1. The idea is to use recursion.
2. For a particular coin, we have two options either include it or exclude it.
3. If we include that coin, then calculate the remaining number that we have to generate so recur for that remaining number.
4. If we exclude that coin, then recur for the same amount that we have to make.
5. Our final answer would be the total number of ways either by including or excluding.
6. There will be two edg...read more
Answered Anonymously
Add your answer

Round duration - 90 Minutes
Round difficulty - Medium

10 A.M in the morning.
The interviewers were very knowledgeable and humble

Q1. 
Unique Element In Sorted Array
Nobita wants to impress Shizuka by correctly guessing her lucky number. Shizuka provides a sorted list where every number appears twice, except for her lucky number, which a...read more
Ans. 
Step 1 : I told them brute force approach.
Step 2 : Told about bitmasking approach.
Step 3 : I them them Binary Search approach(the most optiimsed one)
Step 4 : They told me to code it and run test cases.
Answered Anonymously
Add your answer
Q2. 
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 ...read more
Ans. 
Step 1 : I told them brute force approach.
Step 2 : Told them about Binary tree approach
Step 3 : They told me to code it and dry run and run test cases.
Answered Anonymously
Add your answer

Round duration - 90 Minutes
Round difficulty - Medium

It was after the first technical interview round.
Got a mail for the second interview round .
Timings approx 12 AM

Q1. 
Remove BST Keys Outside Given Range
Given a Binary Search Tree (BST) and a specified range [min, max], your task is to remove all keys from the BST that fall outside this range. The BST should remain vali...read more
Ans. 
Step 1 : Brute force array conversion approach.
Step 2 : Delete a node in a tree approach.
Step 3 : Optimised the above approach to delete only specified nodes to achieve the answer
Step 4 : Coded the approach and ran the test cases provided
Answered Anonymously
Add your answer
Q2. 
Inorder Successor in a Binary Tree
Given an arbitrary binary tree and a specific node within that tree, determine the inorder successor of this node.
Explanation:
The inorder successor of a node in a bi...read more
Ans. Inorder Traversal
• The fact that all the data values are unique makes the solution look very intuitive.
• We can simply store the inorder traversal of the given tree in some data structure, most probably arrays, and find the element present after the given node in the array.
• For inorder traversal, we can write a simple recursion code, where for every node, its left subtree is visited recursively, and then the node is visited...read more
Answered Anonymously
Add your answer

Round duration - 30 Minutes
Round difficulty - Easy

Got a call from Hr after clearance of the first 2 rounds.
Timing were 5:30 P.M

Round duration - 60 Minutes
Round difficulty - Medium

Q1. 
Last Stone Weight Problem Explanation
Given a collection of stones, each having a positive integer weight, perform the following operation: On each turn, select the two heaviest stones and smash them toge...read more
Ans. 
This question is about finding the weight of the last stone after repeatedly smashing the two heaviest stones together.
• Sort the array of stone weights in descending order.

• Repeatedly smash the two heaviest stones until there is at most 1 stone left.

• If there is 1 stone left, return its weight. Otherwise, return 0.
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

Q1. Design a sign-in page using only HTML and CSS.
Ans. 
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
Answered by AI
Add your answer

Round duration - 7 days
Round difficulty - Medium

Q1. How would you design and develop a to-do list application using local storage?
Ans. 
A todo list application using localstorage.
• Use HTML, CSS, and JavaScript to create the user interface.

• Use the localstorage API to store and retrieve todo items.

• Implement features like adding, editing, and deleting todo items.

• Display the list of todo items and their status.

• Allow users to mark todo items as completed or incomplete.
Answered by AI
Add your answer

Round duration - 120 Minutes
Round difficulty - Easy

Round duration - 60 Minutes
Round difficulty - Easy

Questions related to react and high level javascript?

Q1. What is hoisting in JavaScript?
Ans. 
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.
Answered by AI
Add your answer
Q2. What is memoization in JavaScript?
Ans. 
Memoization is a technique in JavaScript to cache the results of expensive function calls for future use.
• Memoization improves performance by avoiding redundant calculations

• It is commonly used in recursive functions or functions with expensive computations

• The cached results are stored in a data structure like an object or a map

• Memoization can be implemented manually or using libraries like Lodash or Memoizee
Answered by AI
Add your answer
Q3. What is an IIFE (Immediately Invoked Function Expression) in JavaScript?
Ans. 
IIFE stands for Immediately Invoked Function Expression. It is a JavaScript function that is executed as soon as it is defined.
• IIFE is a way to create a function expression and immediately invoke it.

• It helps in creating a private scope for variables and functions.

• It is commonly used to avoid polluting the global namespace.

• IIFE can be written using different syntaxes like using parentheses, function declaration, or arro
Answered by AI
Add your answer
Q4. What are promises in JavaScript?
Ans. 
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 like...read more
Answered by AI
Add your answer
Q5. What is the Temporal Dead Zone in JavaScript?
Ans. 
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
Answered by AI
Add your answer
Q6. What are arrow functions in JavaScript?
Ans. 
Arrow functions are a concise way to write functions in JavaScript.
• Arrow functions have a shorter syntax compared to regular functions.

• They do not have their own 'this' value.

• They do not have the 'arguments' object.

• They cannot be used as constructors with the 'new' keyword.

• They are commonly used in functional programming and with array methods like 'map' and 'filter'.
Answered by AI
Add your answer
Q7. What is JSX?
Ans. 
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}!
Answered by AI
Add your answer
Q8. What are higher-order functions in JavaScript?
Ans. 
Higher order functions are functions that can take other functions as arguments or return functions as their results.
• Higher order functions can be used to create more flexible and reusable code.

• They enable functional programming paradigms.

• Examples of higher order functions include map, filter, and reduce in JavaScript.
Answered by AI
Add your answer
Q9. What is the virtual DOM in JavaScript?
Ans. 
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 deve...read more
Answered by AI
Add your answer

Round duration - 35 Minutes
Round difficulty - Easy

Happend around 08:30 pm

Round duration - 90 Minutes
Round difficulty - Easy

You are given three ds coding questions which you have to solve within 90 mins.
The questions are easy to medium level for this round

Q1. 
Non-Decreasing Array Problem Statement
Given an integer array ARR of size N, determine if it can be transformed into a non-decreasing array by modifying at most one element.
An array is defined as non-de...read more
Ans. 
The solution checks if an integer array can become non-decreasing by modifying at most one element.
• Iterate through the array and check if there are more than one decreasing pairs of elements.

• If there are more than one decreasing pairs, return false.

• If there is only one decreasing pair, check if modifying one of the elements can make the array non-decreasing.

• If modifying the element at index i-1 or i can make the array ...read more
Answered by AI
View 2 more answers
Q2. 
Sort Linked List Based on Actual Values
You are given a Singly Linked List of integers that is initially sorted according to the absolute values of its elements. Your task is to sort this Linked List base...read more
Ans. 
The task is to sort a singly linked list based on actual values instead of absolute values.
• Traverse the linked list and store the values in an array

• Sort the array using any sorting algorithm

• Create a new linked list using the sorted array

• Return the new linked list
Answered by AI
Add your answer
Q3. 
Diameter of a Binary Tree Problem Statement
Given a binary tree, return the length of its diameter. The diameter of a binary tree is defined as the length of the longest path between any two nodes in the ...read more
Ans. 
The diameter of a binary tree is the length of the longest path between any two end nodes in the tree.
• The diameter of a binary tree can be calculated by finding the maximum of the following three values: 1) the diameter of the left subtree, 2) the diameter of the right subtree, and 3) the longest path that passes through the root node.

• To find the diameter of a binary tree, we can use a recursive approach. We calculate ...read more
Answered by AI
Add your answer

Round duration - N/A
Round difficulty - Medium

Round duration - 120 Minutes
Round difficulty - Hard

This round focus on advanced Js concepts and the tech stack I used in my projects.

Q1. 
Find Unique Element in Array
You have been provided an integer array/list ARR of size N. Here, N is equivalent to 2M + 1 where each test case has M numbers appearing twice and one number appearing exactly...read more
Ans. 
The task is to find the unique number in an array where all other numbers occur twice.
• The array size is given by N = 2M + 1, where M is the number of elements occurring twice.

• Loop through the array and use a hashmap to count the occurrences of each number.

• Return the number with a count of 1, as it is the unique number.
Answered by AI
View 2 more answers

Round duration - 60 Minutes
Round difficulty - Easy

It was a late night round as i have already had the previous 3 rounds at the same day. The HR asked about my experience regarding the previous rounds and also some situation based questions.