PayPal Careers

A global digital payments platform connecting consumers and merchants across commerce.

paypal.com

About the company

Legal name

PayPal Holdings, Inc.

Founded

1998

Headquarters

San Jose, California, United States

Listed on

NASDAQ: PYPL

Revenue (FY2025)

$33.172 billion

Net income (FY2025)

$5.233 billion

Active accounts

439 million

Total payment volume

$1.79 trillion

Payment transactions

25.4 billion

Employees (FY2025)

Approximately 23,800

PayPal traces its digital payments work to Confinity in 1998. It became an independent public company again in 2015 and trades on Nasdaq under PYPL.

The company operates a two-sided payments network connecting consumers and merchants. At December 31, 2025, it reported 439 million active accounts across approximately 200 markets.

PayPal processed $1.79 trillion in total payment volume and 25.4 billion payment transactions in 2025. Its India technology and operations centers in Chennai and Bengaluru work across product, technology, analytics, operations, customer service and risk.

Key People

Enrique Lores

President and Chief Executive Officer

Jamie Miller

Chief Financial and Operating Officer

Frank Keller

President, Checkout Solutions and PayPal

Antonio Lucio

Chief Marketing and Corporate Affairs Officer

Photos

Interview process at PayPal

(263 candidate-shared Indeed interviews)

Interview experience

Favorable

Interview difficulty

Medium

Interview process length

About two weeks

Overall experience

PoorExcellent

EasyDifficult

How long it takes

About a day or two23%

About a week44%

About a month20%

More than one month12%

Prep for your PayPal interview with AI

Practise coding, systems, product and risk scenarios with clear tradeoffs.

PayPal Interview Questions & Answers

Q: Solve a disjoint set union problem.

A: Define the sets and operations first, then implement path compression and union by rank or size before testing repeated unions.

Answer by AI

State the near-constant amortized complexity.
Test already-connected nodes.
Explain the parent-array invariant.

Q: If you had to scale your personal project, how would you do it?

A: Start with measured bottlenecks and target load, then cover stateless services, data partitioning, caching, queues, resilience and observability.

Answer by AI

State traffic and latency assumptions.
Prioritize the first bottleneck.
Discuss failure recovery.

Q: Solve a heap or priority queue problem involving stones.

A: Clarify the transformation rule, keep the next required stone in a heap and prove why each extraction makes the locally correct choice.

Answer by AI

Choose min-heap or max-heap deliberately.
State O(n log n) style bounds.
Test one and two element inputs.

Q: Flatten a multidimensional array.

A: Clarify nesting depth and output order, then use recursion or an explicit stack while preserving element order.

Answer by AI

Handle empty nested arrays.
Discuss recursion depth.
State time and space complexity.