Josh Technology Group Interview Experience for SDE

This was an on-campus opportunity open to 2023 graduates for SDE and FE roles. It consisted of three rounds, all taking place on the same day. Every round was an elimination round and took place on Calyxpod. I applied for the SDE role and this was my experience.

Round 1: MCQ Round: This round consists of 50 MCQs in the C++ programming language. The time duration was 50 minutes. There was no negative marking for wrong answers. The test had 30 questions on OOPs, STL, programming fundamentals, and 20 simple out-based questions.

Round 2: Subjective Round:

• Given an array [] of distinct integers of size N, the task is to print the count of greater elements on the left side of each array element. A Solution to this question.
• You are given a binary tree. You had to transform every left child node odd by subtracting one and the right child node even by adding 1. You were expected to implement the solution in constant space and linear time.
• Given an unsorted Linked List of integers. The task is to sort the Linked List into a wave-like Line. The solution to this question.
• An output-based program in C language based on binary search.

Round 3: Coding Round: Following questions were asked:

• Given a circular array of size n, find the maximum subarray sum of the non-empty subarray. A Solution to this question.
• 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 node.
• Given information about N petrol pumps (say arr[]) that are present in a circular path. The information consists of the distance of the next petrol pump from the current one (in arr[i][0]) and the amount of petrol stored in that petrol pump (in arr[i][1]). Consider a truck with infinite capacity that consumes 1 unit of petrol to travel 1 unit distance. The task is to find the index of the first starting point such that the truck can visit all the petrol pumps and come back to that starting point. A Solution to this question.