Rippling · OA → Phone screen → Onsite
In process2019–2026 Rippling SWE Intern OA / Interviews: 63 Experiences (Part 4 :)
Coverage: Part 4 continues the 63-experience Rippling software-intern series with candidate timelines 44–62. The entries continue from newer accounts to older ones; interview dates, report dates, roles, and locations remain labeled in each account.
19 detailed candidate timelines, loops, and screens
44: A twenty-minute recruiter conversation still ended in rejection
Report date: February 19, 2024 · Role: Summer 2024 Intern · Result: Rejected three days after recruiter screen
The roughly 20-minute call covered the resume, what the candidate had done in earlier internships, knowledge of Rippling, and familiar programming languages. The recruiter took notes on the internship discussion. The candidate said Python was mentioned as a language used by the company.
They had researched the products and company principles and recalled positive feedback on that preparation. The later rejection surprised them. Their suggestion that project or team fit might explain it was speculation, not feedback from the employer.
45: An internship offer after a relaxed matching conversation
Report date: February 7, 2024 · Role: SDE Intern · Result: Offer
The candidate had no other offer and expected to accept. In replies, they described the hiring-manager conversation as relaxed and similar to team matching, and emphasized the importance of the team. They did not remember the OA questions.
46: Math and HTTP/JSON in the OA
Interview date: January 2024 · Report date: January 25, 2024 · Role: SWE Intern · Location: San Francisco · Status: No offer recorded
The report listed four stages: OA, behavioral, algorithm technical, and a frontend/backend-specific technical. Of the OA's four questions, two concerned math and one required HTTP requests and JSON parsing; the remaining task was not described. No exact later-round question was preserved.
47: Median and a synonym task, with a detailed internship discussion
Report date: January 24, 2024 · Role: Intern · Status: Awaiting an outcome
Across the technical screen and virtual onsite, the candidate named a synonym task and LeetCode 4, Median of Two Sorted Arrays. The synonym label alone does not establish the exact exercise. The report also does not assign each coding question to a specific round.
The behavioral discussion examined earlier internships in depth, covering technical and behavioral details. The candidate described all three interviewers as kind.
48: Graph coding in a four-stage account
Report date: January 17, 2024 · Role: SWE Intern · Location: San Francisco · Status: No offer recorded
The candidate listed OA → behavioral → technical with two DSA questions → matching. Graphs were the disclosed coding topic. The report does not preserve the problems' inputs, outputs or follow-ups, or clearly establish completion of matching.
49: Two-array median, then two parsed N-ary tree tasks
Final interview date: November 14, 2023 · Report date: November 17, 2023 · Role: SDE Intern · Result: Rejected after virtual onsite
September 9: applied. September 19: OA invitation. September 27: completed the OA with all tests passing.
October 12, recruiter call: difficulties in an earlier internship, the project they were proudest of, and preferred teams.
October 24, technical screen: Median of Two Sorted Arrays. A linear-time solution was accepted without requiring the binary-search optimum. The follow-up asked for the median of N sorted arrays.
November 14, two virtual-onsite sessions: the coding session required parsing input lists and building N-ary trees. The first task was preorder traversal; the second was a variant of LeetCode 1123, finding the lowest common ancestor of the deepest leaves. Both were implemented, but a bug took a long time to find and the second task's tests passed only in the final minute.
The other session covered the resume, behavioral questions, and the design process behind the candidate's proudest project.
50: Synonymous sentences, then three stages of file-word processing
Final interview date: October 31, 2023 · Reports: November 3 and 5, 2023 · Role: Summer 2024 Intern
These two posts cover one candidate's phone screen and final loop. After applying through a campus-event link in early September, they completed the OA on September 15, had a recruiter call on October 3, and interviewed by phone on October 17.
The phone-screen post named LeetCode 1258, Synonymous Sentences. The candidate described a friendly interviewer and about 15 minutes of conversation before coding.
October 31 virtual onsite: one session was a technical deep dive into projects and previous internships. The other was a three-part string/file task: count valid words in a file, filter words by a stated condition, and find the top K most frequent words satisfying that condition. Count, Filter, and Rank Words in a File covers that progression. The original post did not disclose the validity or filtering rules.
51: An OA spanning algorithms and REST
Report date: October 22, 2023 · Role: SWE Internship · Result: Rejected
The candidate named HackerRank for the OA and disclosed topological sorting, heaps, REST APIs and geometry. The full task statements, question count and later interview details were not available in the account.
52: IPv4 classes, television records, and beacon geometry
Report date: October 18, 2023 · Role: Summer 2024 SWE Intern · Platform: HackerRank
The candidate remembered seven questions: four basic algorithm MCQs, which they omitted, followed by three coding tasks. They recalled roughly 120 minutes and no camera requirement. Six screenshots preserved these coding prompts:
- IPv4 Address Classification: reject invalid addresses with
-1; otherwise return class 1–5 using first-octet ranges0–127,128–191,192–223,224–239, and240–255. The first range includes both0and127. The source allows up to1,000addresses, each7–15characters long. - TV Shows Produced During a Period: fetch paginated television records and parse production spans written as closed ranges, ongoing ranges, or a single year, sometimes preceded by
(I)or(II). Return alphabetically ordered names whose production began no earlier thanstartYearand ended no later thanendYear;endYear = -1instead requires an ongoing show. - Cyber Beacon Detection: count integer-coordinate points inside an inclusive axis-aligned rectangle and within distance
Rof a beacon. The pictured rectangle(0,0)to(1,1), beacon(0,-7), andR = 8has answer3.
An author reply confirmed that API-response parsing was required.
53: Performance-review word counts grew into a distributed-system discussion
Report date: October 5, 2023 · Role: Summer 2024 Intern · Stage: Technical screen
The coding task was framed as an analytics tool for employee performance-review documents. Starting with a document supplied as a string, count its words. Then return the most common word, and finally the top three. Document Word Statistics covers the coding progression with explicit practice token rules.
The interviewer then stopped coding and enlarged the scale: what if the word-count dictionary would not fit in memory and had to move to disk? What if it would not fit on one machine's disk either? The discussion asked how multiple machines could compute the same result. Distributed Word-Frequency Analytics covers that design follow-up. The report did not state production workload numbers.
54: Rejected after the HR screen
Interview/report period: December 2022 · Role: SWE Internship · Result: Rejected after HR
The candidate completed an OA with three coding questions and three MCQs, then a 30-minute HR conversation about background, the resume and the company. A technical and a two-hour final—one hour behavioral, one hour technical—were described as future steps. This candidate did not complete them.
55: A graph-traversal screen for Summer 2023
Report period: December 2022 · Role: Summer 2023 SWE Intern
A firsthand commenter described graph traversal in their first technical interview and said they did not reach the final round. They did not give a complete prompt or further stage details.
56: An eight-week U.S. loop
Interview date: November 2022 · Report date: October 1, 2023 · Role: Software Engineering Intern · Location: San Francisco · Result: Accepted offer
The candidate described OA → recruiter → one-hour phone technical → onsite technical and behavioral interviews. The overall process took eight weeks. They characterized the coding as medium-to-hard without naming the tasks.
57: Graphs after a mixed OA
Report date: October 18, 2022 · Role: Software Engineering Intern
The account listed a HackerRank OA with MCQs and coding, a recruiter stage, a graph-focused technical and a final round. It did not preserve a graph prompt or a detailed outcome.
58: Jump scores and weighted endpoint picks
Original report date: August 29, 2022 · Role: FTE plus six-month internship · Result: Selected
OA: three questions involving trees/DP and binary search—two medium-hard, one easy-medium. The candidate solved about two and a half.
First technical, 45 minutes: introductions and project discussion, then maximum jump score. Start at index 0, reach n−1, jump forward 1 through K positions, and add visited values, including both endpoints. The candidate coded recursion, DP, heap and deque approaches.
Second technical, 60 minutes: introductions and project discussion, then maximize the sum of K picks from either array end. They discussed recursion and a sliding window. The weighted follow-up multiplied successive picks by a fixed sequence of K multipliers; their solution used DP. There was no separate HR round.
59: Three named algorithms in a 75-minute CodeSignal OA
Report date: March 20, 2022 · Role: SDE Intern · Platform: CodeSignal
This older assessment lasted 75 minutes and contained three named tasks: LeetCode 266, Palindrome Permutation; LeetCode 127, Word Ladder; and LeetCode 1190, Reverse Substrings Between Each Pair of Parentheses.
The candidate described deciding to take each available assessment seriously after previously letting opportunities expire or attempting them without preparation. They did not report a result.
60: Three trees and a complete LFU design
Original report date: November 29, 2021 · Role: Intern+FTE · Result: Selected
OA, 60 minutes on HackerEarth
- Endpoint game: alternate taking the first/last array value; maximize first-player-minus-second-player score with optimal play. The first player starts.
- Prime digit-sum count: count in
[L,R], with1 ≤ L ≤ R ≤ 10^18. - An unnamed graph problem.
Weights: 40/70/40. The first two were fully solved; ten students advanced.
Technical, 60 minutes: after introductions, find the maximum-average subtree root, maximum invitations with no adjacent invitees, and minimum broadcast rounds on an N-ary tree. Broadcasting starts at the root; each informed node contacts one child per round. All three required code, explanations and use of hints.
Design, 60 minutes: project challenges and future improvements, then fully implement LFU with LRU ties, optimize time and space use and explain the design. Four reached this stage; two were selected, including the author.
61: Four coding topics across two rounds
Report date: February 13, 2021 · Role: SWE Internship · Result: Accepted offer
The candidate described two coding rounds with two string questions, one DP question and one graph question. The hiring-manager round was skipped. No complete task statements were retained.
62: A referral and three DSA interviews in 2019
Interview period: February–April 2019 · Role: Summer Intern · Location: India · Result: Offer
The candidate described a referral and three DSA interviews between late February and late March, with difficulty rising from easy toward medium/hard. The offer arrived in April. The account was published in September 2023; the interviews belong to the 2019 cycle. Exact coding prompts were not provided.
Patterns across the reports
Median questions recurred, but the follow-ups differed. Six candidates explicitly named the median of two sorted arrays. Reports 32 and 49 extended that task to N arrays. Report 22 instead changed a parsed list into a dictionary, while report 40 named parsing plus a median of combined sorted lists. Those parsing contracts remain separate.
A solved first part could lead to a different demand. Report 08 moved from DFS to Dijkstra, and report 05 added maximum-return currency conversion. Word processing progressed from counts to top-K selection in reports 53 and 50; only the latter explicitly added a word filter. The older endpoint-pick loop in report 58 introduced fixed-order multipliers.
Full-stack loops included frontend work. Report 15 described HTML/CSS/JavaScript fundamentals alongside coding and a resume discussion. Report 24 preserved a concrete HTML/CSS four-square task and JavaScript topics. In that second account, a session advertised as a project deep dive turned out to be general behavioral questions.
Projects could take substantial time. Report 03 described a 45-minute resume/project discussion. Campus report 38 included a live GitHub demonstration; report 36 focused on earlier internships and web stacks. Report 49 asked the candidate to explain the design process behind their proudest project.
Optimization expectations varied. Report 49 accepted a linear-time median solution without requiring binary search. In report 30, the candidate said an O(n) string solution was insufficient because the interviewer wanted a specific hash-map approach with the same complexity. Report 16 adds close questioning of individual library calls. These accounts describe different evaluations.
Team matching had different endings. Report 11 reached matching two days after the onsite and received an offer. Report 08 reported a roughly 12-hour transition, without a final offer established. Report 15 found no team late in the cycle. In report 39, repeated manager calls were followed by notices that the teams had filled and then rejection.
In this series
Comments
0No comments yet — be the first to share what you know.