Reliance Jio Interview Experience for 2023

Reliance Jio Interview Experience

Are you looking for the latest Reliance Jio Interview Experience? You are in the right place. Get the latest Reliance Jio Interview Experiences on this page.

Page Highlights:

  • About Reliance Jio
  • Reliance Jio Recruitment Process
  • Reliance Interview Experience
  • FAQs on Reliance Jio Interview

About Reliance Jio 

Reliance Jio Infocomm Limited, also known as Jio, is an Indian telecommunications company and a subsidiary of Jio Platforms based in Navi Mumbai, Maharashtra, India. It operates a countrywide LTE network that covers all 22 telecom circles.

For additional details check out: www.jio.com

Reliance Jio Recruitment Process

The recruitment process consists of three rounds in the interview process

  • L0 Round
  • Written Round
  • Interview Round

Written Round

There are four rounds in the written test of the Reliance Jio. They are:-

  • Logical Reasoning
  • Numerical Ability
  • Basic Programming  
  • Coding Questions
Reliance JioTotal QuestionTotal Total Time
Logical Reasoning12-15 (Shared with Numerical)75mins (Shared)
Numerical Ability12-15 (Shared with Logical)75 mins (Shared)
Basic Programming3-675 mins (Shared)
Coding Questions275mins (Shared)
Total2075 mins

NOTE: The total number of questions (20) is fixed, although sectional questions may differ across students.

Reliance Jio Syllabus

Reliance Jio Interview Experience

1. Reliance Jio Interview Experience

We were informed by the placement cell that Reliance Jio will be visiting our campus to conduct a hiring process. So I did not waste any time applying for the job. After that, I was selected for the first round of the Interview i.e., the technical interview (L0). 

The Reliance Jio interview is divided into these four parts:

  • Round 1: (L0) Technical Interview 
  • Round 2: Written Assessment
  • Round 3:  Interview Round (TR+HR)

Round 1: Technical Interview (L0)

This is the first round of the interview. This round was basically a coding round where I was asked two questions and a few other basic theoretical questions that lasted for 40mins.

  1. Write a program to find the equilibrium index of an array.
import java.util.*;

public class PrepInsta
{
    static int equilibrium_index(int arr[], int n)
    {
        int sum = 0;
        int leftsum = 0;

        for (int i = 0; i < n; ++i)
            sum += array[i];

        for (int i = 0; i < n; ++i) {
            sum -= array[i];

            if (leftsum == sum)
                return i;

            leftsum += array[i];
        }

        return -1;
    }

    public static void main(String[] args)
    {
        int arr[] = { 1,2,3,4,5,1,3,2,4 };
        int arr_size = arr.length;
        System.out.print("Equilibrium Index : ");
        System.out.println(equilibrium_index(arr, arr_size));
    }
}

  1. Write a program to find the next permutation.
import java.util.Arrays;
public
class Main {
    public
    static int[] swap(int data[], int left, int right) {
        // Swap the data
        int temp = data[left];
        data[left] = data[right];
        data[right] = temp;
        // Return the updated array
        return data;
    }
    public
    static int[] reverse(int data[], int left, int right) {
        // Reverse the sub-array
        while (left < right) {
            int temp = data[left];
            data[left++] = data[right];
            data[right--] = temp;
        }
        // Return the updated array
        return data;
    }
    public
    static boolean findNextPermutation(int data[]) {
        if (data.length <= 1) return false;        
        int last = data.length - 2;        
         while (last >= 0) {
            if (data[last] < data[last + 1]) {
                break;
            }
            last--;
        }
        if (last < 0) return false;        
        int nextGreater = data.length - 1;      
       // Find the rightmost successor to the pivot        
        for (int i = data.length - 1; i > last; i--) {
            if (data[i] > data[last]) {
                nextGreater = i;
                break;
            }
        }
        data = swap(data, nextGreater, last);
        data = reverse(data, last + 1, data.length - 1);
        return true;
    }

    // Driver Code
    public

    static void main(String args[]) {
        int data[] = {1, 2, 3, 7};
        if (!findNextPermutation(data))
            System.out.println("There is no higher" + " order permutation " +
                               "for the given data.");
        else {
            System.out.println(Arrays.toString(data));
        }
    }
}
  1. Define Version Control System (VCS).

