JUSPAY interview experience Real time questions & tips from candidates to crack your interview

Security Engineer

JUSPAY

3 rounds | 7 Coding problems

Anonymous

Experienced | Mar 2021

Selected

Interview preparation journey

Preparation

Duration: 6 Months

Topics: DSA, Computer Networks, Web Applications, Penetration Testing

Tip

Tip 1 : Basics should be strong.
Tip 2 : Practice Regularly.
Tip 3 : Apply to the projects what you've learnt

Application process

Where: Campus

Eligibility: Above 7.5 CGPA

Resume tip

Tip 1 : Resume should be neat and readable.
Tip 2 : Do not write anything which you don't know.

Interview rounds

Round

Easy

Online Coding Interview

Duration90 minutes

Interview date1 Mar 2021

Coding problem3

There were 3 coding questions based on Data structures and algorithms.

1. Biconnected Components

Hard

70m average time

20% success

0/120

Asked in companies

You are given an undirected graph of N nodes and M edges. You are required to find out the number of bi-connected components of the graph. We donot count an isolated vertex as a biconnected component

For Example:

Consider the following graph

4 4
1 3
1 2
2 3
3 4

The graph has two bi-connected components 

1 - 2, 2 - 3, 3 - 1

3 - 4

Hence the output is 2.

Problem approach

I did the question as I was instructed by my colleagues and as I had practised it before.

Try solving now

2. Shortest Distance

Easy

10m average time

90% success

0/40

Asked in companies

You have been given a Binary Search Tree and two keys 'NODE1' and 'Node2' in it.

Your task is to find the shortest distance between two nodes with the given two keys. It may be assumed that both keys exist in BST.

Example:

For the above BST:
‘NODE1’ = 6, ‘NODE2’ = 14

Distance between 6 and 14 = (Number of nodes in the path from 6 to 14) + 1.
So the path from 6 to 14 is : ( 6 -> 3 -> 8 -> 10 -> 14).

Distance between 6 and 14 = 3 ( i.e. 3, 8, 10 are in path) + 1 = 4.

Problem approach

If ‘NODE1 > NODE2’, then:
- ‘swap(NODE1, NODE2)’. Make sure that ‘NODE1’ stores the smaller key.
If ‘ROOT->DATA > NODE1’ and ‘ROOT->DATA > NODE2’, then the LCA lies in the left subtree:
- Return ‘distanceBetween2(ROOT->LEFT, NODE1, NODE2)’.
If ‘ROOT->DATA < NODE1’ and ‘ROOT->DATA < NODE2’, then the LCA lies in the right subtree:
- Return ‘distanceBetween2(ROOT->RIGHT, NODE1, NODE2)’.
If ‘ROOT->DATA >= NODE1’ and ‘ROOT->DATA <= NODE2’, then the ‘ROOT’ node is LCA, so find the distance between ‘NODE1’ to ‘ROOT’ and ‘NODE2’ to ‘ROOT’:
- Return ‘distancefromRoot(ROOT, NODE1) + distancefromRoot(ROOT, NODE2)’.

Try solving now

3. Bridges In A Graph

Moderate

25m average time

65% success

0/80

Asked in companies

Given an undirected graph of V vertices and E edges. Your task is to find all the bridges in the given undirected graph. A bridge in any graph is defined as an edge which, when removed, makes the graph disconnected (or more precisely, increases the number of connected components in the graph).

For Example :

If the given graph is :

Then the edge between 0 and 4 is the bridge because if the edge between 0 and 4 is removed, then there will be no path left to reach from 0 to 4.and makes the graph disconnected, and increases the number of connected components.

Note :

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

There are no parallel edges i.e no two vertices are directly connected by more than 1 edge.

Problem approach

I was not able to do this question. I only did the brute force approach for this.

Try solving now

Round

Easy

Video Call

Duration60 minutes

Interview date15 Mar 2021

Coding problem2

I was asked questions related to DB.
Then we discussed the projects on my resume and he cross questioned about the stacks I used in my projects.