Jio Interview Questions, Process, and Tips

Q1. Are you ready to work here for 14 to 18 hours
Ans. 
Yes, I am ready to work for 14 to 18 hours.
• I am highly motivated and dedicated to my work.

• I have a strong work ethic and am willing to put in the necessary hours to get the job done.

• I understand the demands of the job and am prepared to prioritize my work accordingly.

• I have previous experience working long hours and have been successful in meeting deadlines and achieving goals.

• I am confident in my ability to manage my ...read more
Answered by AI
Add your answer
Q2. You have to start your day At 6:00 Am
Add your answer

Basic Test was there

Q1. Just personality test
Add your answer
Q2. Whats the passion
Add your answer

Q1. There was 2 rounds of Interwiew
Add your answer
Q2. It was related to my accounting & SAP knowledge
Add your answer
Q3. What do you know about Prepaid Exp & how is entered in the Books
Ans. 
Prepaid expenses are payments made in advance for goods or services that will be received in the future.
• Prepaid expenses are recorded as assets on the balance sheet

• They are initially recorded as a debit to prepaid expenses and a credit to cash or accounts payable

• As the prepaid expense is used up, it is recognized as an expense on the income statement

• Examples of prepaid expenses include rent, insurance, and subscription
Answered by AI
Add your answer
Q4. Banking entries, Rental processing & etc
Add your answer
Q5. About my families, what your expectation
Add your answer
Q6. Why do you want to previous employer ( HT media Ltd )
Add your answer

Q1. Basic Concept of OOPs, Java, Spring Boot, MySQL.
Add your answer
Q2. Find the kth smallest value in an unsorted array
Ans. 
Find the kth smallest value in an unsorted array
• Sort the array and return the kth element

• Use quickselect algorithm to find the kth smallest element in O(n) time

• Build a min heap of size k and traverse the array to find the kth smallest element
Answered by AI
Add your answer
Q3. Merge Sort Algorithm Implementation
Ans. 
Merge Sort is a divide and conquer algorithm that divides an array into two halves, sorts them and then merges them.
• Divide the array into two halves recursively

• Sort each half recursively using merge sort

• Merge the two sorted halves

• Time complexity is O(nlogn)

• Space complexity is O(n)
Answered by AI
Add your answer

Q1. Detailed discussion on the project I have worked on.
Add your answer
Q2. What is a Load Balancer?
Ans. 
A Load Balancer distributes incoming network traffic across multiple servers to improve performance and availability.
• It helps to avoid overloading a single server

• It improves responsiveness and availability of applications

• It can be hardware or software-based

• Examples include Amazon ELB, F5 BIG-IP, and NGINX

• It can also perform health checks on servers and route traffic accordingly
Answered by AI
Add your answer
Q3. Difference between Spring MVC and Spring Boot
Ans. 
Spring MVC is a framework for building web applications, while Spring Boot is an opinionated framework for building standalone applications.
• Spring MVC requires more configuration and setup compared to Spring Boot

• Spring Boot provides a pre-configured environment with sensible defaults

• Spring Boot includes an embedded server, making it easier to deploy standalone applications

• Spring MVC is more suitable for building tradit...read more
Answered by AI
Add your answer
Q4. Difference between SQL and NoSQL
Ans. 
SQL is a relational database management system while NoSQL is a non-relational database management system.
• SQL databases are structured and use tables with predefined schema while NoSQL databases are unstructured and use collections or documents.

• SQL databases use SQL (Structured Query Language) for querying and managing data while NoSQL databases use various query languages like MongoDB's query language.

• SQL databases ar...read more
Answered by AI
Add your answer
Q5. Find the equilibrium index where the sum of all the values before the equilibrium index is equal to the sum of all the values after the equilibrium index.
Ans. 
Find the equilibrium index where the sum of all values before it is equal to the sum of all values after it.
• Iterate through the array and calculate the total sum.

• Then iterate again and keep track of the left sum and right sum.

• If they are equal at any index, return that index as the equilibrium index.
Answered by AI
Add your answer

Just basic quants and maths was in the test

Q1. Based on projects
Add your answer

Q1. Behavioral questions were asked and what do you know about the company
Add your answer