How Reliance Jio / Jio Platforms fresher SDE and GET loops usually play out, synthesized from recent campus and GFG reports. We reorganized rounds, flagged AMCAT vs InterviewBit vs HackerRank variance, and added prep notes - treat this as a prep map, not a script.
Round-wise process at a glance
Round
Typical format
What clears you
Online coding / OA
30–60 min; 2 coding (± MCQs on OOP/OS/DBMS)
Optimal solutions + complexity
Technical 1
Codeshare + DSA + OOP/SQL
Working code; clear OOP answers
Technical 2
Projects + more DSA + OS
Ownership of internship/project
HR
Behavioural + Why Jio
Consistent STAR; location flexibility
Technical interview experience 1 - SDE, AMCAT + two technicals
Example pair from GFG: frequency of a substring; minimum lines to cover all points
Shortlist mail after a couple of days in that account
Tip: Geometry/greedy problems surprise candidates who only drilled arrays - diversify
Round 2 - Technical 1 (codeshare + video)
Introduction
Coding: check whether an array is a subset of another using a map; Trapping Rain Water
OOP: abstraction and inheritance
SQL query logic
Wrote code on codeshare; stated complexities
Result: Cleared
Tip: Practise Trapping Rain Water until two-pointer and stack variants are automatic
Round 3 - Technical 2
Deep dive on summer training / internship project
Coding: segregate 0s and 1s; detect loop in linked list (approach + complexity)
OOP: abstraction and encapsulation; OS: virtual memory and CPU scheduling
Result: Cleared to HR
Tip: Round 2 often re-tests fundamentals you claimed in Round 1 - stay consistent
Round 4 - HR
Best project; toughest life decision; internship problems; peer conflict in fest org; Why Reliance Jio?
Final result: Offer (per that GFG account; results next day)
Tip: Prepare conflict resolution with a calm, specific story
Key takeaways: Jio SDE technicals are classic DSA + CS fundamentals. Codeshare fluency matters as much as knowing the algorithm.
Takeaways
What decided it: Working codeshare solutions (subset check, trapping rain water, cycle detection) with stated complexities, plus a concrete internship story in technical 2
Common fail: Knowing the algorithm but freezing on codeshare, or skipping OOP/OS when round 2 re-tests fundamentals
How to practise: Timed rain-water and linked-list drills on a shared editor; rehearse one internship bug end-to-end
Candidate profile: Campus GET / SDE candidate (JPL or InterviewBit-style drive)
Round 1 - Coding OA
InterviewBit-style: 2 questions in 1 hour (e.g. minimum swaps to sort; balls to consecutive positions)
Or HackerRank-style: ~18 MCQs (OOP/OS/DBMS) + 2 easy-medium coding in ~30 min (IIT Guwahati JPL 2023 pattern)
Tip: MCQ + coding combo - do not spend the whole window on one hard code
Round 2 - Technical interview(s)
nth node from end of linked list; string anagrams with complexity
Array with positives/negatives: remove k elements so remaining sum is 0, minimize k
Binary search easy problem then bottom view of binary tree
Project explanation for 10+ minutes in some panels
Some JPL drives: single 45-min interview, no separate HR
Result: GET offer reported in JPL campus write-up
Tip: Always give brute force then optimize - interviewers ask for it explicitly
HR (when present)
Background, 10th/12th, JEE ranks in older accounts; expectations from role
Why Jio; relocation
Tip: Know Jio’s product surface (connectivity, platforms, apps) beyond the brand name
Key takeaways: Format varies by Jio entity and campus. Prepare for either a long two-technical ladder or a single dense interview.
Takeaways
What decided it: Brute-force-then-optimize on InterviewBit/HackerRank-style problems (nth-from-end, bottom view, sum-to-zero removals) and owning a 10+ minute project walkthrough
Common fail: Burning the OA window on one hard code when MCQs are also scored; assuming every JPL drive has a separate HR
How to practise: Two problems in 60 minutes with complexity narration; prepare both long ladder and single 45-min interview modes
Key takeaways: Jio HR is behavioural and motivation-focused. Specific internship stories beat generic leadership claims.
Sample answers for high-frequency questions
Use these as frames, not scripts - interviewers probe follow-ups.
Technical
Q. Trapping Rain Water - approach? A. Two-pointer: maintain left_max and right_max while converging. Water at index is min(left_max, right_max) − height. Time O(n), space O(1). Alternative: prefix/suffix max arrays in O(n) space.
Q. Detect loop in a linked list? A. Floyd cycle: slow and fast pointers; if they meet, a cycle exists. To find entrance, reset one pointer to head and advance both one step. Time O(n), space O(1).
Q. Bottom view of a binary tree? A. BFS with horizontal distance index; last node seen at each HD while scanning top-to-bottom left-to-right is the bottom view. Use a map from HD → value. Time O(n log n) with tree map or O(n) with hash + min/max HD.
HR
Q. Why Jio? A. Scale of India connectivity/digital platforms, engineering challenges at user scale, and how your skills (backend, networks, apps) map. Mention one concrete product line.
Q. Conflict with peers? A. STAR: disagree on fest/org task → listened → data or compromise → delivered on time. Show maturity, not blame.
Round-wise notes synthesize public candidate reports and campus write-ups, then add prep takeaways and outcome context. Confirm platform and round count against your drive mail. Citation inputs:
