i
Jio
Filter interviews by
Bubble sorting is a simple sorting algorithm that repeatedly steps through the list, compares adjacent elements and swaps them if they are in the wrong order.
Bubble sort is a comparison-based algorithm
It works by comparing each pair of adjacent elements and swapping them if they are in the wrong order
The algorithm repeats this process until no more swaps are needed
It has a worst-case and average-case complexity of...
Arrays are fixed in size while ArrayLists can dynamically grow and shrink.
Arrays are of fixed size while ArrayLists can be resized dynamically.
Arrays can hold primitive data types and objects while ArrayLists can only hold objects.
Arrays are faster for accessing elements while ArrayLists are faster for adding and removing elements.
Arrays use square brackets [] to declare while ArrayLists use angle brackets <>...
Code to generate a random number between 15-25
Use Math.random() to generate a random number between 0-1
Multiply the result with the range (25-15) and add the minimum value (15)
Use Math.floor() to round down the result to an integer
Oops concepts are fundamental to object-oriented programming. They help in creating modular and reusable code.
Encapsulation - hiding implementation details of an object from the outside world
Inheritance - creating new classes from existing ones, inheriting their properties and methods
Polymorphism - ability of objects to take on many forms, depending on the context
Abstraction - focusing on essential features of an ...
What people are saying about Jio
Time theta is a measure of the worst-case time complexity of an algorithm.
It is used to analyze the performance of algorithms.
It represents the maximum amount of time an algorithm takes to complete.
It is denoted by the symbol Θ(n).
Java collections are classes and interfaces that provide a way to store and manipulate groups of objects.
Java collections include List, Set, Map, Queue, and their respective implementations
They provide methods for adding, removing, and accessing elements
Examples include ArrayList, HashSet, TreeMap, and PriorityQueue
Multiple inheritance is not allowed in Java to avoid the diamond problem.
Java supports multiple interface inheritance to achieve the same functionality.
Diamond problem occurs when a class inherits from two classes with a common method.
Java prioritizes single inheritance to maintain simplicity and avoid ambiguity.
I applied via Referral and was interviewed in Feb 2024. There were 2 interview rounds.
Linked search is a method of searching through linked data structures, like linked lists, to find specific elements.
Linked search involves traversing a linked list node by node.
Each node contains data and a reference to the next node.
Example: Searching for a value in a singly linked list requires checking each node sequentially.
It is less efficient than binary search on sorted arrays due to O(n) time complexity.
I applied via Job Fair and was interviewed in Apr 2024. There were 2 interview rounds.
Basic questions about coding
It has basic aptitude question
If you unable to clear apti then there is a option for GD
I applied via Campus Placement
General aptitude, Reasoning
C, Java, Python coding challenge
Basic Aptitude related to Reasoning, Comprehension
2 easy to moderate question
It was dp and math related problem
based on 15 interview experiences
Difficulty level
Duration
based on 87 reviews
Rating in categories
Assistant Manager
5.3k
salaries
| ₹4 L/yr - ₹8.5 L/yr |
Deputy Manager
3.4k
salaries
| ₹5.8 L/yr - ₹12.4 L/yr |
Manager
1.8k
salaries
| ₹10.7 L/yr - ₹18.5 L/yr |
Senior Manager
1.5k
salaries
| ₹16 L/yr - ₹27.2 L/yr |
Senior Executive
1k
salaries
| ₹2.3 L/yr - ₹6.5 L/yr |
Jio Platforms
Bharti Airtel
Vodafone Idea
Reliance Communications