Jio Platforms Limited interview experience Real time questions & tips from candidates to crack your interview
SDE - 1
Jio Platforms Limited
4 rounds | 4 Coding
problems
Selected Interview preparation journey
Preparation
Duration: 3 months
Topics: DSA problems, Spring Boot, Java, OOPs and SOLID principles, Micro Services, Rest APIs, MySQL
Tip 1 : Prepare core concepts of OOPs and SOLID principles with some examples.
Tip 2 : Practice DSA Medium level question (Trees, Heaps, LinkedList, Dynamic Programming, BFS-DFS, Two pointer, Backtracking)
Tip 3 : For OA round, Prepare Spring Boot core concepts (For MCQs) along with DSA.
Application process
Where: Other
Eligibility: minimum 1 year of experience
Tip 1 : Mention all the previous projects tasks/achievements point wise along with the Tech Stack used.
Tip 2 : Practice explaining projects which were part of your work experience and be ready for follow up questions.
Tip 3 : Specify relevant skills and certificates in the resume.
Interview rounds
01
Round
Medium
Online Coding Interview
Duration70 minutes
Interview date26 Jun 2021
Coding problem2
Link was active for 24 hours, I took the test at night.
Difficulty was medium.
There were some MCQs on Springboot/Java along with 2 DSA questions.
1. Zigzag Binary Tree Traversal
Easy
10m average time
90% success
0/40
Asked in companies
You are given a ‘Binary Tree’.
Return the level-order traversal of the Binary Tree.
Example:
Input: Consider the following Binary Tree:
Output:
Following is the level-order traversal of the given Binary Tree: [1, 2, 3, 5, 6, 4]
Problem approach
Applied BFS for level order traversal.
The core logic is how to append the current level nodes in the resultList.
If currLevel is even:
then append the curr level node list as it is to the resultList
else:
reverse the curr level node list and then append to the resultList.
Finally return the resultList.
2. K Closest Points to Origin
Moderate
25m average time
75% success
0/80
Asked in companies
Your house is located at the origin of a 2-D plane. You have 'N' neighbours who live at 'N' different points on the plane. You want to visit exactly 'K' different neighbours who live closest to your house, you are given a 2 - D matrix 'POINTS'. So, find out the coordinates of the neighbours you are going to visit. The answer is guaranteed to be unique.
Note:
The distance between two points on a plane is the Euclidean Distance.
For Example:
If N = 2, K = 1 and the points are {2,3}, {-1, 2}.
Then the distance of the first point from the origin is sqrt((2 - 0) ^ 2 + (3 - 0) ^ 2) = sqrt(13).
The distance of the second point from the origin is sqrt((-1 - 0) ^ 2 + (2 - 0) ^ 2) = sqrt(5).
Follow Up:
Can you solve this in O(N log K) time complexity?
Problem approach
As we need to find K closest restaurants to the source (0,0), I used priority queue(MaxHeap) in python to eliminate all the farthest restaurants and have only k closest restaurants left at the end of the loop.
I had stored the elements in priority Queue as a pair [distance, coordinates], so that at I can directly get the coordinates for the k closest restaurants to return in the result.
02
Round
Medium
Video Call
Duration60 minutes
Interview date9 Jul 2021
Coding problem1
Technical round (Questions on Java, Spring Boot, Microservices, Rest APIs, OOPs and Solid principals).
1. Technical Questions
Why is multiple inheritance not allowed in java?
What is time theta?
What are java collections?
03
Round
Easy
Video Call
Duration60 minutes
Interview date12 Jul 2021
Coding problem0
It was a Hiring Manager Round where I was asked asked questions on my past work experience projects.
He was digging dip into each task which i did in previous project and asking multiple follow up questions.
Then there were questions on cloud computing, distributed systems, caching, scaling, deployment etc.
04
Round
Easy
HR Round
Duration45 minutes
Interview date13 Jul 2021
Coding problem1
1. Basic HR Questions
How was your previous work experience?
What are your strengths and weaknesses?
What are your hobbies?
Salary Discussions.
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
2 rounds | 1 problems
Interviewed by Jio Platforms Limited
Selected 
1338 views
0 comments
0 upvotes
SDE - 1
3 rounds | 3 problems
Interviewed by Jio Platforms Limited
Selected 1086 views
0 comments
0 upvotes
SDE - 1
4 rounds | 9 problems
Interviewed by Jio Platforms Limited
Selected 1119 views
0 comments
0 upvotes
SDE - 1
3 rounds | 4 problems
Interviewed by Jio Platforms Limited
Selected 1042 views
0 comments
0 upvotes
Companies with similar interview experiences
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
Selected 114579 views
24 comments
0 upvotes
SDE - 1
4 rounds | 5 problems
Interviewed by Microsoft
Selected 57825 views
5 comments
0 upvotes
SDE - 1
3 rounds | 7 problems
Interviewed by Amazon
Selected 34961 views
7 comments
0 upvotes