PayPal · OA
Not reportedPayPal SWE Intern OA Questions: 1 Experience
A November 2026 PayPal SWE intern OA had three coding questions the candidate called easy: a min-heap merge, a rate limiter and a running minimum.
At a glance
- Process: an online assessment with three coding questions, taken four days after the invite (report 01)
- Asked recently: merging values at minimum cost, a per-user rate limiter, a total cost against the lowest earlier price (report 01)
- Difficulty: the candidate called all three easy and rated the experience positive
- Practise first: Minimum Cost to Merge Values into One, Per-User Sliding-Window Rate Limiter, Total Cost Against the Lowest Earlier Price
Coverage: One software engineering intern candidate with a Bachelor's degree who applied online. The report covers the online assessment, taken on November 13, 2026, and went up on November 20, 2026. It gives no location and no result.
What came up
All three questions are short array tasks, and the candidate described an approach for each one.
| Topic | Reports | Last seen |
|---|---|---|
| Heap: merging values at minimum cost | 1 of 1 | Nov 2026 |
| Sliding window: a per-user rate limiter | 1 of 1 | Nov 2026 |
| Running minimum over an array | 1 of 1 | Nov 2026 |
Questions we found
Algorithms / Data Structures
| Question | Reports | Last seen |
|---|---|---|
| Minimum Cost to Merge Values into One (LeetCode 1167 idea) | 1 | Nov 2026 |
| Per-User Sliding-Window Rate Limiter | 1 | Nov 2026 |
| Total Cost Against the Lowest Earlier Price | 1 | Nov 2026 |
1 detailed candidate timeline, loops, and screens
01: SWE intern, online assessment
Interview date: November 13, 2026 · Report date: November 20, 2026 · Role: Software engineer intern · Degree listed: Bachelor's · Channel: Applied online · Candidate's rating: Positive experience, easy · Result: Not stated
The invite came on November 9 and the candidate took the assessment on November 13. The post's stage field says technical phone screen, but the post itself describes this online assessment. It doesn't give a time limit.
Question 1: merge values at minimum cost
- The input is an integer array. One operation picks any two values a and b, removes them and puts a + b back in. That operation costs a + b. Find the smallest total cost to bring the array down to one value. This is the same idea as LeetCode 1167. FastPrep's practice version is Minimum Cost to Merge Values into One.
- The candidate's approach: put every value in a min-heap. While more than one value is left, take out the two smallest, add their sum to the total and push the sum back. Return the total at the end.
Question 2: a rate limiter per user
- The input is two arrays, users and times, plus two numbers, k and t. Request i comes from users[i] at timestamp times[i], and the times are sorted. Each user may have at most k allowed requests in any t-second span. Return an int array where entry i is 1 if request i is allowed and 0 if it is not. FastPrep's practice version is Per-User Sliding-Window Rate Limiter.
- The candidate's approach: a map from each user to a queue of that user's timestamps. Before writing a request's result, drop the timestamps in that user's queue that have fallen out of the window.
- The report doesn't say whether a request exactly t seconds old still counts. In the practice version, a request exactly t seconds old no longer counts.
Question 3: cost against the lowest earlier price
- The input is an int array prices. Index 0 costs prices[0]. Every later index i costs prices[i] minus the smallest of the prices before it. Return the total cost from index 0 to the end. FastPrep's practice version is Total Cost Against the Lowest Earlier Price.
- The candidate's approach: one pass that keeps the smallest price seen so far and a running total.
- The report doesn't say what happens when a price drops below every earlier one and its cost turns negative. The practice version adds that cost as it is.
Common questions
How many questions are in the PayPal SWE intern OA?
This candidate got three coding questions (report 01).
How hard is the PayPal intern OA?
The candidate called all three questions easy (report 01).
Keep practicing
- Practice questions: Minimum Cost to Merge Values into One, Per-User Sliding-Window Rate Limiter and Total Cost Against the Lowest Earlier Price (report 01).
- More PayPal coding questions: the PayPal coding question bank. It needs sign-in.
- Interview overview: the PayPal interview questions page.
- Hiring insights: the PayPal hiring insights page.
- More firsthand reports: browse the Experience feed.
Sources: Anywhere useful interview info can be found.
Comments
0No comments yet — be the first to share what you know.