Answer: A version control system is referred to as a tool that keeps track of all changes made to a certain project and enables us to determine whether or not all developers in a team are working on the same project. It keeps track of all activity, giving a developer the confidence to fix a bug, make changes, or run a test knowing that if something goes wrong, past work can be recovered at any time.

  1. What do you mean by Object Oriented Programming?
  2. What is Artificial Intelligence?

Round 2: Written Assessment

Written assessment is the second round of the Reliance Jio Interview. This round had 4 sections:

Total time Allotted: 75mins

Total questions: 20 questions

  • Section 1: Logical Reasoning 
  • Section 2: Numerical Ability
  • Section 3: Basic Programming questions
  • Section 4: Coding Questions

In this round, both logical reasoning and numerical ability had combined 18 questions. The coding section had 2 questions.

Round 3: Interview Round

I cleared the written round, and I was called for the final interview round. Where basically, I was asked technical as well as HR questions. This round lasted for about 20 mins. The questions that I was asked are as follows:

  1. Tell me about yourself.
  2. Explain your final year project in detail.
  3. What is pointer to pointer in C?
  4. What do you know about data structure?
  5. What are the different types of computer networks?
  6. What is synchronization?

Answer: Synchronization is the ability to control how many threads can access a single shared resource. The blocks and the methods are both referred to as “synchronised.” Only one thread may operate on the supplied object at once if a method is designated as synchronised. Synchronized keywords primarily help us avoid problems with inconsistent data.

  1. What are the different types of Schedulers in OS?

Answer: A scheduler can be divided into 3 types:

  • Long Term Scheduler
  • Short Term Scheduler
  • Medium Term Scheduler
  1. Write code for the LCA of a string.
#include 
#include 

struct node
{
   int data;
   struct node* left, *right;
};

struct node *lca(struct node* root, int n1, int n2)
{
   while (root != NULL)
   {
       if (root->data > n1 && root->data > n2)
       root = root->left;

       else if (root->data < n1 && root->data < n2)
       root = root->right;

       else break;
   }
   return root;
}


struct node* newNode(int data)
{
   struct node* node = (struct node*)malloc(sizeof(struct node));
   node->data = data;
   node->left = node->right = NULL;
   return(node);
}

int main()
{
   struct node *root     = newNode(20);
   root->left             = newNode(8);
   root->right             = newNode(22);
   root->left->left         = newNode(4);
   root->left->right     = newNode(12);
   root->left->right->left = newNode(10);
   root->left->right->right = newNode(14);

   int n1 = 10, n2 = 14;
   struct node *t = lca(root, n1, n2);
   printf("LCA of %d and %d is %d \n", n1, n2, t->data);

   n1 = 14, n2 = 8;
   t = lca(root, n1, n2);
   printf("LCA of %d and %d is %d \n", n1, n2, t->data);

   n1 = 10, n2 = 22;
   t = lca(root, n1, n2);
   printf("LCA of %d and %d is %d \n", n1, n2, t->data);

   getchar();
   return 0;
}
  1. Are you ready to relocate?
  2. Have you ever handled any disagreements while making your project?
  3. What do you know about Reliance Jio?
  4. Why Reliance Jio?
  5. Do you have any questions for me?

Thank you.

2. Reliance Jio Interview Experience

I would like to share my Reliance Jio interview experience with PrepInsta. I also used PrepInsta resources and materials for interview preparation.

I applied for a role at Reliance Jio and was invited for the L0 round interview.

Round 1: L0 Interview 

In this round, I was mainly asked coding questions. There were two coding questions asked to me. 

  1. Write a code for Heap sort.
#include // including library files
int temp;
void heapify(int arr[], int size, int i)//declaring functions
{
int max = i;
int left = 2*i + 1;
int right = 2*i + 2;
if (left < size && arr[left] >arr[max])
max= left;

if (right < size && arr[right] > arr[max])
max= right;

if (max!= i)
{
// performing sorting logic by using temporary variable
temp = arr[i];
arr[i]= arr[max];
arr[max] = temp;
heapify(arr, size, max);
}
}

