Rippling Intern Phone Screens: 28 Experiences (Part 3 of 5)

Shared by JaneBeingJane ·
Company
Rippling
Reports
28 interview reports
Level
Internship
Stages
OA → Phone screen → Onsite

Rippling SWE intern phone screens, 2024 to 2026: median, tree, currency and graph tasks, each with a follow-up.

At a glance

  • Format: The reports that give a length say 45 to 60 minutes (43, 05 and 40) and 50 minutes (58). Entry 58 had two problems and entry 39 had three.
  • Asked: Medians of sorted arrays in 5 of 28 screens; currency conversion in 2, task ordering in 2 and tree height in 2.
  • Later parts: Entry 59 had no extra time for part two, and entries 45 and 64 did not finish or code part two.
  • Practise first: Median of Two Sorted Arrays, Median Across N Sorted Arrays and Maximum Currency Conversion.

Coverage: 28 reports, Oct 2024 to Nov 2026. Intern technical screens and single coding rounds. Places named: the U.S. and India.

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.

In this series

  • Part 1: overview, every question table, what to practise
  • Part 2: OAs, recruiter and timing reports, no-task loops
  • Part 3 (current): screens
  • Part 4: onsites
  • Part 5: History

What came up

Across these 28 screens, the median family and graph or tree tasks lead.

Topic Reports Last seen
Graphs, trees and dependency order (2 variant or unlinked) 7 of 28 Oct 2026 (report date)
Medians of sorted arrays and parsed lists 5 of 28 Oct 2026 (report date)
Currency conversion 2 of 28 Sep 2026 (report date)
Heaps, caches and sorted merges 2 of 28 Jul 2026
Strings, parsing and word counts (1 variant or unlinked) 2 of 28 Jul 2026 (report date)

Rows overlap: a report can count in more than one row.

Technical screens

39: One call, three medium problems, two were enough

Report date: Nov 6, 2026 · Role: Intern · Result: Declined offer

  1. One call: three medium LeetCode-style problems; finishing two was enough. They got an offer and declined it.

40: Three connected tree problems in an hour

Report date: Oct 29, 2026 · Role: SWE Intern · Result: No offer

  1. Technical (60 min).
    • Three connected tree problems where later parts extend earlier ones.

41: Median salary across departments, then n of them

Report date: Oct 26, 2026 · Role: Software Engineer Intern · Location: San Francisco · Result: No offer

  1. Technical.
    • Median Across N Sorted Arrays: Two departments each give a sorted salary list: find the median of all salaries, then do it for n departments (two pointers, then a priority queue).

42: Two separate medium parts in one interview

Interview date: Oct 2026 · Report date: Oct 27, 2026 · Role: SWE Intern (backend)

  1. Technical interview: two separate parts, both around medium. The tasks were not shared.

43: Common ancestors in a short graph screen

Report date: Sep 15, 2026 · Role: SDE Intern

  1. A 45–60 minute technical screen on common ancestors in a graph. They called it simple. Neither the graph nor the extra parts were shared.

44: Currency queries, then the best amount

Report date: Sep 5, 2026 · Role: Internship · Stage: Technical phone screen

  1. Given exchange rates and conversion queries, return the amount you can get in the target currency, or -1 if no path exists (Currency Conversion with Maximum Return).
  2. Follow-up: the maximum target amount, which they saw needed backtracking.

45: A tree question stopped at part two

Report date: Aug 25, 2026 · Role: SWE Intern, Winter 2026 cohort · Result: Rejected after the screen

  1. Once past the OA, they got a tree task in several parts: walking the tree, DFS and height. They did not finish part two. The interviewer was kind.

46: Passed the first Winter Intern technical

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

  1. A first technical interview with two DSA problems and a self-introduction, passed. No second-round news yet.

47: A backend interview with one graph question

Report date: Jul 20, 2026 · Role: SWE Backend Intern · Result: Went OK

  1. Interview.
    • A graph question (not described).

48: Tasks with durations and prerequisites

Interview date: Jul 2026 · Report date: Aug 2, 2026 · Role: Backend SWE Internship · Location: San Francisco · Result: No offer

  1. Technical: A graph problem.

49: LFU in New Delhi

Interview date: Jul 2026 · Role: SWE Intern · Location: New Delhi

  1. A campus applicant's question was LFU cache design. Interface, follow-ups and tie rule were not shared.

50: A three-part search-query screen

Report date: Jul 8, 2026 · Role: Full Stack Intern · Result: Rejected the next day

  1. The screen was one search-query processing problem in three parts; the parts were not described.

51: An order-processing dependency graph

Report date: Jul 5, 2026 (interview a few months earlier) · Role: Intern

  1. A story about processing orders turned out to be topological sort once unpacked (Finish Order and Total Time for Dependent Tasks). The interviewer gave hints on edge cases.

52: Houses in a grid with uneven rows

Interview date: early Dec 2025 · Report date: Jan 31, 2026 · Role: Full Stack Intern · Result: Rejected the next day

  1. Straight to coding after an introduction: connected occupied cells form a house; for each, return its upper-left and lower-right coordinates like A2 and B3. The grid was ragged, with rows of different lengths (House Bounding Coordinates in a Ragged Grid).
  2. They tried DFS but did not finish, then discussed complexity. They found the interviewer hard to understand, even with subtitles.

