Rippling SWE Intern Interviews: 101 Experiences (Part 1 of 5)
- Company
- Rippling
- Level
- Internship
- Stages
- OA → Phone screen → Onsite
Rippling SWE intern interviews, 2023 to 2026: an OA, a 45 to 60 minute coding screen, then a virtual onsite with coding and a project talk.
At a glance
- Process: Entry 71 runs from the virtual onsite to team matching, entry 72 describes the virtual onsite, and entry 33 two hiring-manager rounds. Entries 04, 07, 08 and 13 describe an OA with seven questions: four MCQs and three coding tasks.
- Asked: Median of Two Sorted Arrays in 8 of 84 current reports (parsed-list versions counted), a REST, JSON or URL-parsing task in 8 reports, currency conversion in 4 and the N-array median in 3. Why Rippling came up in 6 reports.
- Follow-ups: Entry 71 moved from DFS to Dijkstra, entry 45 had a second tree part, and entry 44 asked for the best conversion amount.
- Practise first: Median of Two Sorted Arrays, Median Across N Sorted Arrays, Maximum Currency Conversion and Top K Frequent Words.
Coverage: 101 internship experiences. 84 are from Nov 2023 to Nov 2026; 17 older ones (Feb 2019 to Oct 2023) are in Part 5. Roles: SWE, SDE, backend, full-stack, frontend and machine-learning software interns, including Winter and Summer 2027 cohorts. Places named: India, the U.S., Indonesia and Canada.
Terms: OA = online assessment · HM = hiring manager · LLD / HLD = low-level (class) / high-level (system) design · VO = virtual onsite · DSA = data structures and algorithms · CodePair = HackerRank's shared coding pad. PPO = pre-placement offer.
In this series
- Part 1 (current): overview, every question table, what to practise
- Part 2: OAs, recruiter and timing reports, no-task loops
- Part 3: screens
- Part 4: onsites
- Part 5: History
What came up
The median of sorted arrays tops the question table below (8 current reports), and an API, JSON or URL-parsing task appears in 8. Counts in At a glance, this section and What to practise count reports that named the exercise or one of its variants; a candidate can sit in more than one row.
| Topic | Reports | Last seen |
|---|---|---|
| Behavioral questions | 19 of 84 | Oct 2026 (report date) |
| Graphs, trees and dependency order (3 variant or unlinked) | 13 of 84 | Oct 2026 (report date) |
| Heaps, caches and sorted merges | 9 of 84 | Oct 2026 (report date) |
| Medians of sorted arrays and parsed lists | 9 of 84 | Oct 2026 (report date) |
| REST, JSON and URL-parsing tasks in the OA (6 variant or unlinked) | 8 of 84 | Oct 2026 (report date) |
| Strings, parsing and word counts (1 variant or unlinked) | 7 of 84 | Aug 2026 (report date) |
| Currency conversion (1 variant or unlinked) | 4 of 84 | Sep 2026 (report date) |
| Frontend and JavaScript (named exercises and text mentions) | 3 of 84 | May 2026 (report date) |
| System and low-level design | 1 of 84 | Oct 2026 (report date) |
Rows overlap: a report can count in more than one row.
Questions we found
Counts cover the 84 current reports in Parts 2 to 4. Each row counts only reports that named that exact question, so a row can be lower than the same exercise counted with its variants above. Questions from the older reports stay in their entries in Part 5.
Coding (algorithms and object-oriented tasks): named by two or more candidates
| Question | Reports | Last seen |
|---|---|---|
| Median of Two Sorted Arrays | 7 | Dec 2025 |
| REST API task: fetch and process JSON (OA) | 5 | Oct 2026 (report date) |
| Median Across N Sorted Arrays | 3 | Oct 2026 (report date) |
| Maximum Currency Conversion Along a Simple Path | 3 | Sep 2026 (report date) |
| Limit an Organization Tree's Height | 2 | Oct 2026 (report date) |
| Top K Frequent Words | 2 | Aug 2026 (report date) |
| Finish Order and Total Time for Dependent Tasks | 2 | Jul 2026 |
| Validate a DFS Traversal Order | 2 | Nov 2025 (report date) |
| Build a Max Heap | 2 | Nov 2025 (report date) |
Coding (algorithms and object-oriented tasks): named once
| Question | Reports | Last seen |
|---|---|---|
| Lexicographically Minimum Stack Encryption | 1 | — |
| Comment Word and Substring Search | 1 | — |
| String transmission cost: matching pairs and partitions | 1 | — |
| In-Memory Priority Task Scheduler | 1 | Oct 2026 (report date) |
| Multipart tree problem on traversal and height | 1 | Oct 2026 (report date) |
| Common Ancestors in a Directed Acyclic Graph | 1 | Sep 2026 (report date) |
| Graph DFS, then a Dijkstra follow-up | 1 | Jul 2026 |
| LFU Cache with LRU Tie-Breaking | 1 | Jul 2026 |
| Three-part search query processing | 1 | Jul 2026 (report date) |
| House Bounds in a Ragged Grid | 1 | Jan 2026 (report date) |
| Minimum of a Convex Function | 1 | Dec 2025 (report date) |
| Median of Parsed Integer Strings | 1 | Nov 2025 (report date) |
| Validate a Max Heap | 1 | Nov 2025 (report date) |
| Costliest Chocolate | 1 | Nov 2025 (report date) |
| Consistent Logs | 1 | Nov 2025 (report date) |
| Split Text by Multiple Delimiters | 1 | Nov 2025 |
| Merge Two Sorted Arrays | 1 | Oct 2025 (report date) |
| Maximum Parenthesis Nesting Depth | 1 | Oct 2025 |
| Shortest paths with Dijkstra (graph not described) | 1 | Aug 2025 |
| Hash-Based Network Load | 1 | Jul 2025 (report date) |
| Distributed System Recovery | 1 | Jul 2025 (report date) |
| REST API: Energy Bar | 1 | Jul 2025 (report date) |
| Server Upgrade Planning | 1 | Jul 2025 (report date) |
| Shortest Substring | 1 | Jul 2025 (report date) |
| Merge Overlapping Intervals | 1 | Jul 2025 |
| Top K Frequent Elements | 1 | Oct 2024 (report date) |
| Single-Source Shortest Paths | 1 | Oct 2024 (report date) |
| Merge K Sorted Arrays | 1 | Aug 2024 |
| Heap Sort | 1 | Jun 2024 (report date) |
| Parse URLs and match times (OA) | 1 | Jun 2024 (report date) |
| Currency conversion (variant not stated) | 1 | Mar 2024 (report date) |
| Synonym task (details not shared) | 1 | Jan 2024 (report date) |
| Preorder Traversal of a Parsed N-ary Tree | 1 | Nov 2023 |
| Lowest Common Ancestor of Deepest Leaves in an N-ary Tree | 1 | Nov 2023 |
Low-Level Design (LLD/OOD)
| Question | Reports | Last seen |
|---|---|---|
| Design a Shared Expense Splitting Service | 1 | Oct 2026 (report date) |
Frontend / JavaScript
| Question | Reports | Last seen |
|---|---|---|
| Draw a four-square grid in HTML and CSS | 1 | Nov 2025 |
| JavaScript task queues, var vs let, and object binding | 1 | Nov 2025 |
System Design
| Question | Reports | Last seen |
|---|---|---|
| Multi-tenant employee leave management | 1 | Oct 2026 (report date) |
Behavioral (BQ)
| Question | Reports | Last seen |
|---|---|---|
| Why Rippling, and what do you know about it? | 6 | Nov 2025 (report date) |
| Walk me through a past project in depth | 5 | Oct 2026 (report date) |
| A difficult challenge and how you solved it | 4 | Jan 2026 (report date) |
| Introduce yourself | 3 | Aug 2026 (report date) |
| What are you looking for next in your career? | 2 | May 2026 (report date) |
| Which project are you most proud of? | 2 | Jan 2025 |
| How do you use AI in your daily work? | 1 | Dec 2025 (report date) |
| How do you handle conflict in a team? | 1 | May 2025 (report date) |
| A team project and how the work was split | 1 | May 2025 (report date) |
Common questions
What is on the Rippling SWE intern OA?
Entries 04, 07, 08 and 13 describe four MCQs next to three coding tasks, and entry 08 included GET requests to an API. The campus OA in entry 06 had two DSA problems in 60 minutes.
How long is the Rippling intern technical screen?
The reports that give a length say 45 to 60 minutes (43, 05 and 40) and 50 minutes (58). Entry 05 names CodePair. Entry 58 had two problems in that time and entry 39 had three in one call.
What coding questions does Rippling ask interns?
The median of two sorted arrays leads the question table (8 current reports counting parsed-list variants, 7 as the exact question), and the N-array version was named in 3. Currency conversion (4), tree height (3), task ordering (2) and top-K (3) follow.
How fast is Rippling intern team matching?
One intern was in team matching about 12 hours after the onsite (71) and another two days after (17). Entry 16 was still waiting about two weeks after the onsite, and in entry 79 the teams had filled.
What to practise
- Median of Two Sorted Arrays. Named in 8 current reports, counting parsed-list variants, most recently Dec 2025 (55, 74, 56, 75, 63, 66, 82 and 83).
- Median Across N Sorted Arrays. The follow-up, in 3 reports (41, 63 and 83).
- Maximum Currency Conversion Along a Simple Path. 4 reports, counting versions with no stated rule, most recently Sep 2026 (44, 74, 59 and 81).
- Finish Order and Total Time for Dependent Tasks. 2 reports in 2026 (48 and 51).
- Limit an Organization Tree's Height. 3 reports, counting the multipart tree version, dated 2026 (40, 68 and 54).
Keep practicing
- Parts 2 to 5 list every entry with its practice links.
- Rippling question banks, sign-in needed: coding, behavioral, system design and project coding.
- The Rippling interview guide, Rippling hiring insights and the Experience feed.
- More roundups: new grad, experienced SWE, no level and AI coding rounds.
In this series
Sources: Anywhere useful interview info can be found.
Comments
0No comments yet — be the first to share what you know.