Jio Platforms Limited interview experience Real time questions & tips from candidates to crack your interview
Software Engineer
Jio Platforms Limited
3 rounds | 3 Coding
problems
Selected Interview preparation journey
Journey
During my B.tech, our seniors informed us how important DSA is to crack placements. Therefore, I started practising DSA from GeeksFromGeeks, Leetcode and codestudio right from my second year. I practise a lot of questions. Also, I focused on core subjects as well properly.
Application story
This company visited our campus for the placement. First, they took the online assessment. Later, they called us for the interview rounds.
Why selected/rejected for the role?
I was able to get all answers correctly and solve given DSA problems optimally thats why i got selected for this role. I gave the space and time complexity as well for every solution that I told, which made an impression that I have a clear and deep knowledge of all the algorithms.
Preparation
Duration: 6 months
Topics: Data Structures, OOPS, Algorithms, Dynamic Programming, Operating system
Tip 1 : Learn to explain your thoughts well
Tip 2 : Atleast 4 projects in Resume
Tip 3 : Learn from previous experiences / interviews / problems asked.
Application process
Where: Campus
Eligibility: Above 7 CGPA
Tip 1 : Mention short description of your team projects and individual as well
Tip 2 : Keep it simple and readable and don't bluff
Interview rounds
01
Round
Hard
Online Coding Test
Duration90 minutes
Interview date20 Nov 2020
Coding problem1
1. Convert Bst To The Greater Sum Tree
Moderate
30m average time
70% success
0/80
Asked in companies
You have been given a Binary Search Tree of integers. You are supposed to convert it to a greater sum tree such that the value of every node in the given BST is replaced with the sum of the values of all the nodes which are greater than the value of the current node in the tree.
A Binary Search Tree is a tree, whose internal nodes each store a value greater than all the values in the node's left subtree and less than those in its right subtree.
Note :
You need to modify the given tree only. You are not allowed to create a new tree.
For example:
For the given binary search tree
11 will be replaced by {15 + 29 + 35 + 40}, i.e. 119.
2 will be replaced by {7 + 11 + 15 + 29 + 35 + 40}, i.e. 137.
29 will be replaced by {35 + 40}, i.e. 75.
1 will be replaced by {2 + 7 + 11 + 15 + 29 + 35 + 40}, i.e. 139.
7 will be replaced by {11 + 15 + 29 + 35 + 40}, i.e. 130.
15 will be replaced by {15 + 29 + 35 + 40}, i.e. 104.
40 will be replaced by 0 {as there is no node with a value greater than 40}.
35 will be replaced by {40}, i.e. 40.
Problem approach
• The left subtree of a node contains only nodes with data less than the node’s data.
• The right subtree of a node contains only nodes with data greater than the node’s data.
• Both the left and right subtrees must also be binary search trees.
02
Round
Medium
Video Call
Duration60 mins
Interview date25 Apr 2020
Coding problem1
1. Spiral Order Traversal of a Binary Tree
Easy
20m average time
75% success
0/40
Asked in companies
You have been given a binary tree of 'N' nodes. Print the Spiral Order traversal of this binary tree.
For example
For the given binary tree [1, 2, 3, -1, -1, 4, 5, -1, -1, -1, -1]
1
/ \
2 3
/ \
4 5
Output: 1 3 2 4 5
Problem approach
Level 1 :
The root node of the tree is 1
Level 2 :
Left child of 1 = 2
Right child of 1 = 3
Level 3 :
Left child of 2 = 4
Right child of 2 = null (-1)
Left child of 3 = 5
Right child of 3 = 6
Level 4 :
Left child of 4 = null (-1)
Right child of 4 = 7
Left child of 5 = null (-1)
Right child of 5 = null (-1)
Left child of 6 = null (-1)
Right child of 6 = null (-1)
Level 5 :
Left child of 7 = null (-1)
Right child of 7 = null (-1)
The above format was just to provide clarity on how the input is formed for a given tree.
The sequence will be put together in a single line separated by a single space. Hence, for the above-depicted tree, the input will be given as:
1 2 3 4 -1 5 6 -1 7 -1 -1 -1 -1 -1 -1
03
Round
Easy
HR Round
Duration45 mins
Interview date3 Dec 2020
Coding problem1
1. Basic HR Questions
Asked me about my hobbies, and how I did my project
Problem approach
Tip 1: He will check your confidence.
Tip 2: work on communication skill.
Here's your problem of the day 
Solving this problem will increase your chance to get selected in this company
Skill covered: Programming
How do you remove whitespace from the start of a string?
Choose another skill to practice
Similar interview experiences
Software Engineer
4 rounds | 3 problems
Interviewed by Jio Platforms Limited
Selected 
1903 views
0 comments
0 upvotes
SDE - 1
3 rounds | 3 problems
Interviewed by Jio Platforms Limited
Selected 1122 views
0 comments
0 upvotes
Specialist Programmer
3 rounds | 7 problems
Interviewed by Jio Platforms Limited
Selected 891 views
0 comments
0 upvotes
Software Engineer
3 rounds | 6 problems
Interviewed by Jio Platforms Limited
Selected 737 views
0 comments
0 upvotes
Companies with similar interview experiences
Software Engineer
3 rounds | 7 problems
Interviewed by Optum
Selected 7976 views
1 comments
0 upvotes
Software Engineer
5 rounds | 5 problems
Interviewed by Microsoft
Selected 10148 views
1 comments
0 upvotes
Software Engineer
2 rounds | 4 problems
Interviewed by Amazon
Selected 4447 views
1 comments
0 upvotes