void heapSort(int arr[], int size)// providing definition to heap sort
{
int i;
for (i = size / 2 - 1; i >= 0; i--)
heapify(arr, size, i);
for (i=size-1; i>=0; i--)
{
// swaping logic
temp = arr[0];
arr[0]= arr[i];
arr[i] = temp;
heapify(arr, i, 0);
}
}

void main() // defining main()
{
int arr[] = {58, 134, 3, 67, 32, 89, 15, 10,78, 9};
// array initializing with their elements.
int i;
int size = sizeof(arr)/sizeof(arr[0]);

heapSort(arr, size);

printf("printing sorted elements\n"); // printing the sorted array
for (i=0; i<size; ++i)
printf("%d ",arr[i]);
}
  1. Write a C++ program for implementing a queue using two stacks.
#include<bits/stdc++.h>
using namespace std;
class Queue
{
public:
stack s1,s2;
void Push(int i)
{
cout<<“Pushing the element : “<<i<<endl;
s1.push(i);
}
int pop()
{
if(s1.empty()) {cout<<“The queue is empty”<<endl;return –1;}
while(!s1.empty())
{s2.push(s1.top());s1.pop();}
int b=s2.top();s2.pop();
cout<<“Popping the element : “<<b<<endl;
while(!s2.empty())
{s1.push(s2.top());s2.pop();}
return b;
}
void Show()
{
while(!s1.empty())
{
s2.push(s1.top());s1.pop();
}
while(!s2.empty())
{
cout<<s2.top()<<” “;
s1.push(s2.top());s2.pop();
}
}
int front()
{
if(s1.empty()) {cout<<“The queue is empty”<<endl;return –1;}
while(!s1.empty())
{s2.push(s1.top());s1.pop();}
int b=s2.top();
while(!s2.empty())
{s1.push(s2.top());s2.pop();}
return b;
}
};

int main()
{
Queue q;
q.Push(1);q.Push(5);q.Push(2);q.Push(11);
cout<<“The Queue now is : “;
q.Show();cout<<endl;
cout<<“The front value right now is : “<<q.front()<<endl;
q.pop();q.pop();
q.Push(12);q.Push(8);
cout<<“The front value right now is : “<<q.front()<<endl;
cout<<“The Queue now is : “;
q.Show();cout<<endl;
}

After clearing this round, I was asked to wait for the upcoming notification.

Round 2: Written Assessment 

After a few days of the first round, I was invited for the written test. There were four sections.

  • Logical Reasoning 
  • Numerical Ability 
  • Basic Programming Questions
  • Coding Questions

Total time Allotted= 75mins

Total no. of questions= 20questions 

Round 3: Final Interview 

Soon after successful completion of the written test, I received an Email regarding my shortlisting for the final round of the interview process. The questions were:-

  1. Tell me about yourself.
  2. What is Encapsulation?

Answer: Encapsulation is a feature of an entity that holds all secret data. The members of that class can only see the hidden details. Public, Protected, and Private are the different levels.

  1. Tell me about the technologies you have used in your projects.
  2. Define constructor.
  3. What do you know about Reliance Jio?
  4. Why Reliance Jio?
  5. What are the basic clouds in cloud computing?

Answer: In cloud computing, there are three types of clouds:

  • Professional cloud
  • Personal cloud
  • Performance cloud
  1. Write a program to find the Armstrong number or not using JAVA.
public class Main
{
  public static void main (String[]args)
  {
    int num = 407, len;

    // function to get order(length)
      len = order (num);

    // check if Armstrong
    if (armstrong (num, len))
        System.out.println(num + " is armstrong");
    else
        System.out.println(num + " is armstrong");

  }


  static int order (int x)
  {
    int len = 0;
    while (x != 0 )
      {
    len++;
    x = x / 10;
      }
    return len;
  }

  static boolean armstrong (int num, int len)
  {

    int sum = 0, temp, digit;
    temp = num;

    // loop to extract digit, find power & add to sum
    while (temp != 0)
      {
    // extract digit
    digit = temp % 10;

    // add power to sum
    sum = sum + (int)Math.pow(digit, len);
    temp /= 10;
      };

    return num == sum;
  }
}
  1. Write a program to check whether a string is a valid shuffle of two strings or not in C++.
