Josh Technology Group Web Developer Interview Questions and Answers

Debugging questions are mostly asked, you can get them from GFG

In coding test , mostly the leetcode medium questions are asked like tree traversal and linked list related questions

Round duration - 60 minutes
Round difficulty - Medium

Online Coding Test on Calyxpod platform. There were 2 coding questions

Q1. 
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 t...read more
Ans. 
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
Answered by AI
Add your answer
Q2. 
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 th...read more
Ans. 
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.
Answered by AI
View 1 more answer

Round duration - 70 minutes
Round difficulty - Easy

Advance Subjective Round on Calyxpod platform: 5 questions. One question was related to data structures and algorithms. Other 4 were related to Html, CSS and Javascript.

Q1. 
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.
Explanati...read more
Ans. 
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.
Answered by AI
Add your answer