PayPal's technical loop almost always opens with a timed online assessment on HackerRank or HackerEarth that mixes DSA coding with MCQs on OS, DBMS, SQL and the candidate's stack, then moves into one to three live problem-solving interviews where the interviewer expects the optimal approach explained aloud before any code is written. Experienced candidates additionally get low-level design and system design rounds plus a techno-managerial round that can still be technical, and the loop closes with an HR or hiring-manager conversation on projects, motivation and compensation. Data and analytics candidates follow the same shape but with statistics, probability, machine learning and live SQL replacing most of the DSA.
These 16 writeups cover software engineering, frontend engineering, data & science and other roles, India-heavy (campus + lateral). 13 of them were posted under a pseudonym (Reddit, GeeksforGeeks or forum handles), so we could not verify the authors’ identities.
Typical rounds
31-6 range
Outcomes shared
6/5offer / not
Most common round
Technical
Sources span
2020 - 2024
Most frequently reported · Data structures & algorithms(14), Arrays & strings(10), Past projects(10), SQL(9), DBMS(7)
PayPal’s official process
PayPal's own recruiting page describes a light two-stage shape: a recruiter phone conversation about the role and the candidate's background, then interviews with members of the hiring team. Interviews are run virtually on Microsoft Teams with camera on. Candidates are told to answer competency questions with specific, detailed examples drawn from different jobs, and are pointed at the company's leadership principles as the thing to prepare against. A companion careers-blog post adds advice on using the STAR structure, preparing a short self-introduction, testing the virtual setup, and coming with questions about the team and success measures. No round-by-round technical breakdown is published.
A 75-minute HackerEarth test with two array problems, one of them a variation on a well-known nearest-elements question. Cleared on to the interviews.
Covered · Data structures & algorithms, Arrays & strings
2
Problem solvingTechnical
One hour face to face on pair-sum in an array with duplicate-handling follow-ups, then first-non-repeating-character with successive constraints on case sensitivity and constant space.
Covered · Arrays & strings, Hashing
3
Problem solvingTechnical
Linked-list palindrome check under strict time and space limits, plus binary-tree diameter and BST validation. Rejected after this round.
HackerEarth test with three graded DSA problems across easy, medium and hard. Two fully solved and one partially, which was enough for a recruiter callback within a few days.
Covered · Data structures & algorithms
2
DSA and problem solvingTechnical
Lowest common ancestor and a knapsack-style DP problem, followed by Java internals questions on concurrent collections, generics, thread-local state and futures.
Design a configurable key-value cache with a pluggable eviction policy following SOLID principles and design patterns, then reason verbally about making it thread safe. Closed with a linked-list dedup problem.
Covered · Low-level design, OOP, Concurrency
4
System designSystem design
Resume discussion, then design a messaging application with heavy probing on trade-offs, choice of real-time transport protocol and how end-to-end encryption would be layered in.
Covered · System design, Scalability, Networking, Past projects
5
Techno-managerialHiring manager
Still technical in practice: a graph deep-copy problem and a design question about storing secrets at scale, mixed with project and culture-fit discussion.
Covered · Graphs, System design, Past projects, Behavioral
6
HRBehavioral
Culture-fit conversation plus the compensation and stock discussion. Ended in an offer.
HackerEarth test with three easy-to-medium problems where input parsing had to be written by hand, which ate a lot of the clock.
Covered · Data structures & algorithms, Dynamic programming
2
TechnicalTechnical
A puzzle-flavoured question about generating a uniform random value without library helpers, plus a subarray-balance problem.
Covered · Data structures & algorithms, Arrays & strings
3
Technical and designLow-level design
Postfix expression evaluation with a stack, then a discussion of microservice trade-offs and a low-level design of an e-commerce marketplace. Ended in an offer.
Covered · Data structures & algorithms, Low-level design, System design
A 75-minute HackerEarth round with a heavily weighted hard problem and a second problem cleared with brute force.
Covered · Data structures & algorithms, Dynamic programming
2
TechnicalTechnical
Started from a hashmap solution to a first-and-last-occurrence problem, then was pushed toward the binary-search version, followed by an itinerary reconstruction question. Rejection mail arrived immediately after.
Two weighted problems on HackerRank, one easy and one hard, with only partial test cases passing. The recruiter still moved the candidate forward after a follow-up.
Covered · Data structures & algorithms, Dynamic programming
2
DS and algorithmsTechnical
A logarithmic-complexity problem and a tree question, written without an IDE.
Covered · Data structures & algorithms, Trees
3
Core Java and servicesTechnical
In-depth core Java including streams-style code, Spring and Spring Boot, microservices, OOP with real examples, and SQL subqueries and query optimisation.
Covered · OOP, Concurrency, SQL, API design
4
Design discussionSystem design
System and database design, in this case an object-oriented model of a file and folder hierarchy. Merged into the previous slot on the day.
Covered · System design, Low-level design, DBMS
5
Hiring managerHiring manager
Expected to be behavioural but turned out to be another coding round on backtracking and set-based problems. Selected.
Prior-role deep dive, a medium string-reversal problem solved in JavaScript, then rapid-fire frontend fundamentals covering throttling and debouncing implementations, promises and async control flow, higher-order functions, the virtual DOM and reconciliation, polyfills, and rendering with React hooks.
Covered · Arrays & strings, JavaScript fundamentals, Past projects
2
TechnicalTechnical
Shorter and easier: deep versus shallow copy trade-offs with live implementation in a shared editor, then writing an array flatten function both recursively and iteratively with a depth-limited follow-up.
Covered · JavaScript fundamentals, Data structures & algorithms
3
Techno-managerialHiring manager
Framework choice rationale, current web trends, CSS preprocessors versus CSS-in-JS, bundler trade-offs, and a discussion of the team's design system.
An hour-long video interview mixing a heap-based k-largest-elements problem with JavaScript questions. The interviewer volunteered hints throughout.
Covered · Data structures & algorithms, JavaScript fundamentals
2
Techno-managerialHiring manager
A pattern-printing exercise in JavaScript followed by breadth questions on REST methods, JavaScript data types and closures, Node packaging files, ACID properties and SQL versus NoSQL, alongside a read on personality and problem-solving style.
HackerRank test of six MCQs plus two medium-to-hard coding questions, followed by an invitation to interviews.
Covered · Data structures & algorithms
2
TechnicalTechnical
Search in a rotated sorted array with a required logarithmic bound, explained and dry-run before coding, then the single-non-duplicate problem worked from brute force through hashing to the bitwise solution.
Covered · Arrays & strings, Data structures & algorithms
3
HRBehavioral
Despite the label this was half technical: project and tech-stack deep dive, GitHub contributions, live SQL join queries, the OOP pillars with real-world examples, and motivation for PayPal. Rejection came about a month later despite positive in-room feedback.
Covered · Past projects, SQL, DBMS, OOP, Behavioral
Ninety minutes on HackerRank with eleven items: two straightforward coding problems plus MCQs spanning C, JavaScript and SQL.
Covered · Data structures & algorithms, SQL
2
TechnicalTechnical
An array problem, then implementation details of heaps and the complexity of everything discussed.
Covered · Arrays & strings, Data structures & algorithms
3
BehavioralBehavioral
Self-introduction and project walkthrough, database types, cloud and platform questions, an open prompt to invent a new feature for a consumer app, and why PayPal plus a self-rating. Rejected after this round.
Covered · Past projects, DBMS, Behavioral, Product sense
Forty-five minutes: a long project and backend-API discussion driven by the resume, then three coding questions on pair sums, counting characters in a large text stream, and traversing an organisational hierarchy. Did not clear.
Covered · Past projects, API design, Arrays & strings, Data structures & algorithms
Sixty minutes on video with coding in a shared document. A partition-style optimisation problem guided toward a binary-search answer, then a number-theory counting question discussed at approach level only.
Covered · Data structures & algorithms, Binary search
2
Projects and problem solvingTechnical
Individual contribution on each project and justification of database choices, then a map-based counting problem with corner cases and a linked-list reversal in groups.
Covered · Past projects, DBMS, Data structures & algorithms
3
Techno-managerialHiring manager
A senior manager probed projects and internships, team preference, strengths and weaknesses, and pressed on why a research-leaning candidate wanted an industry role. Described as a stern round.
Campus shortlisting gated mainly on GPA before any test was issued.
Covered · Resume deep-dive
2
Online assessmentOnline assessment
Ninety minutes with one medium graph-and-cost problem plus ten to fifteen MCQs on JavaScript and web development.
Covered · Graphs, Data structures & algorithms
3
TechnicalTechnical
Forty-five minutes covering a DP-or-greedy question with follow-ups on why each approach, pointer and data-structure internals, polymorphism, live SQL queries, and one easy-medium string problem coded after explaining the approach.
A one-hour evening test blending operating-systems concepts such as page replacement and semaphores, DBMS and SQL query writing, and a moderate array problem of the trapping-rain-water type.
One hour on HackerRank: ten MCQs on machine learning, SQL, probability and statistics, plus a Python coding question built around object-oriented design.
Covered · SQL, Statistics, Machine learning, OOP
2
TechnicalTechnical
Resume and project questions, then probability, statistics, machine learning and Python concepts, a live SQL query in a shared IDE with follow-ups, and one easy data-structures problem to code.
Covered · Past projects, Statistics, Machine learning, SQL, Data structures & algorithms
3
Hiring managerHiring manager
Same subject areas at greater depth with medium-to-hard SQL written live. A case study was planned but dropped for time. Selected.
Covered · Statistics, SQL, Machine learning, Case study
Eleven questions in total: one easy formula-driven coding problem and ten items spanning descriptive statistics, regression, distributions, correlation, a SQL query, error types, regularisation, hypothesis testing and cross-validation.
A one-hour HackerRank test of roughly forty mostly aptitude questions with the occasional coding item. Shortlisting combined test score with CGPA and cut a cohort of several hundred down to a few dozen.
Covered · Aptitude, Data structures & algorithms
2
Aptitude interviewTechnical
A short fifteen-minute conversation on work-and-time, probability and profit-and-loss style reasoning, plus a question on the candidate's favourite subject.
Covered · Aptitude, Puzzles
3
TechnicalTechnical
An hour dominated by a deep dive into one analytics project, then logical reasoning questions, SQL queries, and for some panels a scenario prompt asking which KPIs you would define for a given real-world domain.
Covered · Past projects, SQL, Puzzles, Domain knowledge
PayPal's technical loop almost always opens with a timed online assessment on HackerRank or HackerEarth that mixes DSA coding with MCQs on OS, DBMS, SQL and the candidate's stack, then moves into one to three live problem-solving interviews where the interviewer expects the optimal approach explained aloud before any code is written. Experienced candidates additionally get low-level design and system design rounds plus a techno-managerial round that can still be technical, and the loop closes with an HR or hiring-manager conversation on projects, motivation and compensation. Data and analytics candidates follow the same shape but with statistics, probability, machine learning and live SQL replacing most of the DSA.
What topics does PayPal test in interviews?
Commonly reported topics include Data structures & algorithms, Dynamic programming, Trees, Graphs, Arrays & strings, System design.
These guides summarize public, first-hand interview experiences shared by candidates. They describe the shape of each loop and the topics that came up, not a leaked question bank, and every experience links back to its original source. Processes change often; treat this as directional prep, not a script.