# Reliance Jio Interview Questions

## Reliance Jio Interview Questions and Answers 2023

On this page, find the most frequently asked Interview Questions as well as Answers in the Reliance Jio Interviews.

Page Highlights:-

• Reliance Jio Technical Questions
• Reliance Jio HR Interview Questions ## Questions for Reliance Jio Technical Interviews

#### Question 1: 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);

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

}```

#### Question 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");
}
}
```

#### Question 3: 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;
}```

#### Questions 4: Write a JAVA program for the rotation of elements of the array.

```//Write a program for array rotation in java
class Main {

public static void main(String[] args)
{
int arr[] = { 10, 20, 30, 40, 50, 60, 70};
int n = arr.length;
int k = 3;

int[] temp;

temp =  new int[n];

for(int i=0; i<k; i++)
temp[i] = arr[i];

int x = k;
for(int i=0; x < n; i++){
arr[i] = arr[x++];
}

x = 0;

for(int i=n-k; i<n; i++)
arr[i] = temp[x++];

for (int i = 0; i < 7; i++)
System.out.print(arr[i] + " ");
}

}```

#### Question 5: Write a program to rotate a matrix by 90 degree in clockwise direction using C++.

```#include<bits/stdc++.h>
using namespace std;

int main(){

int n=4;
int mat[n][n]= { { 1, 2, 3, 4 },{ 5, 6, 7, 8 },{ 9, 10, 11, 12 },{ 13, 14, 15, 16 } };

//Rotate the matrix about the main diagonal
for(int i=0; i<n; i++){
for(int j=0; j<i; j++)
swap(mat[i][j], mat[j][i]);
}

//Rotate the matrix about middle column
for(int i=0; i<n; i++){
for(int j=0; j<n/2; j++){
swap(mat[i][j], mat[i][n-j-1]);
}
}

//Print the matrix
cout<<"Rotated Matrix :\n";
for(int i=0; i<n; i++){
for(int j=0; j<n; j++){
cout<<mat[i][j]<<" ";
}
cout<<endl;
}
}```

#### Question 6: 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));
}
}
}
```

#### Question 7: Write a program for the Largest Sum Contiguous SubArray in C.

```#include
#define ARRAY_SIZE(a)  sizeof(a)/sizeof(a)
int maxSubArraySum (int arr[], int n)
{
int i = 0;
int max_so_far = 0;
int max_ending_here = 0;

for (i = 0; i & lt; n; i++)
{
max_ending_here = max_ending_here + arr[i];
if (max_ending_here & lt; 0)
{
max_ending_here = 0;
}
if (max_so_far & lt; max_ending_here)
{
max_so_far = max_ending_here;
}
}
return max_so_far;
}

int main ()
{
int arr[] = { -2, 1, -3, 4, -1, 2, 1, -5, 4 };
int arr_size = ARRAY_SIZE (arr);
const int maxSum = maxSubArraySum (arr, arr_size);
printf ("Largest Sum Contigous SubArray : %d ", maxSum);
return 0;
}```

#### Question 8: Name some popular operating systems.

Microsoft, Linux, OSX, and Windows are some popular OS.

#### Questions 9: What exactly is a multicast delegate?

Each delegate object represents a single method. A delegate object, on the other hand, can store pointers to and invoke many methods. These types of delegate objects are known as multicast delegates or combinable delegates.

#### Question 10: What are the methods available in sorting sequential files?

• Straight merging
• Polyphase sort
• Natural merging
• Distribution of initial runs

## Questions for Reliance Jio HR Interviews

#### Question 1: Tell me about yourself.

Good Morning Sir/Ma’am.

Thank you for giving me the opportunity to introduce myself.

My name is Naman Sharma. I’m from Bangalore, India, and I’m 21 years old. I studied at XYZ School in Bangalore and am currently pursuing my B. Tech degree at ABC University. My strengths include being a good listener and being a hard worker.  Overthinking is one of my weaknesses. My interests include reading, painting, and listening to music. My objectives are to advance professionally within an organization and take on more responsibility.

Thank you.

Read more at: Tell me about yourself.

#### Question 2: What are your hobbies and interests?

My hobbies include reading motivational novels, listening to music, and maintaining a journal. I also like to explore various places and enjoy the weather, playing games such as badminton.

Read more at: What are your hobbies and interests?

#### Question 3: Are you ready to relocate?

Yes, sir. My work is more important to me than anything else, and I’m willing to move anywhere the firm needs me to go as long as it will help me advance my career.

Read more at: Are you ready to relocate?

#### Question 4: Can you work under pressure?

I can work under pressure, and the fact that I complete all of my tasks on a schedule allows me to never feel under pressure.

Read more at: Can you work under pressure?

#### Question 5: Do you have any medical issues?

No Sir, I have no medical issues of any type.

Read more at: Do you have any medical issues?

#### Question 6: Who is the founder of Reliance Jio?

Mukesh Ambani is the founder of Reliance Jio.

#### Question 7: When was Reliance Jio founded?

Reliance Jio was founded on 15 February 2007.

Pankaj Thapliyal

#### Question 9: Who are the competitors of Reliance Jio?

Some of the competitors of Reliance Jio:

• Airtel
• Vi
• BSNL

#### Question 10: Do you have any questions for me?

Yes sir,  Thank you for giving me this opportunity.  My questions is “What is a typical workday like?”

Read more at: Do you have any questions for me?

## Top 100 Puzzles ## Interview Prep. 