2019–2026 Rippling SWE Intern OA / Interviews: 42 Experiences (Part 1 :)

A seven-question OA, a string problem with four follow-ups, and a coding round that changed from DFS to Dijkstra all appear in these accounts.

Coverage: 42 separate Rippling software-intern application experiences across this two-part series: SWE/SDE, backend, full stack, one ML-software recruiting screen, and combined internship/full-time offers. Locations include the U.S. and Indian campuses; several reports omit their location. Interviews and reports span 2019–October 2026, including Winter and Summer 2027 recruiting. Part 1 contains the question bank and 14 recent timelines; Part 2 continues with 27 earlier timelines. One cohort-dated campus account appears separately below.

What came up

Graphs and trees appeared in 11 of the 42 experiences. String operations, parsing and search appeared in 10, while eight described array or sorted-sequence tasks.

These counts include the explicitly historical reports. An experience can appear in several rows; reports without a disclosed topic stay in the denominator.

Online assessments (OA)

OA 01: Two seven-question accounts in 2026

Full-stack report: October 2, 2026 · Cohort: Summer 2027

The candidate completed seven questions: four data-structure MCQs, two medium coding tasks, and another coding task involving data fetching and JSON. They were still waiting for a response on October 5. The actual coding prompts were not shared.

New York SWE intern interview: July 2026

A separate candidate also described seven questions. Four were MCQs: two concerned heaps/max-heapify, one concerned DFS, and the fourth was not recalled. Three were easy-to-medium coding questions. The report also named GET requests to APIs.

OA 02: Stack encryption and transmission cost

Cohort: IIT Kanpur 2025–26 internship archive · Role: Software Developer Intern

1. Lexicographically Minimum Stack Encryption. Start with a source string and empty temporary/output strings. Either move the source's first character to the temporary string's end, or move the temporary string's last character to the output. Find the smallest possible output in dictionary order.
2. Transmission cost. Matching character pairs incur sameTime; splitting the string incurs partitionTime. Minimize the additional cost. The account does not define which pairs are charged or the precise partition-cost rule.

The same candidate then faced a comment-search coding task, described in the live question bank, followed by HR. They emphasized explaining their approach and using OOP while coding. The exact interview month and outcome were not given.

OA 03: Historical campus assessments

Intern+FTE report originally published November 29, 2021

HackerEarth, 60 minutes, three questions:

1. Optimal Score Difference in an Endpoint Game: two players alternate taking an array's first or last number; maximize the first player's final score minus the second's.
2. Count Numbers with a Prime Digit Sum: count qualifying integers in inclusive [L,R], with 1 ≤ L ≤ R ≤ 10^18.
3. An unspecified graph problem.

Weights: 40/70/40. The candidate completed the first two; ten students reached interviews.

FTE+six-month-internship report originally published August 29, 2022

Its three OA questions involved trees/DP and binary search. The candidate described two as medium-hard and one as easy-medium, and solved roughly two and a half.

Live interview question bank

Strings, search and implementation choices

1. Comment search. Given comments with unique IDs and text, return the IDs containing a supplied word. Extend it so the query can match within a word. The IIT Kanpur account does not specify case handling, tokenization, result order or updates to the comment collection.
2. Parenthesis depth. Given a string, find its deepest level of nesting from parentheses. An October 2025 San Francisco candidate encountered this in a two-question, 50-minute screen.
3. String task → top-K words. One full-stack screen had four extensions, including K most frequent words over growing datasets. Only that follow-up was described.
4. Search-query processing. A July 2026 full-stack candidate received a three-part question. They did not describe the individual parts.
5. Parsing and a median. An October 2024 San Francisco report named string parsing and finding the median after combining two sorted lists. It did not preserve the input format.
6. Explain the library call. A January 2026 San Francisco interviewer challenged a candidate's choice of split() over strip(). The surrounding coding problem was not disclosed.

Sorted arrays and score maximization

1. Median of two sorted arrays → N arrays. In Allahabad in July 2025, the first technical round extended the two-array median to N sorted arrays. A December 2025 Bangalore Rural candidate independently described a story-wrapped two-array median: discuss a brute-force solution and an optimal one, then implement and run it in a 60-minute HackerRank CodePair session.
2. Merge two sorted arrays. An October 2025 intern report used this exact task label, calling its difficulty hard. It did not provide the details needed to explain that rating or to reinterpret it as a median problem.
3. Merge K Sorted Arrays. An August 2024 San Francisco internship interview named this task. The report did not state bounds or additional conditions.
4. Maximum Score with K-step Jumps. In the 2022 combined-offer report, start at array index 0 and reach n−1, jumping forward by 1 through K positions and adding visited values. The candidate worked through recursion, DP, a heap and a deque.
5. Maximum Weighted End-Pick Score. The same candidate first maximized the sum of K picks from either array end, discussing recursion and a sliding window. The follow-up multiplied each pick by the next value in a fixed multiplier sequence; their solution used DP.

Trees, dependencies and caches

1. Maximum Average N-ary Subtree. Find its root.
2. Maximum Invitations on an N-ary Tree. Invite the most nodes; neighbors cannot both attend.
3. Minimum Rounds to Inform an N-ary Tree. Spread information; each informed node contacts one child per round.

One 60-minute technical in the 2021 report required all three implementations, explanations and use of hints.

1. DFS → Dijkstra. A Winter 2027 backend candidate described a 50-minute progressive coding round: the first part used DFS, and a follow-up required Dijkstra. The graph's actual business rules were not shared.
2. Orders with dependencies. Another intern described an order-processing story that became a topological-sort problem. The interviewer helped with edge cases. The account did not preserve the full input or dependency rules.
3. LFU Cache with LRU Tie-Breaking. The 2021 campus design round required a complete implementation with explanations. A New Delhi intern independently reported LFU in July 2026, without specifying the tie rule.

Web fundamentals, projects and behavioral questions

One full-stack loop tested HTML/CSS/JavaScript alongside coding and a resume discussion; exact frontend exercises were not shared.

Reported project questions included architecture and stack choices, implementation details, challenges, improvements, and a live GitHub demonstration. Individual candidates were also asked why Rippling, their toughest challenge, and which work or project achievement made them proud. The IIIT Allahabad report adds discussion of AI's future, everyday AI use and debugging; its timeline appears in Part 2.

14 detailed candidate timelines, loops, and screens

01: A medium screen, another medium, then a project discussion

Report date: October 9, 2026 · Role: SWE Intern · Result: Accepted offer

The candidate entered through a recruiter. The first technical interview used a medium coding question. The virtual onsite added another medium question and a deep discussion of past work and projects. They described friendly interviewers; the exact prompts and location were not disclosed.

02: Summer 2027 full-stack OA

Report date: October 2, 2026 · Role: Full Stack Intern

The candidate personally completed the seven-question assessment described in OA 01. Four MCQs came first; the coding section included two medium problems and a task combining code with fetching and handling JSON. As of October 5, they had not received an update.

03: Debugging aloud in a New York coding round

Report date: October 2, 2026 · Role: SWE Intern · Location: New York · Status: No offer recorded

June 19: completed the OA.

June 29: three consecutive problems. After a bug and verbal slip on the first, the candidate fixed the bug and explained it. They finished the second and only outlined the third before time ran out. The interviewer accepted one less optimal solution without requesting further optimization.

July 9: a 60-minute coding session followed by a 45-minute technical discussion of resume projects, implementation choices and tradeoffs. The account gives month/day milestones without repeating the interview year.

04: A tree question stopped at part two

Report date: August 25, 2026 · Role: SWE Internship, Winter 2026 cohort · Result: Rejected after screen

After the OA, the candidate received a multipart tree task involving traversal, DFS and height. They did not finish its second part. The interviewer was described positively. Winter 2026 is the role's cohort label; the account does not give an actual interview date.

05: Passed the first Winter Intern technical

Report date: August 13, 2026 · Role: SDE Winter Intern

The candidate reported passing a first technical interview containing two DSA problems and a self-introduction. They had not received a second-round follow-up when they posted. No task details, office location or winter-term year were supplied.

06: OA passed; a one-hour screen was scheduled

Report date: July 28, 2026 · Role: SWE Intern

The candidate applied online, passed the OA and received scheduling materials. Their next appointment was a 60-minute CodePair technical with an SWE II. The instructions prohibited AI tools, offered a recording opt-out and said to check with the interviewer before looking something up. This account stops before the live interview.

07: Backend coding grew from traversal to shortest paths

Interview period: July 2026 · Report thread: August 2026 · Role: Backend SWE Intern, Winter 2027

One commenter described their own progressive 50-minute round, including the DFS-to-Dijkstra follow-up in the question bank. They also said their virtual onsite was followed about 12 hours later by team matching in late July. Their own team-selection list had roughly ten options. An office location and final offer were not established.

08: Team matching two days after the virtual onsite

Interview period: July 2026 · Report date: July 28, 2026 · Role: Full-stack Winter 2027 intern, from thread context

In the Waterloo recruiting thread, an independent candidate reported reaching team matching two days after their virtual onsite and then receiving an offer. They said team matching had happened about two weeks before their comment. They did not give the precise offer interval, interview questions or office location.

09: LFU in New Delhi

Interview date: July 2026 · Role: SWE Intern · Location: New Delhi · Status: No offer recorded

A campus applicant named LFU cache design as their own question. The report does not preserve its interface, follow-ups or eviction tie rule. Other students' questions were not this candidate's interview.

10: Seven questions in the New York OA

Interview date: July 2026 · Report date: July 15, 2026 · Role: SWE Intern · Location: New York

The applicant described four MCQs and three easy-to-medium coding questions. Heap/max-heapify, DFS and GET/API work were explicitly mentioned, as detailed in OA 01. No later live round was described.

11: Three-part search-query screen

Update date: July 8, 2026 · Role: Full Stack Intern · Result: Rejected the next day

After an earlier post asking about the upcoming screen, the candidate returned to say they had completed it. Their question concerned search-query processing in three parts. They did not publish the subproblems. Their posts in two communities describe one application experience.

12: An order-processing dependency graph

Report date: July 5, 2026 · Interview: A few months earlier · Role: Intern

A different commenter described their own order-processing problem. After unpacking the story, they recognized topological sorting. The interviewer supplied hints on edge cases. The comment does not establish the exact intern specialization or outcome; its separate API/rate-limiter suggestions were advice, not additional interview tasks.

13: Full-stack coding, web fundamentals and a resume deep dive

Report date: May 1, 2026 · Role: Fullstack SWE Intern · Result: No team match

January 8: HackerRank invitation; roughly seven or eight MCQ/coding questions reported.

Screen: the four-follow-up string task above.

February 6: advancement notice, not the interview date.

Virtual onsite: three consecutive sessions—two medium coding problems; HTML/CSS/JavaScript fundamentals; a technical resume discussion.

The event year was not repeated. The candidate found no team match late in the cycle.

14: Easy questions, detailed questions about the code

Report date: January 29, 2026 · Role: SWE Intern · Location: San Francisco · Status: No offer recorded

The candidate described two or three easy coding questions, discussion of previous coding work and difficulties, and close questioning of functions used in their code. The concrete example was why they chose split() instead of strip(). The main coding prompts were not given.

Continue with the 2025 campus and U.S. loops, then the historical accounts, in Part 2.