53: Easy questions, close questions about the code

Report date: Jan 29, 2026 · Role: SWE Intern · Location: San Francisco

  1. Two or three easy coding questions, a talk about past coding work and difficulties, and close questions on the functions they used, such as why split() and not strip().

54: Reporting height, then the fewest CEO transfers

Report date: Jan 28, 2026 · Role: Internship · Stage: Technical screen

  1. Employees 1..n with employee 1 as CEO; parallel manager and reportee arrays form a tree. Find the deepest reporting chain.
  2. Then, given a limit h, find the fewest employees to move directly under the CEO so the tree is no deeper than h (Reporting Hierarchy Height and Minimum CEO Reassignments).

55: A story-wrapped median in CodePair

Interview date: Dec 2025 · Report date: Dec 16, 2025 · Role: SDE Intern · Location: Bangalore Rural

  1. A one-day campus process. In a 60-minute CodePair interview they began with brute force, then worked up to the best approach for Median of Two Sorted Arrays, then coded and ran it.

56: Parse a list, find the median, then switch to a dictionary

Report date: Nov 19, 2025 · Role: Full-stack Intern

  1. A senior engineer pasted a list task in HackerRank: parse the data, find the median and explain the complexity (Parse Values and Find Their Median).
  2. Follow-up: the data became a dictionary; find the median again. A relaxed interview.

57: Merge two arrays and a hard-challenge question

Report date: Oct 25, 2025 · Role: SWE Intern

  1. A HackerRank live interview with a Software Developer III: merge two sorted arrays, which they called hard, and a question about their toughest challenge.

58: Parenthesis nesting in a 50-minute screen

Interview date: Oct 2025 · Report date: Oct 22, 2025 · Role: SWE Intern · Location: San Francisco

  1. Once the OA was done, a video technical round gave them two questions inside 50 minutes, one easy and one medium-hard. One asked for a string's maximum parenthesis nesting depth; the other was not shared.
  2. The interviewer expected a self-introduction and explanation while coding.

59: Currency conversion, and part two squeezed for time

Report date: Aug 29, 2025 · Role: Intern · Result: Rejected the next day

  1. The interviewer arrived late, briefly set up a currency-conversion task, and went straight to code.
  2. They used DFS and fixed several bugs on the way; no extra time was given, and they think their idea for the second part was wrong.

60: The interviewer wanted a particular hash-map approach

Interview date: Aug 2025 · Report date: Oct 7, 2026 · Role: SDE Intern · Location: India campus · Result: Rejected after round one

  1. A string problem. Their solution was O(n), but the interviewer was looking for a specific hash-map approach with the same complexity. They did not reach the second technical.

61: A medium-hard whiteboard problem, few hints

Interview date: Aug 2025 · Role: Software Engineer Intern · Location: United States · Result: Declined offer

  1. Whiteboard coding: a medium-hard problem; they wrote a full solution with few hints. They got an offer and declined it.

62: Dijkstra, and why it needs a heap

Interview date: Aug 2025 · Role: Software Engineer (Internship) · Location: India campus · Result: No offer

  1. Interview: code Dijkstra from scratch and explain what the heap is for, then one more question built on it. Questions on data structure theory came first.

63: Two-array median, then N-array median

Interview date: Jul 2025 · Report date: Aug 18, 2025 · Role: SDE Intern · Location: India campus

  1. A three-day campus process. Its OA mixed a medium task on stacks with a hard design task.
  2. The first technical was Median of Two Sorted Arrays, then the median across N sorted arrays.

64: One part done, one part explained

Report date: Jul 13, 2025 · Role: SWE Intern · Location: New York · Result: Did not advance

  1. A recruiter call on background, résumé and why Rippling.
  2. A one-hour technical with a hard two-part problem: part one coded, part two explained. Not shared.

65: Campus interviews in OA-score order

Interview date: Jul 2025 · Role: SDE Intern · Location: New Delhi · Result: No offer

  1. OA, then a DSA interview; students were called in the order of their OA scores. No offer.

66: Parsing, then the median of combined lists

Report date: Oct 3, 2024 · Role: SWE Internship · Location: San Francisco · Result: Rejected

  1. An OA, then a DSA interview: parse two sorted lists from a string and return the middle value once they are merged (Median of Two Sorted Arrays covers the median step).

Patterns across the reports

  1. Follow-ups. Entry 44 moved from any path to the best amount, entry 63 from two arrays to N, entry 54 from a tree's height to cutting it, and entry 41 from two departments to n.
  2. Explaining while coding. Entry 53 was asked why split() and not strip(), and entry 58 expected an explanation while coding.

Common questions

How long is the Rippling intern phone screen?

Entries 43, 05 and 40 say 45 to 60 minutes, and entry 58 says 50.

What is the Rippling intern median question?

The median of two sorted arrays came as a story problem (55) and as lists parsed from a string (66), followed by a version for N arrays (63) or department salary lists (41).

Keep practicing

In this series

Sources: Anywhere useful interview info can be found.

Next in this seriesRippling Intern Onsite Interviews: 18 Experiences (Part 4 of 5)
0 total reactions. Your reactions: none.

Comments

0

No comments yet — be the first to share what you know.