PayPal Coding Interview Questions

PayPal runs a coding loop that most engineers come away calling standard and fair rather than a gauntlet. The company is a large, older public payments business, and the interview has the feel of one: fundamentals-heavy, process-heavy, and capped around LeetCode-medium. If you have prepared a clean medium ladder for any strong engineering bar, you are most of the way there. The reputation is explicitly "not too hard" on raw algorithms. What sets PayPal apart is a different kind of rigor, and knowing where it lives is most of the preparation.

Here is the loop end to end. A recruiter screen opens it, then a HackerRank online assessment that blends Java and OOP, a little SQL, and a few easy-to-medium coding problems. Many teams route the live phone screen through Karat, PayPal's third-party interview vendor, which starts with a volley of rapid-fire CS-trivia questions and then moves to one coding problem that keeps layering on extensions. The virtual onsite that follows runs on Microsoft Teams and has somewhere around four to six rounds. Expect two coding rounds, a payments-flavored system design, a project deep-dive, a behavioral round, and a hiring-manager round that carries real weight. The process is famously slow, weeks on the fast end and up to a couple of months.

The PayPal angle

A PayPal loop feels like PayPal because of how it wants money modeled; there is no marquee problem. There is no signature gimmick here, no bug-squash or bespoke machine-coding round; the distinctive strand is an object-oriented round where you model a small financial system in clean classes. Think a payment with its refund and chargeback states, an account and its balances, or an amount printed as words. Then the round asks you to handle money with real precision. Interviewers want money kept in integer cents or BigDecimal, never a float. A rounding drift on a balance is exactly the correctness bug a payments company treats as disqualifying. Everything else is a standard medium spine; that one round is where the loop earns its name.

The Rounds

The exact rounds shift by team, level, and geography, so read the stages below as the shape rather than a fixed script. The specifics come from candidate reports, since PayPal publishes none, and the loop is inconsistent. Matching several internal teams can multiply the rounds. One senior candidate reported eight rounds across twelve weeks. What stays constant is where the coding signal comes from and what it rewards.

• Online assessment: HackerRank, ~60 to 90 min. Java and OOP, some basic SQL, and two to four easy-to-medium coding problems. Common for new-grad and SDE I and II pipelines, though experienced candidates sometimes skip straight to the phone screen. The prompts read competitive-style, and hidden tests are aimed at the boundaries, so it can feel trickier than its billing.
• Phone screen: Often a Karat interview. For many teams the live screen runs through Karat, PayPal's interview vendor. It opens with ten to fifteen rapid-fire CS-trivia questions on Big-O, consistency, HTTP, threading and SQL. Then comes one coding problem that starts simple and stacks two to four extensions. Talk and type continuously, because going silent is penalized directly.
• Virtual onsite: 4 to 6 rounds on Teams. Two coding rounds, one classic algorithms and one object-oriented that models money. Then a payments-flavored system design, a project deep-dive, a behavioral round, and a hiring-manager round that carries real weight and mixes design talk with a resume walk.
• Graded on: Clean code, edges, precision. A correct, readable, edge-complete solution first, then an optimization pass once it runs, since candidates report optimality is expected the moment the code works. In the money round, cents or BigDecimal over floats, and immutability where it belongs.

The PayPal angle

PayPal grades the code you would ship, and it grades how you talk while you write it. Two habits pay for themselves across every round. Cover edge cases before you are asked: the empty input, the duplicate, the overflow, the negative amount. The HackerRank hidden tests are built to catch exactly those, and interviewers weigh clean handling heavily. And narrate as you go, especially under Karat, where silence reads as a weak signal and the layered problem is really a test of whether your first solution was structured to extend. Optimal complexity still matters and you should state it, but a brute force that never gets an optimization pass, or a solution that mishandles money, is what sinks an otherwise-passing round.

The Signature Surface

Underneath the format, the pattern mix is a broad, standard medium base with two things layered on top: a Java and OOP lens, and a light fintech skin over the prompts. Be honest with yourself about what this section is not. There is no single iconic PayPal problem to grind, the way some loops have one. The personality is the object-oriented money-modeling strand and the HackerRank-plus-Karat format, not a fixed puzzle. The families below are the recurring shapes, and the two the loop leans on hardest carry the personality: the arrays-and-hashing base, and the OO design round that is the real differentiator.

Where the Weight Sits

