'Coding has over 700 languages', '67% of programming jobs aren’t in the technology industry', 'Coding is behind almost everything that is powered by electricity'
Josh Technology Group interview experience Real time questions & tips from candidates to crack your interview
SDE - Intern
Josh Technology Group
upvote
share-icon
5 rounds | 6 Coding problems
Interview preparation journey
expand-icon
Journey
Right from my first year, we were told to do coding to bag internships. Therefore, I started with basic coding in C++ when I was in first year. Then I took a DSA course from Coding Ninjas and practised well from it. I was able to solve most of the difficult questions by then. I also did Interview Bit 2 months before applying for interviews.
Application story
I applied in on-campus placement process. The company visited our campus for internships and placements. I was shortlisted on the basis of resume and coding test.
Why selected/rejected for the role?
I was rejected because I was not able to give optimised approach for one of the coding problems. I felt there was a lack of practise from my end.
Preparation
Duration: 3 months
Topics: DSA, CS FUNDAMENTALS, WEB CONCEPTS, OOPS
Tip
Tip

Tip 1 : Take your time before directly jumping onto the solution even if you have done the code already, it might be possible that interviewer would add any constraints of his own choice.

Tip 2 : Speak out loud, that's very important. If you are stuck onto something in between the interview, don't just sit idle or give up. Talk to your interviewer, let him/her know what's going in your mind, what approach are you trying to implement. The interviewer is your only friend in that room. 

Tip 3 : Don't worry if you haven't been into Competitive Programming before, you can still crack a lot of companies with decent DSA skills, projects are add on.

Tip 4 : For preparation, go through coding ninja's course thoroughly. It's very likely to encounter same questions that are already in the course itself. Common problems like, stock span, balanced parentheses, edit distance-DP, etc.

Tip 5 : Don't panic on seeing a question that you haven't done before. Try to break the given problem into small problems first just like we do in DP, it will surely help you out in building logic if not solution.

Application process
Where: Campus
Eligibility: Above 7.5 CGPA
Resume Tip
Resume tip

Tip 1 : Take a nice template for resume, you can even refer sites like novoresume.com. It has got good templates, just pick any with no fancy fonts and colors. Keep it simple.

Tip 2 : Be very specific. Write out important stuff only if you applying for a tech job. No one's going to see your dance/acting skills while interviewing you.

Tip 3 : If you have mentioned your projects, make sure you add your source code's link/github repo link as hyperlink to it. That's very important, it helps interviewer know that you have done this project and you're not faking it.

Interview rounds
01
Round
Medium
Online Coding Interview
Duration45 minutes
Interview date14 Feb 2020
Coding problem0

There were around 50 mcq's on C/C++ concepts.
There was no negative marking though.

02
Round
Medium
Online Coding Interview
Duration45 minutes
Interview date14 Feb 2020
Coding problem1

Online coding round.
We could only write pseudo code and couldn't test against test cases.

1. Level order traversal of a Binary Tree.
Easy
15m average time
85% success
0/40
Asked in companies
HikeLinkedInIntuit

You have been given a Binary Tree of integers. You are supposed to return the level order traversal of the given tree.

For example:
For...
View more
Problem approach

Again i had already done this question in the course itself so it was a cake walk for me.
Solution:
Step 1: Create an empty queue which accepts BinaryTreeNode.
Step 2: Put root of the binary tree in the queue.
Step 3: Loop while queue is not empty
3a. store the current size of the queue which will help us know how many nodes are there which needs to be printed at one level.
3b...

View more
Try solving now
03
Round
Easy
Face to Face
Duration50 minutes
Interview date17 Feb 2020
Coding problem2

It was onsite face to face technical round where i was asked 2 coding questions.
It lasted for 40-50 minutes.

1. Kth ancestor of a node in binary tree
Hard
50m average time
35% success
0/120
Asked in companies
HCL TechnologiesGoldman SachsWalmart

You are given an arbitrary binary tree consisting of N nodes numbered from 1 to N, an integer 'K', and a node 'TARGET_NODE_VAL' from t...

