Interview experience
Reliance interview experiences covering Online / Written Test, Technical Interview, HR. Round-wise notes, common questions, and what candidates report clears each stage.
Explore: Interview experience · HR interview questions · Overview · Placement papers · Preparation guide
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.
Interview experience
Reliance interview experiences covering Online / Written Test, Technical Interview, HR. Round-wise notes, common questions, and what candidates report clears each stage.
HR interview questions
Reliance HR interview questions with sample answer frameworks - motivation, relocation, STAR stories, and culture-fit prompts.
| 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 |
These answers are compiled from Reliance’s published GET programme details and public candidate reports, and drives differ between the core GET programme and Jio/digital tech hiring. The instruction screen of your own test is the final word.
| Question | Answer |
|---|---|
| How many questions and how long? | Not published for the core GET programme. The 2025 RIL GET notice only says the online assessment is a Cognitive Test plus a Subject Matter test, run in slots. For Jio/digital tech drives, prep guides report about 60 questions (quant, logical, basic programming) in about 75 minutes, and one 2023 campus pattern had 39 questions in 49 minutes split into five 10-minute blocks. |
| Does it have negative marking? | Reports conflict. FACE Prep and some drive reports cite a 0.25-mark penalty per wrong answer, while other reports say there was none. Read the instructions before you guess. |
| Is there a sectional cutoff? | Not published. Jio-style papers are split into separately timed blocks, so treat each block as something you must clear rather than relying on one strong section. |
| How much is the cutoff? | No test cutoff is published; shortlists are relative to the applicant pool. Eligibility for the 2025 GET programme was a minimum 60% or 6 CGPA across 10th, 12th, diploma (if any) and the engineering aggregate, with no active backlogs and no detention. |
| Which platform is it on? | The 2025 GET programme was run through Unstop (registration, screening, assessment slots and document upload). Prep guides report HackerEarth for most Jio tech drives and AMCAT for some campus drives. |
| Is there coding? | Not in the core GET programme, which tests cognitive ability and your branch subject. Jio/digital tech drives report about 2 easy-to-medium coding problems in C, C++, Java or Python. |
| Which branches can apply to the GET programme? | Chemical, Mechanical, Electrical, Fire, Civil, Metallurgical and Instrumentation for the 2025 batch. CSE/IT candidates are usually hired through Jio and digital tech drives instead. |
| What is the GET package? | The 2025 GET notice listed ₹7.5 LPA for non-IIT and ₹9 LPA for IIT graduates. Shortlisted candidates then attended physical regional interviews after document verification. |
The interview follows your branch and business unit. These are topics candidates have reported on Glassdoor and IndiaBix; they show the level and style, not a fixed list.
| Branch | Reported questions and topics |
|---|---|
| Chemical | Characteristic curves of a centrifugal pump and NPSH. Reynolds number and the Ergun equation. Distillation: rectification line, q-line slope, reflux ratio and reboiler load. Pumps for slurry service and the effect of impeller diameter and speed on head. |
| Instrumentation | Seebeck effect and how a thermocouple works. How a PID controller works, including the feedback loop. Process-control questions tied to plant equipment. |
| Civil | Self-introduction, then detailed questions on diploma and B.Tech internships. What you know about Reliance’s oil-to-chemicals and petrochemical business. Technical round followed by HR. |
| CSE / IT (Jio and digital tech) | Bubble sort and the merge step of merge sort. Sum of all nodes in a binary tree. Polymorphism and types of queues. Big Data/Hadoop basics, Java/C++ MCQs and SQL. Minimum swaps to sort an array in Jio SDE OAs. |
| Mechanical / Electrical | Fewer public question-level reports. Expect your core subjects (thermodynamics, fluid machinery and machine design; machines and power systems) mapped to refinery and petrochemical plant equipment, plus your internship. |
Asked across every branch: tell me about yourself, a line-by-line walk through your internship and final-year project, what you know about Reliance’s businesses, and whether you are ready for a plant posting such as Jamnagar.
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). Some off-campus drives use proctored OAs (dual camera, room scan) before interview slots.
Common questions
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
Round-by-round narratives are on the Reliance interview experience page.
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
Sample answer frameworks for each of these are on the Reliance HR interview questions page.
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.
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.
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).
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.
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.
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.
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.
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.
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.
TCP provides reliable, ordered delivery with retransmission - use it for provisioning APIs, billing records, and control-plane operations where lost packets corrupt state. UDP is connectionless and low overhead - use it when the application tolerates loss (some realtime media or telemetry) and implements its own sequencing or freshness checks. In a Jio-style panel, tie the answer to the product: subscriber-facing apps often mix HTTPS/TCP for transactions with UDP or QUIC-based streams for media.
An index (commonly B-tree) lets the engine find rows by key without full table scans - critical for subscriber lookup, order history, and join keys at scale. Avoid indexes on tiny tables, columns with very low cardinality where the optimizer ignores them, or write-heavy tables where each insert/update must maintain many indexes. On fresher panels, mention one query you sped up with an index and one trade-off you considered (storage, write amplification).
Model the array as a permutation of values. Each cycle of length L in the permutation needs L−1 swaps to sort. Walk unvisited indices, follow the permutation cycle, accumulate swaps. With arbitrary values, map each value to its sorted rank first. Time O(n log n) if sorting ranks, O(n) when values are 1..n. This problem appears in Jio SDE OA reports alongside linked-list classics.
Reports conflict. FACE Prep and some drive reports cite a 0.25-mark penalty per wrong answer, while other candidate reports say there was no negative marking. Reliance does not publish a rule, so read the instruction screen of your own test before guessing.
No test cutoff is published; shortlists are relative to the applicant pool. The 2025 RIL GET programme required a minimum 60% or 6 CGPA across 10th, 12th, diploma (if any) and the engineering aggregate, with no active backlogs and no academic detention, and was open to Chemical, Mechanical, Electrical, Fire, Civil, Metallurgical and Instrumentation graduates.
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.
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.
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.
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.
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.
The 2025 RIL GET programme listed ₹7.5 LPA for non-IIT and ₹9 LPA for IIT graduates. Candidate reports for Jio and digital software or analyst roles cite higher bands, roughly ₹12-20 LPA, varying by business unit, role, and college tier. Confirm the exact figure on your offer letter.
Group hiring spans Jio, Retail, and corporate tech tracks, so confirm your business unit. Panels commonly score:
Soft fail modes: preparing a pure FAANG DSA script for a non-coding track, or refusing relocation after claiming flexibility.
Reliance group hiring spans multiple entities (for example Jio Platforms software vs network GET vs retail tech). Confirm the PPT or careers posting for your track - OA and technical depth differ, while HR still probes location, shifts, and why that business unit. Do not prepare a single FAANG script for every Reliance label.
Use this as a default four-week loop before a Reliance drive. Adjust to your invite timeline.
10-day crash version: Days 1-4 timed DSA, days 5-7 resume projects + CS fundamentals, days 8-9 mock interviews out loud, day 10 HR STAR stories on the HR page.
Candidate-reported fresher/early-career packages for Reliance often cite ₹12-20 LPA fresher SWE/Analyst band. Treat forum numbers as ranges, not guarantees - confirm the written offer letter for your team and location.
Interview process details and sample questions on this site are editorially organized from public candidate reports and hiring write-ups, with round structure, prep notes, and company-specific framing added by our team. For round-by-round stories, see the Reliance interview experience page. For OA papers and coding drills, use Reliance on placementpapers.app. OA quick answers and branch-wise questions draw on Reliance’s 2025 GET programme listing on Unstop (via a college placement notice), placementpreparation.io’s Reliance test-pattern page, FACE Prep’s Reliance guide, and Glassdoor and IndiaBix candidate reports.
Guides often searched alongside this page: Jio interview questions · Airtel interview questions · TCS interview questions · Infosys interview questions · Wipro interview questions · Amazon interview questions.