Jio Platforms Software Developer Interview Questions, Process, and Tips

Q1. Family background. Company products.
Add your answer
Q2. Short term and long term goals
Add your answer

Q1. Embedded C ASPICE Advance Controller communication protocol
Add your answer

1 easy and 1 medium questions were asked

Q1. Question was asked about Java, Spring and easy level DSA
Add your answer
Q2. Dbms and microservices related Questions were also asked
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

The Timing was in the Morning. The Environment is simple, easy to use no webcam and no microphone enabled but there is only one requirement not to change browser tab.

Q1. 
Rotting Oranges Problem Statement
You are given a grid containing oranges where each cell of the grid can contain one of the three integer values:
• 0 - representing an empty cell
• 1 - representing a fre...read more
Ans. 
Find the minimum time required to rot all fresh oranges in a grid.
• Use Breadth First Search (BFS) to simulate the rotting process.

• Track the time taken to rot all oranges and return the result.

• Handle edge cases like no fresh oranges or unreachable fresh oranges.

• Consider using a queue to efficiently process adjacent oranges.
Answered by AI
Add your answer
Q2. 
Rotate Linked List Problem Statement
Given a linked list consisting of 'N' nodes and an integer 'K', your task is to rotate the linked list by 'K' positions in a clockwise direction.
Example:
Input:
Li...read more
Ans. 
Rotate a linked list by K positions in a clockwise direction.
• Traverse the linked list to find the length and the last node.

• Connect the last node to the head to form a circular linked list.

• Find the new head by moving (length - K) steps from the original head.

• Break the circular list at the new head to get the rotated linked list.
Answered by AI
Add your answer

Round duration - 80 minutes
Round difficulty - Easy

Timing was 6 PM
environment name is AmCAT, it's good and simple.

Interviewer was friendly used to give u some advice lke can we do this step.

Q1. 
Circular Tour Problem Statement
Consider a circular path with N petrol pumps. Each pump is numbered from 0 to N-1. Every petrol pump provides:
1. The amount of petrol available at the pump.
2. The distanc...read more
Ans. 
The task is to find the first petrol pump from which a truck can complete a full circle or determine if it's impossible.
• Iterate through each petrol pump and calculate the remaining petrol after reaching the next pump.

• If the remaining petrol is negative at any point, reset the starting pump to the next pump and continue.

• If the total remaining petrol is non-negative after completing the circle, return the index of the st...read more
Answered by AI
Add your answer
Q2. 
Min Stack Problem Statement
Design a special stack that supports the following operations in constant time:
1. Push(num): Insert the given number into the stack.
2. Pop: Remove and return the top element ...read more
Ans. 
Design a special stack that supports constant time operations like push, pop, top, and getMin.
• Use two stacks - one to store the elements and another to store the minimum values encountered so far

• When pushing, check if the element is smaller than the current minimum and update the minimum stack accordingly

• For pop, top, and getMin operations, simply access the top elements of the respective stacks

• Ensure to handle cases w
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

Timing was 11 am 
Environment is AMCAT it. was very simple.
Interview was a bit strict not to giving a hint of the direction to think, just said whenever you have a solution just tell me.

Q1. 
Unique Paths Problem Statement
Given the dimensions of an M x N matrix, determine the total number of unique paths from the top-left corner to the bottom-right corner of the matrix.
Allowed moves are onl...read more
Ans. 
The problem involves finding the total number of unique paths from the top-left corner to the bottom-right corner of an M x N matrix with allowed moves only to the right or down.
• Use dynamic programming to solve the problem efficiently.

• Create a 2D array to store the number of unique paths for each cell in the matrix.

• Initialize the first row and first column with 1 as there is only one way to reach each cell in the first...read more
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

Timing was around 8 PM
environment name is Microsoft Tea ms,

Interviewer was friendly.

Q1. Why do you want to join JIO?
Add your answer