#include

 using namespace std;

  bool isvalid(string first, string second, string result){

  if(first.size() + second.size() != result.size()) {

    return false;

  }

 //Sort all the three string 

  sort(first.begin(),first.end());

  sort(second.begin(),second.end());

  sort(result.begin(),result.end());

 //iterate through the entire length of result string  

  int i=0,j=0,k=0;

  while( k < result.size()){

 //check if character of string first is equal to first character of result

  if( i>str1;

 

  cout<<"Enter the value of string 2 : "; cin>>str2;

 

  cout<<"Enter the string that need to be checked : "; cin>>str;

 

  if(isvalid(str1,str2,str)){

  cout<<"Yes its a valid shuffle ";

 }

 else{

  cout<<"No its not a valid shuffle ";

 }

 

  return 0;

}

  1. Do you have any questions for me?

The last round went perfectly. I received my result within two days of the interview, and I was pleased with my performance.

Thank you

3. Reliance Jio Interview Experience 

My friend recommended me for a position at Reliance Jio. I would like to take you all through my complete interview process. Most of the resources I used came from the PrepInsta Prime and PrepInsta websites.

Round 1: L0 Interview

The L0 round of the interview was the very first round. There were basically just two programming questions.

  1. Write a program for the largest sum contiguous subarray code.
// array sum 
import java.io.*; 

class prepinsta { 

    static int maxSubArraySum(int a[], int n) 
    { 
    int maxsofar = a[0]; 
    int curr_max = a[0]; 

    for (int i = 1; i < n; i++) 
    { 
        curr_max = Math.max(a[i], curr_max+a[i]); 
        maxsofar = Math.max(maxsofar, curr_max); 
    } 
    return maxsofar; 
    } 

    /* Driver program to test maxSubArraySum */
    public static void main(String[] args) 
    { 
    int a[] = {-2,1,-3,4,-1,2,1,-5,4}; 
    int n = a.length; 
    int max_sum = maxSubArraySum(a, n); 
    System.out.println(“Maximum contiguous sum is “
                    + max_sum); 
    } 
} 
  1. Write a program to find common elements In three sorted arrays.
#include
// Driver code
int main()
{
int n1;
scanf("%d", &n1);

int ar1[n1];
for(int i=0; i<n1; i++)
scanf("%d", &ar1[i]);

int n2;
scanf("%d", &n2);

int ar2[n2];
for(int i=0; i<n2; i++)
scanf("%d", &ar2[i]);

int n3;
scanf("%d", &n3);

int ar3[n3];
for(int i=0; i<n3; i++)
scanf("%d", &ar3[i]);

printf("Common Elements are ");

for(int i=0; i<n1; i++){

int flag = 0;
for(int j=0 ; j<n2; j++){

if(ar1[i]==ar2[j])
{

for(int k=0; k<n3; k++){

if(ar2[j]==ar3[k])
{
flag=1;
k++;
break;
}
}

j++;
break;
}
}

if(flag)
printf("%d ", ar1[i]);
}
return 0;
}

Round 2: Written Round

Second round was the written assessment which had three sections namely, logical, numerical ability, basic programming questions and also coding questions.

This round included 20 questions, including 2 coding questions in addition to 20 logical and numerical ability questions.

The section took 75 minutes to complete overall, and the difficulty level was moderate.

Round 3: Final Interview (TR+HR)

Questions asked in final Interview:

  1. Describe yourself in three words.
  2. Write a program for merge intervals.
import java.util.Arrays;
import java.util.Comparator;
import java.util.Stack;
public class Main {

public static void mergeIntervals(Interval arr[])
{
// Test if the given set has at least one interval
if (arr.length <= 0)
return;

// Create an empty stack of intervals
Stack stack=new Stack<>();

// sort the intervals in increasing order of start time
Arrays.sort(arr,new Comparator(){
public int compare(Interval i1,Interval i2)
{
return i1.start-i2.start;
}
});

// push the first interval to stack
stack.push(arr[0]);

// Start from the next interval and merge if necessary
for (int i = 1 ; i < arr.length; i++)
{
// get interval from stack top
Interval top = stack.peek();

// if current interval is not overlapping with stack top,
// push it to the stack
if (top.end < arr[i].start)
stack.push(arr[i]);

// Otherwise update the ending time of top if ending of current
// interval is more
else if (top.end < arr[i].end)
{
top.end = arr[i].end;
stack.pop();
stack.push(top);
}
}

// Print contents of stack
System.out.print("The Merged Intervals are: ");
while (!stack.isEmpty())
{
Interval t = stack.pop();
System.out.print("["+t.start+","+t.end+"] ");
}
}

public static void main(String args[]) {
Interval arr[]=new Interval[4];
arr[0]=new Interval(6,8);
arr[1]=new Interval(1,9);
arr[2]=new Interval(2,4);
arr[3]=new Interval(4,7);
mergeIntervals(arr);
}
}

class Interval
{
int start,end;
Interval(int start, int end)
{
this.start=start;
this.end=end;
}
}
  1. What is the functionality of the list?
  2. Define JDK.

The Java Development Kit (JDK), a cross-platform software development environment, offers a variety of tools and libraries necessary for building Java-based software applications and applets.

  1. What are the types of protocols?

Answer:

  • Transmission Control Protocol (TCP)
  • Internet Protocol (IP)
  • User Datagram Protocol (UDP)
  • Post office Protocol (POP)
  • Simple mail transport Protocol (SMTP)
  • File Transfer Protocol (FTP)
  • HyperText Transfer Protocol (HTTP)
  • HyperText Transfer Protocol Secure (HTTPS)
  1. Why Reliance Jio?
  2. Can you work under pressure?
  3. Are you comfortable working in night shift?
  4. What are the uses of cloud computing?
  5. Do you have any questions for us?

After a week, I received the results for the final round.

Thank you

4. Reliance Jio Interview Experience

I learned that Reliance Jio is hiring. I submitted my application right away, and two days later I received an invitation to the first round. I’ve shared in-depth details regarding my interview experience with you all below.

Round 1: L0 Round

In this round, I was asked to solve programming questions and other technical questions. This round lasted for about 35mins.

  1. What is an Operating System?
  2. What is a queue?

A data structure called a queue can resemble a list or stream of data. In this structure, new pieces are added to one end while removing existing ones from the other.

  1. Write a Java program to find the Next Permutation.
import java.util.Arrays;
public
class Main {
    public
    static int[] swap(int data[], int left, int right) {
        // Swap the data
        int temp = data[left];
        data[left] = data[right];
        data[right] = temp;
        // Return the updated array
        return data;
    }
    public
    static int[] reverse(int data[], int left, int right) {
        // Reverse the sub-array
        while (left < right) {
            int temp = data[left];
            data[left++] = data[right];
            data[right--] = temp;
        }
        // Return the updated array
        return data;
    }
    public
    static boolean findNextPermutation(int data[]) {
        if (data.length <= 1) return false;        
        int last = data.length - 2;        
         while (last >= 0) {
            if (data[last] < data[last + 1]) {
                break;
            }
            last--;
        }
        if (last < 0) return false;        
        int nextGreater = data.length - 1;      
       // Find the rightmost successor to the pivot        
        for (int i = data.length - 1; i > last; i--) {
            if (data[i] > data[last]) {
                nextGreater = i;
                break;
            }
        }
        data = swap(data, nextGreater, last);
        data = reverse(data, last + 1, data.length - 1);
        return true;
    }

    // Driver Code
    public

    static void main(String args[]) {
        int data[] = {1, 2, 3, 7};
        if (!findNextPermutation(data))
            System.out.println("There is no higher" + " order permutation " +
                               "for the given data.");
        else {
            System.out.println(Arrays.toString(data));
        }
    }
}
  1. Write a C++ program for Kadane’s Algorithm
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;

int arr[n];

for(int i=0; i<n; i++) cin>>arr[i];

int max_sum = INT_MIN, curr_sum =0;

for(int i=0; i<n; i++){

curr_sum += arr[i];

if(max_sum < curr_sum)
max_sum = curr_sum;

if(curr_sum < 0)
curr_sum = 0;

}

cout<<max_sum;

return 0;
}

Round 2: Written Test

After a week days of the first round, I got an invitation link for the written test. The written test has four sections:

  • Logical Reasoning 
  • Verbal Ability 
  • Basic Programming questions
  • Coding questions

In this round, logical, programming, coding and numerical ability had 20 questions combined.

Total time Allotted and questions= 75mins and 20 questions

Round 3: TR+HR

Questions asked in the final interview are given as follows:

Technical questions:

  1. Tell me about yourself.
  2. Explain your projects and internships.
  3. Can we apply a binary search algorithm to a sorted Linked list?
  4. What is normalization?
  5. Write a C++ program to find a maximum scalar product of two vectors.
include<bits/stdc++.h>
using namespace std;
int main(){
int arr1[] = {1, 2, 6, 3, 7};
int arr2[] = {10, 7, 45, 3, 7};

int n = sizeof(arr1)/sizeof(arr1[0]);

//Sort arr1 in ascending order
for(int i=0; i<n; i++){
for(int j=i+1; j<n; j++){ if(arr1[i]>arr1[j]){
int temp = arr1[i];
arr1[i] = arr1[j];
arr1[j] = temp;
}
}
}

//Sort arr2 in ascending order
for(int i=0; i<n; i++){
for(int j=i+1; j<n; j++){ if(arr2[i]>arr2[j]){
int temp = arr2[i];
arr2[i] = arr2[j];
arr2[j] = temp;
}
}
}

int product = 0;
for(int i=0; i<n; i++)
product += arr1[i]*arr2[i];
cout<< product;

}
  1. What is a View?
  2. Write a Java program to check if two Strings are Anagram or not.
import java.util.Arrays;
import java.util.Scanner;
public class CheckIfTwoStringsAreAnagramAreNot {
    static boolean isAnagram(String str1 , String str2) {
    String s1 = str1.replaceAll("[\\s]", "");
    String s2 = str2.replaceAll("[\\s]", "");
    boolean status=true;

     if(s1.length()!=s2.length())
         status = false;
     else {
         char[] a1 = s1.toLowerCase().toCharArray();
         char[] a2 = s2.toLowerCase().toCharArray();
         Arrays.sort(a1);
         Arrays.sort(a2);
         status = Arrays.equals(a1, a2);
       }
       return status;
} 
   public static void main(String[] args) {
     Scanner sc = new Scanner(System.in);
     System.out.print("Enter two String :");
     String s1 = sc.next();
     String s2 = sc.next();
     boolean status = isAnagram(s1,s2);
       if(status)
          System.out.println(s1+" and "+s2+" are Anagram");
       else 
          System.out.println(s1+" and "+s2+" are not Anagram");
       }
}
  1. Write a JAVA program to check whether a number of automorphic numbers or not.
public class Main
{
	public static void main(String[] args) {
	   
	int n = 376, sq = n * n ;
    if(isAutomorphic(n) == 1)
        System.out.println("Num: "+ n + ", Square: " + sq + " - is Automorphic");
    else
        System.out.println("Num: "+ n + ", Square: " + sq + " - is not Automorphic");
	   
		
	}
	
	static int isAutomorphic(int n){
    int square = n * n;
    while(n != 0)
    {
        // means not automorphic number
        if(n % 10 != square % 10){
            return 0;
        }
        // reduce down numbers
        n /= 10;
        square /= 10;
    }
    // if reaches here means the automorphic number
    return 1;
}
}

Reliance Jio Interview Preparation Course

Check out our Reliance Jio Interview Preparation Course on Prime, which includes:-

  • Reliance Jio Technical Interview Questions and Answers
  • Reliance Jio HR Interview Questions and Answers
  • Reliance Jio Certification Questions
  • Written Reliance Jio Interview Experience
  • and more.

To read more Interview Experiences of selected candidates, visit:

FAQ on Reliance Jio Interview Experience

Question: How many rounds are there in the Reliance Jio Interview?

Answer:-

There are typically 3 rounds:

  • L0 Round
  • Written Round
  • Final Interview

Question: Name all sections in the Reliance Written Test.

Answer:-

The sections in the Written test are:

  • Logical Reasoning
  • Verbal ability
  • Programming round

Question: How long goes it take for Reliance to send the offer letter/interview results?

Answer:-

Usually, Reliance Jio takes a time of 1-4 weeks for interview results.