Interview experience
Reliance Interview Questions and Answers (2026)
Overview
Section titled “Overview”Reliance’s fresher hiring runs a 3-stage Graduate Engineer Trainee funnel (written test, technical interview, HR), but the technical content shifts hard depending on which business unit - Jio digital/tech, retail, or core engineering - you’re interviewing for.
Reliance interview process at a glance
Section titled “Reliance interview process at a glance”| Round | Duration | What they test |
|---|---|---|
| Online / Written Test | 60-120 min | Aptitude + domain sections (Java/C++, Big Data/Hadoop for Jio tech) |
| Technical Interview | 30-45 min | OOPs, basic coding, domain discussion (Jio platforms) |
| HR | 20-30 min | Communication, willingness to learn, location/shifts |
Online / Written Test
Section titled “Online / Written Test”The widest filter in the process - quantitative aptitude and logical reasoning sections plus domain-specific sections that vary by business unit. Jio digital/tech drives have reported the test split into short ~10-minute blocks per topic (Big Data/Hadoop, RF, Java/C++, aptitude).
Common questions
- Quantitative aptitude and logical reasoning (speed, accuracy over tricks)
- Java/C++ fundamentals MCQs (Jio digital/tech track)
- Big Data/Hadoop basics (Jio digital/tech track)
- Basic domain/technical MCQs relevant to your applied business unit
Technical Interview
Section titled “Technical Interview”A 30-45 minute round covering core CS/OOPs fundamentals, 1-2 basic coding problems, and a domain conversation tied to your business unit - plain-language explanations of Jio platforms or your unit’s systems work better than buzzwords.
Common questions
- Sorting algorithm walkthroughs - explain bubble sort, or code the merge step of merge sort
- Find the sum of all nodes in a binary tree
- OOPs fundamentals - polymorphism, and the different types of queues
- Basic array/string coding with clear logic and edge-case handling
- Discuss Jio platforms or your business unit’s systems - inputs, outputs, what breaks at scale
Round-by-round narratives are on the Reliance interview experience page.
HR round
Section titled “HR round”A comparatively light 20-30 minute closing conversation. Candidate reports say Reliance weighs communication skills and willingness to learn more heavily here than deep behavioural cross-questioning.
Common questions
- Why this company / business unit?
- Location and shift flexibility
- How your project or internship maps to the role
- Long-term career plans
Sample answer frameworks for each of these are on the Reliance HR interview questions page.
Business-unit split: Jio digital/tech vs core engineering
Section titled “Business-unit split: Jio digital/tech vs core engineering”Reliance Industries spans telecom (Jio), retail, and petrochemicals/energy, and its GET hiring is not one uniform process. Jio’s digital/tech GET track (the one most fresher CS/IT candidates land in) leans on Java/C++, Big Data/Hadoop, and platform-scale discussion, sometimes with an extended L0/L1/group-discussion funnel. Core engineering GET tracks in petrochemicals or manufacturing instead test domain fundamentals specific to that plant or process. Check your offer/interview call letter for the exact business unit before you prep.
Common technical interview questions and answers
Section titled “Common technical interview questions and answers”Q: What is polymorphism, and what is the difference between compile-time and runtime polymorphism?
Polymorphism lets one interface stand for many implementations. Compile-time polymorphism is method overloading (and operator overloading in C++), resolved statically by the compiler from the argument types, so it costs nothing at runtime. Runtime polymorphism is method overriding: a base-class reference points to a derived object, and the actual method is chosen at execution time via the virtual table. In Java every non-static, non-final method is virtual by default; in C++ you must declare the method virtual, and you should also declare the base destructor virtual, otherwise deleting a derived object through a base pointer is undefined behaviour.
Q: What are the different types of queues?
A simple queue is FIFO with enqueue at the rear and dequeue from the front, but in an array implementation the freed front slots are wasted. A circular queue fixes that by wrapping the rear index using modulo the capacity, so all slots are reusable; it is full when the next rear position equals the front. A deque allows insertion and deletion at both ends and is what sliding-window-maximum problems use. A priority queue dequeues by priority rather than arrival order and is normally implemented as a binary heap with O(log n) insert and extract. All the basic operations on a simple or circular queue are O(1).
Q: How do you find the sum of all nodes in a binary tree?
Recursively, the sum of a tree equals the node’s value plus the sum of the left subtree plus the sum of the right subtree, with an empty node returning 0. That is O(n) time since every node is visited once, and O(h) space for the recursion stack, where h is the height - O(log n) for a balanced tree but O(n) for a skewed one. The iterative alternative pushes the root onto a stack (or queue for BFS), then repeatedly pops a node, adds its value, and pushes its non-null children, giving the same O(n) time with an explicit O(n) worst-case structure and no risk of stack overflow.
Q: Explain bubble sort and how it can be optimised.
Bubble sort repeatedly walks the array comparing adjacent pairs and swapping them when out of order, so after pass i the largest i elements are in their final positions at the end. The naive version is O(n squared) comparisons in all cases. The standard optimisation is a swapped flag: if a full pass makes no swaps, the array is already sorted and you break, which makes the best case O(n) on sorted input. A second optimisation shrinks the inner loop bound by one each pass since the tail is already sorted. It uses O(1) extra space and is stable, but merge sort or quicksort should be preferred for anything but tiny or nearly-sorted arrays.
Q: How does the merge step of merge sort work?
Given two sorted halves, keep an index into each and repeatedly copy the smaller of the two current elements into an output array, advancing that index; when one half runs out, copy the remainder of the other. Taking the left element on a tie is what makes merge sort stable. The merge itself is O(n) time and O(n) auxiliary space for the temporary array; combined with log n levels of splitting, the whole sort is O(n log n) in best, average, and worst case. This same merge routine is the basis of external sorting, where the sorted runs live on disk rather than in memory.
Q: What is HDFS and how does it store a large file?
HDFS is Hadoop’s distributed file system, designed for write-once, read-many access to very large files on commodity hardware. A file is split into fixed-size blocks - 128 MB by default in Hadoop 2 and later - and each block is replicated, by default three times, across different DataNodes. The NameNode holds all metadata in memory: the directory tree and the mapping of blocks to DataNodes, while DataNodes hold the actual block data and send periodic heartbeats and block reports. The default replica placement puts one copy on the local rack and two on a remote rack, balancing fault tolerance against cross-rack write bandwidth. Because metadata lives in NameNode memory, HDFS handles a few huge files far better than millions of small ones.
Q: Explain how a MapReduce job processes data.
The input is split so each mapper typically processes one HDFS block, ideally on the node that already holds it, which is data locality. Each map task emits intermediate key-value pairs. The shuffle-and-sort phase partitions those pairs by key (default: hash of the key modulo the number of reducers), sorts them, and transfers each partition to its reducer, so all values for one key land at the same reducer. Each reduce task then aggregates the values per key and writes output back to HDFS. An optional combiner runs map-side partial aggregation to cut the volume of data shuffled across the network, which is usually the job’s bottleneck.
Q: What is the difference between WHERE and HAVING in SQL?
WHERE filters individual rows before grouping and aggregation, so it cannot reference aggregate functions. HAVING filters the groups produced by GROUP BY, after aggregation, so it can reference SUM, COUNT, AVG, and similar. The logical evaluation order is FROM, then WHERE, then GROUP BY, then HAVING, then SELECT, then ORDER BY - which also explains why a column alias defined in SELECT is not visible to WHERE. When a condition can be expressed in either place, put it in WHERE: filtering rows earlier means fewer rows to group, which is faster.
Frequently asked questions about Reliance interviews
Section titled “Frequently asked questions about Reliance interviews”What is the Reliance interview process for freshers?
Reliance’s Graduate Engineer Trainee (GET) process typically runs 3 stages: 1. Online/Written Test (60-120 min) - aptitude plus domain-specific sections (for Jio digital/tech roles this can include Java/C++, Big Data/Hadoop, and even RF-networking sections depending on the business unit). 2. Technical Interview (30-45 min) - core CS/OOPs fundamentals, 1-2 basic coding problems, and domain discussion tied to your business unit (e.g. Jio platforms). 3. HR Interview (20-30 min) - motivation, location, shift flexibility. Some drives add an L0/L1 split or a group discussion before the final round. Total timeline is roughly 2-3 weeks.
What questions are asked in Reliance interviews?
Reported technical questions include basic array/string coding, sorting algorithms (bubble sort, merge sort), finding the sum of nodes in a binary tree, OOPs concepts (polymorphism, types of queues), and quantitative aptitude/logical reasoning. For Jio digital/tech roles, expect domain sections on Big Data/Hadoop and Java/C++. HR questions focus on communication and willingness to learn, plus location and shift flexibility.
How many rounds are there in the Reliance interview?
Most freshers see 3 stages: an Online/Written Test, a Technical Interview, and an HR round. Some Jio digital drives run a longer funnel with an L0 screen, L1 technical interview, a group discussion, and a final interview - the exact count depends on the business unit (Jio, Retail, Petrochemicals) and drive.
Does Reliance’s interview process differ by business unit?
Yes. Reliance Industries spans telecom (Jio), retail, and petrochemicals/energy, and the GET process is tailored to each: Jio’s digital/tech GET track leans on Java/C++, Big Data/Hadoop, and platform-scale discussion, while core engineering GET tracks (petrochemicals, manufacturing) test domain fundamentals instead. Confirm which business unit and track you’re interviewing for before you prep.
How should I prepare for Reliance interviews?
Practise timed quantitative aptitude and logical reasoning, since the written test is the first and widest filter. Revise OOPs, basic sorting/tree algorithms, and SQL. For Jio digital/tech roles, brush up on Big Data/Hadoop basics and Java/C++ fundamentals. Prepare one clear project narrative connecting your work to Reliance’s business (Jio platforms, retail, or your specific unit), and use STAR for HR answers on communication and willingness to learn.
What is Reliance’s fresher salary for GET roles?
Candidate reports put GET/Analyst packages roughly in the ₹12-20 LPA range, though this varies significantly by business unit, role, and college tier. Confirm the exact figure on your offer letter.