View more
Problem approach

I solved this question recursively.
Step 1: Find the given node in the tree.
Step 2: If node not found then simply return null, else check if K is greater than 0, if yes that means we haven't found the Kth ancestor, so we decrement the value of K.
Also we check if K value is 0 then we have found Kth ancestor, and we print it and return null and with base case if root == null, we return...

View more
Try solving now
2. Equilibrium indices of a sequence
Moderate
15m average time
85% success
0/80
Asked in companies
AccentureSpringworksVMware Inc

You have been given an array/list 'SEQUENCE' denoting the sequence of 'N' integers. Your task is to find the equilibrium indices of the sequence in 'SEQUENCE'.

View more
Try solving now
04
Round
Medium
Face to Face
Duration50 minutes
Interview date17 Feb 2020
Coding problem1

Only 7 students were shortlisted after the first face to face round out of 40 students.
The interviewer seemed cool and was trying to calm down me as i was getting nervous.
Again there were 2 coding questions.

1. Reverse linked list
Moderate
15m average time
85% success
0/80
Asked in companies
DunzoSamsungMakeMyTrip

Given a singly linked list of integers. Your task is to return the head of the reversed linked list.

For example:
The given linked list is 1 -> 2 ->...
View more
Try solving now
05
Round
Medium
Face to Face
Duration90 minutes
Interview date17 Feb 2020
Coding problem2

This was the last technical round and there were only 5 students left at the end of day.
The interview started at around 6:30 in the evening.

1. Replace with Sum of greater nodes
Moderate
25m average time
65% success
0/80
Asked in companies
OracleSamsungAmazon

Given a binary tree with 'N' number of nodes, convert it to a Greater Tree such that data of every node of the original BST i...

View more
Problem approach

Step 1: I made a helper function where i passed the root node and 0 which worked as the sum in it.
Step 2: Made a base case, if root is null, return.
Step 3: Went to the rightmost node of the tree as the rightmost node is the only node which will have highest value in whole BST.
Step 4: Added the root's data to the sum variable which was passed in the helper function.
Step 5: After ...

View more
Try solving now
2. Nuts and bolts
Easy
15m average time
80% success
0/40
Asked in company
Josh Technology Group

Given a set of ‘N’ nuts of different sizes and ‘N’ bolts of different sizes. There is a one-one mapping between nuts and bolts. Your task is to fin...

View more
Problem approach

Solution 1: I tried solving this problem with brute force way first, starting with the first bolt and compare it with each nut until we find a match. In the worst case we require n comparisons. Doing this for all bolts gives O(n^2) complexity. hence i was asked to optimize it further,

Solution 2:I tried using the hashmap and came up to the solution as well.
Step 1: Traverse the nuts a...

View more
Try solving now
Join the Discussion
2 replies
profile
6 months ago

I have done Java and Python, however the 50 questions you are telling are from C and C++, do I need to go through it? I know C but I am not well equipped with C++. I will also be going through campus placements.

0 upvotes
0 replies
Reply
profile
15 Feb 2021

why were you rejected?

3 upvotes
1 reply
Reply
Similar interview experiences
company logo
SDE - Intern
2 rounds | 3 problems
Interviewed by Josh Technology Group
650 views
0 comments
0 upvotes
company logo
SDE - Intern
6 rounds | 14 problems
Interviewed by Josh Technology Group
3545 views
0 comments
0 upvotes
company logo
SDE - Intern
6 rounds | 16 problems
Interviewed by Josh Technology Group
3405 views
3 comments
0 upvotes
company logo
SDE - Intern
3 rounds | 5 problems
Interviewed by Josh Technology Group
365 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - Intern
2 rounds | 4 problems
Interviewed by Arcesium
2471 views
0 comments
0 upvotes
company logo
SDE - Intern
3 rounds | 5 problems
Interviewed by Arcesium
1532 views
0 comments
0 upvotes
company logo
SDE - Intern
3 rounds | 5 problems
Interviewed by BNY Mellon
1385 views
0 comments
0 upvotes