Open In App

Josh Techology Interview Experience for SDE (On-Campus) 2022

Improve
Improve
Like Article
Like
Save
Share
Report

Online Coding Rounds

The first round consists of 3 phases. All of them are online and all rounds the elimination rounds.

Phase 1 (Objective round): This phase consists of 50 MCQs. 40 of them are from DSA, oops, SQL. The code snippet is given, you have to write the output (options are not given in output-based ques). There is a negative marking in MCQs. The rest 10 questions are aptitude-based questions. The level of this round was easy to medium. 

If you cleared this round, then only you will receive the link for the next round.

Phase 2(Subjective round): This round is basically the coding round only. It consists of 4 questions out of them one is output based i.e code is given, and you have to write the output. The below questions are there.

  •   Min depth of Binary tree
  •   Remove duplicates from sorted list II 
  •   Minimum steps required to make 2 strings anagram. 
  •   This was an output-based question on the tree.  The code was so lengthy. 

  Even if you solve 3 questions, you will clear this round.

  Tip: Try to write the comments with the code. Follow proper naming of variables and also mention the T.C & S.C in the end if possible.

Phase 3(Coding round): This round consists of 3 coding questions.

  •  Reverse nodes in even length.
  •  LCA of 2 nodes.
  •  I don’t remember the 3rd question, but it was based on the Linked list only.

 Tip:  Try to write the comments with the code. Follow proper naming of variables and also mention the T.C & S.C in the end if possible. (Same has been mentioned in the instructions as well.)

Coding round 2: After the above 3 phases, we had our next round which was also a coding round. They named it as Coding round 2 I don’t know why.  This round consists of 3 questions. I don’t exactly remember the questions of this round, but the questions are from binary tree, binary search and dp. I managed to clear this round by attempting 2 questions.

Interview round 1:  The interview started with brief introduction of mine. After that, the interviewer directly jumped into the coding question. 

1. Given a binary tree. We have to create the doubly linked list of all the leaf nodes in the binary tree and after that returning null to the root of the leaf nodes so that it will disconnect all the links of the leaf nodes to its root nodes and root nodes will now be pointing to null. 

2. This question was based on stack. 

Unfortunately, I couldn’t clear this round. But overall, it was a nice experience.

  


Last Updated : 07 Oct, 2022
Like Article
Save Article
Previous
Next
Share your thoughts in the comments
Similar Reads