← Back to Directory

PayPal

Large Enterprises

Screna has 5 PayPal interview write-ups. The most reported round is the technical phone screen (3).

5 interview notes · updated Jun 2026

PayPal·Software Engineer·Technical Phone Screen

Jun 2026
PayPal coding screen, one algorithm question, pretty standard fare for a technical phone screen. The constraint was the interesting part.
  • Given a sorted array of distinct integers and a target value, return the index of the target if it exists, or the index where it should be inserted to keep the array sorted. Must run in O(log n) time.

“Binary search, so you know immediately it's binary search.”

View Post

PayPal·Software Engineer·Onsite - System Design / Architecture

Apr 2026
PayPal system design round focused on cross-border payments. One meaty question, no fluff, they clearly wanted to see if you'd thought about the regulatory and real-time data complexity that comes with international transfers.
  • Design a cross-border money transfer service similar to Remitly, accounting for country-specific transfer restrictions and real-time exchange rate lookups.

“I started with the happy path and immediately regretted it.”

View Post

PayPal·Software Engineer·Onsite - System Design / Architecture

Apr 2026
Did a system design round at PayPal for a software engineer role. The interviewer dropped hints along the way which made it feel more like a conversation than an interrogation, so the whole thing went pretty smoothly.
  • Design a fraud detection service for a payment processing system.

“The interviewer nudged me in the right direction a few times, which I'm not sure whether to feel good about or slightly embarrassed by.”

View Post

PayPal·Software Engineer·Technical Phone Screen

Mar 2026
Got a coding question from PayPal that looked simple on the surface but had enough edge cases to trip you up if you weren't careful about the nesting.
  • Given an encoded string in the format k[encoded_string] where the string inside brackets is repeated k times, write a function to decode it. Assume the input is always valid and digits only appear as repeat counts.

“Stack-based approach is the way to go here, though my first instinct was recursion which works but gets messy fast with nested brackets.”

View Post

PayPal·Software Engineer·Technical Phone Screen

Mar 2026
PayPal coding screen, one graph problem about finding connected components in an adjacency matrix. Pretty standard stuff if you've done any graph prep.
  • Given an n x n matrix representing direct connections between cities, return the total number of provinces (i.e. connected components) in the graph.

“Classic union-find or BFS/DFS question.”

View Post