Rippling New Grad SDE Interviews: 11 Experiences

Shared by janebeingjane ·
Company
Rippling
Reports
2 interview reports
Level
New Grad
Stages
OA → Phone screen → Onsite

Rippling new grad SDE interviews, 2020 to 2025: campus OAs with two DSA problems, then one or two DSA rounds and a hiring manager talk.

At a glance

  • Process: Entry 02 had a 60-minute OA with two problems, a CodePair DSA round and a hiring manager round on projects and basics; entry 01 had an OA and a Zoom technical.
  • Asked: Entry 02 had tree diameter, parenthesis depth and the longest valid parentheses; entry 01 had Dijkstra.
  • Difficulty: The OA in entry 02 is two medium problems; entry 01 gives no level. Entry H02 in History went up to LeetCode hard.

Coverage: 11 new grad experiences. 2 are current (Dec 2024 to Dec 2025); 9 older ones (Dec 2020 to Nov 2022) are in History. 7 of the 11 give an Indian location.

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.

What came up

Only 2 current reports, so their questions are listed rather than ranked.

Questions we found

Coding (algorithms and object-oriented tasks)

Question Reports Last seen
Shortest paths with Dijkstra (graph not described) 1 Dec 2025 (report date)
Longest Transfer Time in a Server Tree 1 Dec 2024
String story that reduces to a directed graph 1 Dec 2024
Lowest common ancestor of two nodes (LeetCode 236 style) 1 Dec 2024
Maximum Parenthesis Nesting Depth 1 Dec 2024
Long implementation task solved with merge intervals 1 Dec 2024
Longest Balanced Stretch in Text with Brackets 1 Dec 2024

Behavioral (BQ)

Question Reports Last seen
Walk me through a past project in depth 1 Dec 2024
How do you handle conflict in a team? 1 Dec 2024
What are you looking for next in your career? 1 Dec 2024

Detailed candidate timelines

01: Graph and DP OA, then Dijkstra

Report date: Dec 8, 2025 · Role: Software Development Engineer (SDE), campus · Result: Accepted offer

  1. OA.
    • OA with one graph problem and one dynamic-programming problem (not described).
  2. Online interview, Zoom technical.
    • Shortest path problem solved with Dijkstra.

02: Campus SDE-1: tree diameter, parentheses, intervals and HM

Interview date: Dec 2024 · Report date: Feb 7, 2025 · Role: SDE-1 · Location: India campus · Result: Offer

  1. OA (60 min): Two medium DSA problems.
  2. R1 DSA (1 h; HackerRank CodePair, hidden tests): Story-style follow-ups, with hidden tests.
    • A story question about strings that turns into a graph walked with DFS.
    • A follow-up close to finding the lowest common ancestor of two nodes (LeetCode 236).
  3. R2 DSA (1.5 h): Three questions.
    • Maximum Parenthesis Nesting Depth: Given a valid bracket string, return the maximum nesting depth (LeetCode 1614).
    • A long, implementation-heavy problem they solved with merge intervals; the interviewer wanted the earlier optimization reused.
    • Longest Balanced Stretch in Text with Brackets: The longest balanced run of brackets inside a string that also has other characters (LeetCode 32). How they solved it: They explained the idea but did not code it.
  4. R3 Hiring manager (1 h).

History (before November 2023)

H01: Attendance strings, then counting later smaller values

Report date: Nov 23, 2022 · Role: SDE (2023 grad) · Location: Bangalore · Result: Offer

  1. Round 1: Counting valid attendance records (LeetCode 552).
    • Count Clean Attendance Logs: Count attendance strings of length n over P/A/L with fewer than 2 absences total and never 3 consecutive lates (LeetCode 552).
  2. Round 2.
    • Count Later Lower Readings: For each position, count the later elements that are smaller (LeetCode 315).
    • One question solved with binary search and a greedy step.

H02: Hard DSA rounds across DP, graphs and Fenwick trees

Report date: Nov 15, 2022 · Role: SDE1 (2023 grad) · Location: Bangalore · Result: Offer

  1. Campus interviews at LeetCode-hard level, touching graphs, Fenwick trees, greedy, DP, binary search and merge sort. They got an offer.

H03: Bus Routes in a DSA round

Interview date: Jul 2022 · Report date: Aug 12, 2022 · Role: Software Development Engineer (SDE1), university · Result: No offer

  1. Coding test: One easy and two medium-to-hard problems.
  2. 2 DSA interviews.

H04: Synonym sentences in a campus DSA round

Interview date: Jul 2022 · Role: Software Development Engineer · Location: Bengaluru · Result: No offer

  1. 2 DSA rounds: Graph and binary search problems, with hints.
    • Given synonym pairs and a list of sentences, count how many truly different meanings there are.

H05: A token bucket with unanswered clarifications

Interview date: May 2022 · Report date: Jul 5, 2022 · Role: New Grad SWE · Result: Did not pass this round

  1. Onsite coding (1 h): The interviewer deliberately left their clarifying questions unanswered.
    • Bucket with capacity: add(tokens) without overflow. Get() returns an arbitrary token without removing it. Follow-up: tokens drip in at constant rate r. Update add/get accordingly.

H06: One question that kept getting harder

Report date: Jan 26, 2022 · Role: SDE (new grad) · Result: Offer

  1. Interview: one standard question that grew harder step by step, with the interviewer guiding. They got an offer.

H07: Largest diamond of ones in a binary grid

Interview date: Sep 2021 · Role: Software Engineer · Location: Bengaluru · Result: No offer

  1. Campus OA: Easy to medium graph problems.
  2. DSA 1: Failed.

H08: Painter partition, tree DP and binary lifting

Interview date: Aug 2021 · Role: Software Development Engineer · Location: New Delhi · Result: No offer

  1. HackerEarth.
  2. Zoom DSA/OOP/projects.

H09: Three campus DSA rounds and a hard DP

Interview date: Dec 2020 · Role: Software Engineer (fresher) · Location: India · Result: No offer

  1. Three DSA rounds on graphs, sorting and trees. The last round had a DP problem they rated medium-hard; it was not described. No offer.

Common questions

What does the Rippling new grad OA have?

Entry 02 had two medium DSA problems in 60 minutes; entry 01 had one graph and one DP problem.

Keep practicing

Sources: Anywhere useful interview info can be found.

0 total reactions. Your reactions: none.

Comments

0

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