The chart splits the recurring coding problems across the families PayPal draws from. PayPal publishes none of this, so the ordering leans on candidate reports and company-tagged problem sets rather than an official roster. Read it as where your first hours go. The tilt toward the first two bars is what matters: the arrays-and-hashing workhorse that carries the screen and the OA, and the OO design round that is the PayPal-shaped thing in the loop.

The PayPal angle

Prep compounds fastest on the two leading families, because they carry both the screen and the differentiator. Arrays and hashing is the substrate under most of the OA: frequency-counting, grouping transactions by item, anagrams, the two-sum family, prefix-sum spans. Clear that and you have the phone screen and the first onsite coding round in hand; the OO design round is where the payments skin gets real. You model a transaction with its refund and chargeback states, or an account with correct precision; a generic algorithm grind tends to skip this family. Linked lists deserve a specific mention because PayPal over-indexes on them versus its peers, reversing, cycle detection, and the O(1) structures that shade into the design round. The rest, trees and graphs, binary search, intervals, and a thin band of DP, is breadth you should be able to clear rather than a PayPal specialty.

The Difficulty, Honestly

The median PayPal problem is a medium, and about two-thirds of the problems candidates report sit right there, with a light band of easy warm-ups and a thin tail of hard. Vendor and candidate consensus puts the bar around a six and a half out of ten, below Google and Meta on pure algorithms. The extra rigor does not come from exotic data structures, it comes from OO modeling and money-correctness discipline; one caveat: the HackerRank OA can feel harder than its easy-to-medium billing. The prompts skew competitive-style and the hidden tests target boundaries, so candidates routinely clear only a fraction of the cases. Java dominates the core platform and modern idiom is rewarded. Python covers backend and ML work, and JavaScript, TypeScript, or Go show up on newer services; you generally pick your own language for the algorithm rounds, while the OO round leans Java. PayPal publishes none of this; the ordering above reflects how often each shape comes up in candidate reports.

Five lessons follow. They open with the two families that carry the loop, the arrays-and-hashing spine and the OO money-modeling round. Then they work the standard remainder: linked lists, trees and graphs with search, and a bundled strings-math-and-intervals tail. Each one opens with how PayPal frames the family, then works the recurring problems in the payments domain, with the clean-code and money-precision accent the interviewer layers on top. Where a lesson rests on a base algorithm, the full build lives in the free Foundations course, so these pages stay on what is specifically PayPal.

Common questions

What coding questions does PayPal ask?

PayPal leans on a standard easy-to-medium spine with a payments accent. Arrays, strings, and hashing carry the online assessment and the first coding round, with frequency counts, grouping transactions by item, and the two-sum and prefix-sum families. Its signature is an object-oriented round that models a transaction with its refund and chargeback states, an account and its balances, or a Premium question, with money held as integer cents or a BigDecimal. Linked lists show up more than at a typical FAANG loop, and trees, graphs, binary search, and a thin band of intervals and dynamic programming fill out the breadth.

What is on the PayPal HackerRank online assessment?

The PayPal online assessment runs on HackerRank and lasts roughly sixty to ninety minutes. It blends Java and OOP, some basic SQL, and two to four easy-to-medium coding problems. It is common for new-grad and SDE I and II pipelines, though experienced candidates sometimes skip straight to the phone screen. The catch is that the prompts read competitive-style and the hidden tests aim at the boundaries. The OA can feel trickier than its easy-to-medium billing, and candidates routinely clear only a fraction of the cases. Prepare edge cases first: the empty input, the duplicate, the overflow, the negative amount.

What is the PayPal Karat interview?

Karat is the third-party vendor that runs many of PayPal's technical phone screens. A Karat round opens with ten to fifteen rapid-fire computer-science questions on Big-O, HTTP, threading, consistency, and SQL, then moves to one coding problem that starts simple and keeps stacking two to four extensions. The layered problem is really a test of whether your first solution was structured to extend, so narrate continuously, because going silent is penalized directly.

Does PayPal use LeetCode or HackerRank?

Both, in different stages. The online assessment runs on HackerRank, with prompts that read competitive-style and hidden tests aimed at the boundaries. The live rounds are LeetCode-style and capped around medium, and you generally pick your own language, though the object-oriented money-modeling round leans Java.

Is the PayPal coding interview hard?

The median problem is a medium, and the consensus bar sits around six and a half out of ten, below Google and Meta on pure algorithms. The rigor comes from money-correctness and clean object-oriented modeling rather than exotic data structures. The one thing candidates underestimate is the HackerRank assessment, which can feel harder than its billing because the hidden tests target edge cases.