Rippling · OA → Phone screen → Onsite
In process2019–2026 Rippling SWE Intern OA / Interviews: 63 Experiences (Part 2 :)
Coverage: Part 2 continues the 63-experience Rippling software-intern series with candidate timelines 10–26. 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
10: OA passed; a one-hour screen was scheduled
Report date: July 28, 2026 · Role: SWE Intern
The candidate applied online, passed the OA and received scheduling materials. Their next appointment was a 60-minute CodePair technical with an SWE II. The instructions prohibited AI tools, offered a recording opt-out and said to check with the interviewer before looking something up. This account stops before the live interview.
11: Team matching two days after the virtual onsite
Interview period: July 2026 · Report date: July 28, 2026 · Role: Full-stack Winter 2027 intern, from thread context
In the Waterloo recruiting thread, an independent candidate reported reaching team matching two days after their virtual onsite and then receiving an offer. They said team matching had happened about two weeks before their comment. They did not give the precise offer interval, interview questions or office location.
12: LFU in New Delhi
Interview date: July 2026 · Role: SWE Intern · Location: New Delhi · Status: No offer recorded
A campus applicant named LFU cache design as their own question. The report does not preserve its interface, follow-ups or eviction tie rule. Other students' questions were not this candidate's interview.
13: Three-part search-query screen
Update date: July 8, 2026 · Role: Full Stack Intern · Result: Rejected the next day
After an earlier post asking about the upcoming screen, the candidate returned to say they had completed it. Their question concerned search-query processing in three parts. They did not publish the subproblems. Their posts in two communities describe one application experience.
14: An order-processing dependency graph
Report date: July 5, 2026 · Interview: A few months earlier · Role: Intern
A different commenter described their own order-processing problem. After unpacking the story, they recognized topological sorting. The interviewer supplied hints on edge cases. The comment does not establish the exact intern specialization or outcome; its separate API/rate-limiter suggestions were advice, not additional interview tasks.
15: Full-stack coding, web fundamentals and a resume deep dive
Report date: May 1, 2026 · Role: Fullstack SWE Intern · Result: No team match
January 8: HackerRank invitation; roughly seven or eight MCQ/coding questions reported.
Screen: a string task with four follow-ups, including top-K frequent words as datasets grew. The other follow-ups and exact scalability rules were not published. Practice for the frequency-selection component: Top K Frequent Words.
February 6: advancement notice, not the interview date.
Virtual onsite: three consecutive sessions—two medium coding problems; HTML/CSS/JavaScript fundamentals; a technical resume discussion.
The event year was not repeated. The candidate found no team match late in the cycle.
16: Easy questions, detailed questions about the code
Report date: January 29, 2026 · Role: SWE Intern · Location: San Francisco · Status: No offer recorded
The candidate described two or three easy coding questions, discussion of previous coding work and difficulties, and close questioning of functions used in their code. The concrete example was why they chose split() instead of strip(). The main coding prompts were not given.
17: Reporting height, then the fewest direct CEO transfers
Report date: January 28, 2026 · Stage: Technical screen · Internship listing
Employees were numbered 1 through n, with employee 1 as CEO. Parallel manager/reportee arrays described a tree. First, find the maximum reporting depth from the CEO. Then, given a limit h, find the minimum number of employees who must be moved to report directly to the CEO so that the hierarchy is no deeper than that limit. Practice: Reporting Hierarchy Height and Minimum CEO Reassignments. The report did not preserve an outcome.
18: Offline assessments, parsing and a discussion about AI
Report date: December 17, 2025 · Role: SDE Summer Intern · Location: IIIT Allahabad campus · Result: Selected
Assessments: two offline shortlisting tests with medium-to-hard, ad-hoc problems.
Technical, about one hour: a hard-question variation framed around Rippling’s work, combining parsing and strings. The candidate outlined brute force, a better option and their strongest approach, then discussed correctness and feasibility before coding. They explained the implementation aloud, debugged several issues and passed all test cases. Follow-ups changed input characteristics and explored suitable data structures.
Hiring manager: AI’s future and comparison with earlier technology shifts; why problem-solving still matters when AI generates solutions; everyday AI use; and reasoning through difficult bugs. The conversation also covered technical societies, hackathons and lessons from college.
The offer arrived within hours. The interview month was not given.
19: A story-wrapped median in CodePair
Interview date: December 2025 · Report date: December 16, 2025 · Role: SDE-intern · Location: Bangalore Rural · Status: No offer recorded
The campus process took one day. In a 60-minute HackerRank CodePair interview, the candidate discussed brute-force and optimal approaches to the median of two sorted arrays, then coded and ran the solution. Practice: Median of Two Sorted Arrays. No additional story rules were preserved.
20: House coordinates in a grid with uneven rows
Interview period: Early December 2025 · Report date: January 31, 2026 · Role: Full Stack Intern · Result: Rejected the next day
After a self-introduction, the candidate went straight into coding. Connected occupied cells represented a house. For each house, return its upper-left and lower-right coordinates in a format such as A2 and B3. The unusual part was that the matrix was ragged: different rows had different lengths. House Bounding Coordinates in a Ragged Grid preserves that distinction.
The candidate attempted DFS but did not finish the implementation, then discussed complexity. They said subtitles did not resolve their difficulty understanding the interviewer and some hints. Although the report was filed under OA, its body describes a live interviewer.
21: An ML round turned into convex-function search
Report date: December 6, 2025 · Role: MLE Intern
First technical: a simplified currency-exchange question, compared by the candidate with LeetCode 3387. The same-company currency-conversion practice covers the conversion family.
Final loop: three back-to-back sessions: 45 minutes behavioral, 60 minutes ML, and 60 minutes technical. The technical task was Median of Two Sorted Arrays.
In the ML session, the task was to find the minimum of an unknown convex function. The candidate first considered gradient descent; an interviewer hint led them to ternary search. The linked convex-function practice supplies a finite sampled domain, which was not specified in the report. The rest of the ML session asked resume-based ML fundamentals. An author clarification described the behavioral session as general BQ, without a project deep dive.
22: Parse a list, find its median, then change the representation
Report date: November 19, 2025 · Role: Full-stack intern
A senior engineer posted a list-based task in HackerRank: parse the data, calculate its median, and explain the complexity. The follow-up changed the data structure to a dictionary and again asked for the median. The candidate described a relaxed interview. The report does not preserve the exact input grammar or dictionary semantics; Parse Values and Find Their Median makes those practice rules explicit.
23: Heap and DFS choices alongside two coding tasks
Report date: November 16, 2025 · Role: SWE Intern · Cohort label: Summer 2025
The candidate called the first live round behavioral. They were asked why Rippling and about recent difficulties in a project or internship. The OA material they preserved contained these six items:
- Complexity analysis: nested loops whose work for outer index
iwas proportional toi³; summing overigaveΘ(n⁴). - Validate a Max Heap: choose a structure satisfying both the parent/child ordering and the complete-binary-tree condition.
- Validate a DFS Traversal: check a candidate traversal from node
0, including backtracking behavior. - Build a Max Heap: find the array after bottom-up heap construction. These heap and DFS items were selection questions in the source.
- REST API: Costliest Chocolate: retrieve paginated products for a brand, maximize a variant's price/weight ratio, and break ties by smaller product number.
- Consistent Logs: let the least frequent value in the full array occur
minFreqtimes; find the longest contiguous segment whose most frequent value occurs exactlyminFreqtimes.
The report discusses heap properties, bottom-up heapify, ratio comparison without floating-point error, and a frequency-based sliding window. It does not provide a final application outcome.
24: A four-square frontend task, string splitting, and general BQ
Final interview date: November 12, 2025 · Report date: December 2, 2025 · Role: Full Stack Intern · Result: Rejected
September 20: applied. October 23: a three-question OA; the prompts were not disclosed.
November 2, technical screen: Median of Two Sorted Arrays, identified as LeetCode 4.
November 12, three consecutive virtual-onsite sessions:
- Frontend: the report described JavaScript microtask/macrotask ordering,
varversuslet, and object binding as topics in the round. The candidate's concrete CSS task was to draw a four-square grid using HTML and CSS. Dimensions, colors, spacing, and responsive behavior were not specified. - Coding: a medium string-parsing question. In an author reply, they clarified that it meant splitting text using different delimiters. They found it straightforward. Practice: Split Text Using Multiple Delimiters.
- Behavioral: the invitation called this a project deep dive, but the candidate encountered general BQ. Examples were what they could bring to a manager and their plan for the next five years. They felt this was their weakest session; the report does not establish the employer's reason for rejection.
25: CodePair Tuesday, manager Wednesday
Report date: October 31, 2025 · Role: November-start SDE internship, from thread context
An independent commenter said their CodePair round happened on Tuesday and their manager round on Wednesday. They were waiting for a decision. They did not share the coding task or exact interview dates. Another person's OA description in the thread belongs to a different applicant.
26: Merge two arrays and describe a difficult challenge
Report date: October 25, 2025 · Role: SWE Intern · Status: No offer recorded
The candidate described a HackerRank live interview with a Software Developer III. Their task label was merging two sorted arrays, which they described as hard. They also received a behavioral question about their toughest challenge. The Merge Two Sorted Arrays exercise returns a new array. No location or further interview contract was provided.
In this series
Comments
0No comments yet — be the first to share what you know.