Reliance Jio Interview Experience for 2023

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

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.

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

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

• Professional cloud
• Personal cloud
• Performance cloud

8. Write a program to find the Armstrong number or not using JAVA.

#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;

}

						

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));
        }
    }
}