Josh Technology Interview Experience for SDE (Off-Campus)

12 Jan, 2021
Online Selection Test: The comprised of three phases and all of them were on the same day.
Phase 1(MCQ ROUND): This round consists of 50 MCQs on C programming language, we were given 50 minutes to solve 50 questions, this phase also had some output based ques where we were given a code snippet, and we were supposed to type the output of that program. Output-based questions didn’t have negative marking where the MCQ questions had negative marking, if you attempt around 30 questions you will be shortlisted for the next round.
Phase 2(Subjective Round): This round had 3 coding questions and one output based question, they mainly focus on trees so if you want to crack Josh do practice a lot of questions based on treeQuestions:Given a number represented as the linked list, we were supposed to multiply this number by 4.Find the length of the longest alternating even-odd subarray Given a tree, we need to return a list representing the minimum number that should be added at each level such that the sum of the nodes at each level form an APIt was a C output based ques based on  trees
Given a number represented as the linked list, we were supposed to multiply this number by 4.Find the length of the longest alternating even-odd subarray Given a tree, we need to return a list representing the minimum number that should be added at each level such that the sum of the nodes at each level form an APIt was a C output based ques based on  trees
Given a number represented as the linked list, we were supposed to multiply this number by 4.
Find the length of the longest alternating even-odd subarray 
Given a tree, we need to return a list representing the minimum number that should be added at each level such that the sum of the nodes at each level form an AP
It was a C output based ques based on  trees
Phase 3(Coding Round): This round had three coding questions, and they were quite easyBuy-Sell Stocks to maximize the profit It is a standard DP problemGiven a linked list were supposed to update the value of each node by the sum of the node itself and the sum of (n-k)th nodee.g. 31->2->3->4->5->11->50  Output :  42->13->8->4->8->13->42Given a tree we need to check if the tree was balanced or not ie |height of left subtree – the height of right subtree| <= 1
Buy-Sell Stocks to maximize the profit It is a standard DP problemGiven a linked list were supposed to update the value of each node by the sum of the node itself and the sum of (n-k)th nodee.g. 31->2->3->4->5->11->50  Output :  42->13->8->4->8->13->42Given a tree we need to check if the tree was balanced or not ie |height of left subtree – the height of right subtree| <= 1
Buy-Sell Stocks to maximize the profit It is a standard DP problem
Given a linked list were supposed to update the value of each node by the sum of the node itself and the sum of (n-k)th nodee.g. 31->2->3->4->5->11->50  Output :  42->13->8->4->8->13->42
e.g. 31->2->3->4->5->11->50  Output :  42->13->8->4->8->13->42
Given a tree we need to check if the tree was balanced or not ie |height of left subtree – the height of right subtree| <= 1
Technical Rounds: I directly had my second interview after the online test while many people had their first technical interview as well, all the rounds were completely focused on trees
Interview Round 2: In this round, three questions were asked and all of them were based on trees
Given a tree were each leaf to root path represents a number, and we were supposed to return the sum of all the numbers that were formed int the tree
           in its case number formed are 123,543 and 643 and the final output of the code should be 123+543+643=1309  in O(N) time and O(1) space
Given Two BST we were supposed to print the sorted order of the nodes from both of the best combined in O(1) space and there was a catch that each node had reference to its left child, right child, and parent node
 Given a BST and a range we need to remove all the nodes that do not lie in the range and the resultant tree should also hold the conditions of BST 
Interview Round 3: 
Given a BST and a target value we need to split the BST into two BST such that all the nodes smaller than or equal to the target value lie in the first BST while others lie in the second BST in O(logn) time and O(1) space
Given an anti-BST and a target value we were expected to return the sum of all the nodes that are at K distance away from the target value in O(1) space
A recent project that I have worked upon
HR Round:
How was the experience so farWhat was the level of difficultyHow did you prepare for the roundsWho you are as a personYour WeaknessIf you were given a lot of work how would you handle the pressureDo you have any offer letter from some other company 
How was the experience so far
What was the level of difficulty
How did you prepare for the rounds
Who you are as a person
Your Weakness
If you were given a lot of work how would you handle the pressure
Do you have any offer letter from some other company 
Josh Technology
Marketing
Off-Campus
Interview Experiences
Writing code in comment?
Please use ide.geeksforgeeks.org,
generate link and share the link here.