Josh Technology Group interview experience Real time questions & tips from candidates to crack your interview

# SDE - Intern

Josh Technology Group
2 rounds | 3 Coding problems

## Interview preparation journey

Preparation
Duration: 1.5 Months
Topics: Data Structures, Pointers, OOPS, System Design, Algorithms, Dynamic Programming
Tip

Tip 1 : Practice Data Structures and algorithms.
Tip 2 : Do 2 projects.
Tip 3 : Practice mcq too.

Application process
Where: Campus
Eligibility: 7 CGPA
Resume tip

Tip 1 : Do not put false things on resume.
Tip 2 : Keep it short.

## Interview rounds

01
Round
Easy
Online Coding Interview
Duration60 minutes
Interview date15 Feb 2021
Coding problem0

Timing was 11 AM. Platform was good. The round was only MCQ.

02
Round
Medium
Online Coding Interview
Duration60 minutes
Interview date15 Feb 2021
Coding problem3

Timing was late. Environment was good.

### 1. Dijkstra's shortest path

Moderate
25m average time
65% success
0/80

#### Example:

``````Input:
4 5
0 1 5
0 2 8
1 2 9
1 3 2
2 3 6
``````

``````In the given input, the number of vertices is 4, and the number of edges is 5.

In the input, following the number of vertices and edges, three numbers are given. The first number denotes node ‘X’, the second number denotes node ‘Y’ and the third number denotes the distance between node ‘X’ and ‘Y’.

As per the input, there is an edge between node 0 and node 1 and the distance between them is 5.

The vertices 0 and 2 have an edge between them and the distance between them is 8.
The vertices 1 and 2 have an edge between them and the distance between them is 9.
The vertices 1 and 3 have an edge between them and the distance between them is 2.
The vertices 2 and 3 have an edge between them and the distance between them is 6.
``````

#### Note:

``````1. There are no self-loops(an edge connecting the vertex to itself) in the given graph.

2. There can be parallel edges i.e. two vertices can be directly connected by more than 1 edge.
``````

Easy
0/40

### 3. 0 1 Knapsack

Easy
15m average time
85% success
0/40

#### A thief is robbing a store and can carry a maximal weight of W into his knapsack. There are N items and the ith item weighs wi and is of value vi. Considering the constraints of the maximum weight that a knapsack can carry, you have to find and return the maximum value that a thief can generate by stealing items.

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

What does ROLLBACK do in DBMS?

Start a Discussion
Similar interview experiences
SDE - Intern
6 rounds | 14 problems
Interviewed by Josh Technology Group
4250 views
SDE - Intern
5 rounds | 6 problems
Interviewed by Josh Technology Group
2602 views
SDE - Intern
7 rounds | 7 problems
Interviewed by Josh Technology Group
747 views
SDE - Intern
3 rounds | 5 problems
Interviewed by Josh Technology Group
783 views
Companies with similar interview experiences
SDE - Intern
2 rounds | 4 problems
Interviewed by Arcesium
3073 views