Jio Platforms Limited interview experience Real time questions & tips from candidates to crack your interview

SDE - 1

Jio Platforms Limited
upvote
share-icon
4 rounds | 14 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 3 Months
Topics: Company wise coding questions on gfg, operating systems, networking,CPP, Java, spring boot, topic wise coding questions, behavioural questions
Tip
Tip

Tip 1 : practise coding a lot
Tip 2 : practise system design interviews
Tip 3 : keep basics of is, networking, cryptography, distributed computing clear
Tip 4 : be stress free during interviews

Application process
Where: Campus
Eligibility: Above 7 CGPA, No year gap in studies
Resume Tip
Resume tip

Tip 1 : keep resume small and filled
Tip 2 : mention all experience related to job, maybe need to change according to different jobs
Tip 3 : extra curricular is mostly not required, but can be used as a filler

Interview rounds

01
Round
Easy
Online Coding Test
Duration90 Minutes
Interview date23 Sep 2021
Coding problem2

Timing : 9AM
Hackerrank test platform
Was needed to solve two problems completely

1. N-th Node From The End

Easy
10m average time
90% success
0/40
Asked in companies
Thought WorksHikeAmazon

You are given a Singly Linked List of integers. You have to find the N-th node from end.

For Example
If the given list is (1 -> -2 -> 0 -> 4) and N=2:

example

Then the 2nd node from the end is 0.
Problem approach

Iter over list, if n = 1, return element past head, otherwise, iterate untill nth element, remove it and return head of list

Try solving now

2. Merge k sorted lists

Hard
25m average time
65% success
0/120
Asked in companies
MicrosofteBayAmazon

Given 'k' sorted linked lists, each list is sorted in increasing order. You need to merge all these lists into one single sorted list. You need to return the head of the final linked list.


For example:
Input:
3
3
4 6 8
3
2 5 7 
2
1 9

Output:
1 2 4 5 6 7 8 9 

Explanation:
First list is: 4 -> 6 -> 8 -> NULL
Second list is: 2 -> 5 -> 7 -> NULL
Third list is: 1 -> 9 -> NULL
The final list would be: 1 -> 2 -> 4 -> 5 -> 6 -> 7 -> 8 -> 9 -> NULL
Problem approach

Create a priority queue of heads of linked list. While there are elements in priority queue. Remove smallest head. Add it to another list. Increase the head. If there are more elements in that list. Add the head back to priority queue.

Try solving now
02
Round
Easy
Video Call
Duration45 Minutes
Interview date23 Jun 2022
Coding problem3

Timing : 2 PM
It was a technical coding round
Needed to solve 3 problems,
2 on coding
1 on simple design

1. Puzzle

You are given a multicore server and a distributed queue. You need to fetch elements from queue and store them into db.

Told a solution of running a master thread, which checks the queue and allocats more thread for processing entries.

Problem approach

Tip 1 : ask more questions about the problem
Tip 2 : no solution is best, starting with a simple approach is ok
Tip 3 : cleanly communicate your thinking

2. Intersection of Two Linked Lists

Easy
25m average time
73% success
0/40
Asked in companies
Hewlett Packard EnterpriseSamsungIntuit

You are given two Singly Linked Lists of integers, which may have an intersection point.

Your task is to return the first intersection node. If there is no intersection, return NULL.


Example:-
The Linked Lists, where a1, a2, c1, c2, c3 is the first linked list and b1, b2, b3, c1, c2, c3 is the second linked list, merging at node c1.

alt.txt

Problem approach

First iterate both the lists and find there lengths. Then start at both the heads of list. Move the head of longer list by difference of their lengths. Now move both heads together. As soon as both heads point to same element, we have found the first common element.

Try solving now

3. Balanced parentheses

Moderate
10m average time
90% success
0/80
Asked in companies
WalmartMakeMyTripGoldman Sachs

Given an integer ‘N’ representing the number of pairs of parentheses, Find all the possible combinations of balanced parentheses with the given number of pairs of parentheses.

Note :

Conditions for valid parentheses:
1. All open brackets must be closed by the closing brackets.

2. Open brackets must be closed in the correct order.

For Example :

()()()() is a valid parentheses.
)()()( is not a valid parentheses.
Problem approach

Create a stack. 
Iterate over string.
If it is opening bracket in stack, add to stack
Otherwise 
If top symbol in stack matches this bracket, remove it
Otherwise
Invalid = true

If stack is not empty
Invalid = true

Try solving now
03
Round
Medium
Video Call
Duration45 Minutes
Interview date23 Jun 2022
Coding problem3

1. Technical Question

What test cases will check for a program which moves files.

Problem approach

Tip 1 : don't stress too much
Tip 2 : keep calm and think about problem


Answer I gave:
1. Checking with a large file
2. Checking moved file for corruption
3. Checking for moved file going disappeared
4. Checking for program stuck

2. Output Question

What is the output of i = 100; --(i++)

Problem approach

Answer : 99

3. OS Question

Asked about college projects, course taken online and self study. Asked about books read and what am I doing these days. Questions related to courses taken recently. Questions about distributed computing, nosql as such.

04
Round
Easy
HR Round
Duration45 minutes
Interview date23 Jun 2022
Coding problem6

Timing : 11PM
Hr behavioural round
Asked questions about past experiences with team mates, why u want to join jio as such.

1. Basic HR Question

How will u explain to your grand mother what job do you do.

Problem approach

I answered " i will say i work on computer and do computer job. That will be enough for her". He seemed ok.

2. Basic HR Question

Why you want to join jio.

Problem approach

I answered "jio is an Indian company, which brought internet data revolution. I and my family are using jio right now". He seemed happy with we using jio sim.

3. Basic HR Question

Explain any bad experience you have working with team.

Problem approach

I explained a college project experience with any negativity. He seemed ok with it.

4. Basic HR Question

Are you ok working in team or alone.

Problem approach

I am ok with both. I have done work alone and in team in past.

5. Basic HR Question

Explain any last minute hush movement experience.

Problem approach

I told him about our projects and classes are many time last minute hush or sudden. He didn't mind it.

6. Basic HR Question

Are you ok to relocate

Problem approach

Yes

Here's your problem of the day

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

Skill covered: Programming

What is recursion?

Choose another skill to practice
Similar interview experiences
SDE - 1
4 rounds | 4 problems
Interviewed by Jio Platforms Limited
1181 views
0 comments
0 upvotes
SDE - 1
3 rounds | 3 problems
Interviewed by Jio Platforms Limited
1086 views
0 comments
0 upvotes
SDE - 1
4 rounds | 9 problems
Interviewed by Jio Platforms Limited
1119 views
0 comments
0 upvotes
SDE - 1
3 rounds | 4 problems
Interviewed by Jio Platforms Limited
1041 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
114579 views
24 comments
0 upvotes
company logo
SDE - 1
4 rounds | 5 problems
Interviewed by Microsoft
57825 views
5 comments
0 upvotes
company logo
SDE - 1
3 rounds | 7 problems
Interviewed by Amazon
34961 views
7 comments
0 upvotes