Rippling · OA → Phone screen → Onsite
In process2019–2026 Rippling SWE Intern OA / Interviews: 63 Experiences (Part 3 :)
Coverage: Part 3 continues the 63-experience Rippling software-intern series with candidate timelines 27–43. The entries continue from newer accounts to older ones; interview dates, report dates, roles, and locations remain labeled in each account.
17 detailed candidate timelines, loops, and screens
27: Parenthesis nesting in a 50-minute screen
Interview date: October 2025 · Report date: October 22, 2025 · Role: SWE Intern · Location: San Francisco · Status: No offer recorded
After applying online and passing the OA, the candidate had a first virtual technical with two questions in 50 minutes. They described an easy and a medium-hard task; one asked for a string's maximum parenthesis depth. The other prompt was not shared. Maximum Parenthesis Nesting Depth covers the disclosed task with a balanced-input practice contract. The interviewer expected a self-introduction and an explanation of the code while it was being written.
28: OA, recruiter, then a reported pairing stage
Report date: October 13, 2025 · Role: SWE Intern · Location: New York · Status: No offer recorded
The online applicant described a HackerRank OA and recruiter questions about background and interest in Rippling. Pair coding was listed next in the process. The account does not establish a completed pairing round or disclose its question.
29: Two hiring-manager conversations after the virtual onsite
Interview date: September 2025 · Report date: December 29, 2025 · Role: SWE Internship · Location: New York · Result: Accepted offer
This referral application took about two months: OA → recruiter → technical interview → virtual onsite with technical and behavioral work → two hiring-manager rounds. The candidate described useful hints in technical rounds and quick advancement messages, sometimes within an hour. Their reported behavioral prompts were self-introduction and why Rippling. The technical problems were not shared.
30: The interviewer wanted a particular hash-map approach
Interview date: August 2025 · Report date: October 7, 2026 · Role: SDE Intern · Location: North Guwahati · Result: Rejected after round one
The campus candidate received a string problem. They described their own solution as O(n), but said the interviewer expected a particular hash-map approach with the same time complexity. The full task and the difference between those approaches were not given. A second technical was part of the overall process; the candidate did not reach it.
31: Currency conversion with little time left for the follow-up
Report date: August 29, 2025 · Role: Intern · Result: Rejected the next day
The interviewer arrived late, briefly introduced a currency-conversion task, and moved into coding. The candidate used DFS and fixed several bugs after trying the implementation. They received no extra time and said they did not give the correct follow-up approach. Currency Conversion with Maximum Return covers the practice family; this particular report does not repeat the follow-up's full rules.
32: Two-array median, then N-array median
Interview date: July 2025 · Report date: August 18, 2025 · Role: SDE-intern · Location: Allahabad · Status: No offer recorded
The campus process took three days. The OA had a medium stack task and a hard design task, neither fully described. The first technical asked for the median of two sorted arrays, then extended the question to N sorted arrays. Practice pages cover the two-array task and the N-array follow-up. The account does not state required complexity, examples or the design prompt.
33: Three screen tasks and candidate-written test cases
Interview period: July 2025 · Report date: August 11, 2025 · Role: Winter 2026 Intern
The OA invitation arrived in mid-June and the candidate finished it in early July. In the mid-July technical screen, they received an easy stack task, a task involving Merge Intervals with some preprocessing, and a harder stack task. They had to write their own test cases. The two stack prompts and the interval preprocessing rules were not disclosed.
The virtual onsite also happened in mid-July. The candidate said they had seen its question before but did not identify it. They described quick recruiter feedback and said the recruiter call came within a week of finishing the OA.
34: Seven OA tasks preserved in screenshots
Report date: July 19, 2025 · Role: Winter 2026 Intern · Result: Rejected
The author preserved the questions in screenshots and later confirmed rejection. The seven identifiable tasks were:
- Hash-Based Network Load: assign IDs
17, 27, 16, 5, 11, 13, 9, 23, 25to computers0…6usingid mod 7, then identify every computer with the highest load. - Validate a DFS Traversal: select valid traversals from node
0in the pictured undirected graph. - Build a Max Heap: construct the heap array from
[6, 15, 2, 4, 3, 8, 19]. The first three tasks were multiple-choice items. - Distributed System Recovery: starting from an online node, recover reachable nodes by increasing hop count, then smaller ID within the same distance; omit the starting node and unreachable nodes.
- REST API: Energy Bar: filter paginated chocolate records by country, then maximize
floor(kcal × 0.01 × floor(mean(weights))); use the lowerfloor(mean(prices))for an energy tie. Returnbrand:type. - Server Upgrade Planning: perform at most one upgrade per second, allowing idle seconds. A server cannot be upgraded at seconds divisible by its request interval. Find the minimum time needed for both upgrade totals; request intervals range from
2to30,000, and each upgrade total can reach10⁹. For intervals2and3with upgrade totals3and1, the minimum is5seconds; for two intervals of2with totals1and3, it is7. - Shortest Substring: remove one contiguous substring so the joined remainder has no repeated characters, minimizing the removed length. The input is up to
100,000lowercase English letters. The source'sabcbbckandxabbcacpqrexamples both require removing three characters.
35: One completed part and one explained part
Report date: July 13, 2025 · Role: SWE Intern · Location: New York · Result: Did not advance
The recruiter discussed background, the resume, interest in Rippling and the remaining process. The first technical lasted one hour and used a hard problem in two parts. The candidate completed the first and explained an approach for the second, then did not move forward. The problem itself was not disclosed.
36: A campus SDE interview focused on prior web work
Report publication: June 2025 · Role: SDE internship · Location: IIT Kharagpur campus · Result: Internship obtained
The candidate described HackerRank OA → coding interview → HR. The technical discussion concentrated on earlier internships, web-development experience and the stacks used, alongside coding. The book's heading says AI engineer, but the candidate explicitly says they ultimately landed an SDE role. Its two pages are one continuous account. The interview month was not specified.
37: ML-software application ended after a nontechnical screen
Interview date: January 2025 · Role: Machine Learning software summer intern 2025 · Result: Rejected after recruiter screen
January 11: applied. January 18: completed the OA. January 22: received the scheduling invitation for the nontechnical interview.
In their January 29 post and update, the candidate listed self-introduction, why Rippling, knowledge of the company, and the work/project achievement they were proudest of. The interviewer explained the company and internship process. The candidate later confirmed rejection the next day, before a technical round. No OA, ML or live-coding prompt was disclosed.
38: Backend strings, hints and a live project demo
Report date: January 20, 2025 · Role: Backend Software Intern · Location: Indian campus · Result: Selected
August 10, OA: 60 minutes, two array problems, one easy and one medium-to-hard. Results arrived the next day; 38 students were shortlisted.
August 12, technical: a 45-minute story-based string problem, coded live on the candidate's laptop. Follow-ups and test cases caused difficulty, and the interviewer supplied hints.
HR, 15–20 minutes later: a 50-minute discussion of project stacks, workflow, challenges and improvements, including a live GitHub demonstration. The panel also asked about co-curricular activities and the third-year curriculum project. Five students, including the author, were selected. The post does not state the year of those August interviews.
39: Top-K in the phone screen, shortest paths in the onsite
Report date: October 15, 2024 · Role: SWE Intern, 2025 cohort · Result: Rejected after matching calls
The candidate applied in July. The OA had an easy coding task, a fetch/API-parsing task, a geometry task, and several multiple-choice questions. Their exact statements were not shared. A behavioral screen followed about two weeks later.
The phone screen named LeetCode 347, Top K Frequent Elements. Several weeks later, one virtual-onsite coding round involved a single-source shortest-path algorithm, followed by a resume deep dive. The shortest-path practice supplies explicit graph and edge-weight conventions absent from the report.
The candidate then spoke with managers for team matching more than once. They said they were told after those calls that the teams had already filled, then received a rejection. They found the scheduling frustrating and described recruiter replies as taking a week or longer.
40: Parsing and the median of combined sorted lists
Report date: October 3, 2024 · Role: SWE Internship · Location: San Francisco · Result: Rejected
The candidate described an OA followed by a DSA interview. Their question summary named string parsing and finding the median of the merge of two sorted lists. Practice for the median step: Median of Two Sorted Arrays. The account did not retain the parsing format, examples or requested implementation.
41: Merge K arrays before team matching
Interview date: August 2024 · Report date: January 3, 2025 · Role: SWE Internship · Location: San Francisco · Result: Accepted offer
The process ran through a recruiter, phone interview, onsite behavioral/technical interviews and manager matching. The named coding task was merging K sorted arrays, described as medium. Bounds and edge rules were not provided.
42: A seven-question OA with URL parsing and time matching
Report date: June 25, 2024 · Role: Winter 2025 Intern
The OA arrived the evening the candidate applied. It contained four multiple-choice questions and three coding tasks. The MCQs covered Heap Sort, two graph questions, and time complexity.
The candidate found the coding logic manageable but ran out of time on questions 5 and 7. Question 6 required parsing URLs and matching times; after about an hour, some tests still failed. The report does not preserve the URL format, matching rule, or the other two coding tasks. Their point was that the assessment involved practical parsing as well as algorithm knowledge.
43: Three weeks from OA through the final loop
Report date: March 4, 2024 · Role: SWE Internship · Location: San Francisco
The candidate described an OA, a 30-minute recruiter conversation, a 60-minute technical and a two-hour technical/resume loop. Their question summary mentioned grid-style problems and recursive currency conversion, without enough mechanics to reconstruct either task.
In this series
Comments
0No comments yet — be the first to share what you know.