PayPal interview questions

Tech / SWE · 9 questions · last reported Jan 2025
Report an interview →

Browse 9 PayPal interview questions for software engineering and software development interview preparation. Questions in this collection are tagged for full-time roles. Explore the topics and stages below and filter the collection to plan your practice.

Interview stages in this collection
Online assessment (OA), Phone screen, Onsite
Practice topics
array (6), string (4), backtracking (2), greedy (2), hash-table (2), simulation (2), sorting (2), binary-search (1)

Questions come from candidate contributions and online research. Reports reflect past experiences and do not guarantee what PayPal will ask. Locked question details require points. Public examples below are free to read.

Read 3 free PayPal interview question examples

Browse all PayPal questions

9 questions

Free PayPal interview question examples

Read the full problem statements and use the links to revisit or share a specific example.

ZigZag Conversion

Medium · Online assessment (OA) · Full-time

ZigZag conversion came up early in my PayPal phone interview. Write a string in a zigzag pattern across n rows and read it back line by line. I used an array of string builders, one per row, and bounced a direction variable when hitting the top or bottom row. The interviewer asked about the pattern of indices for each row and whether I could compute the output directly without simulating the zigzag. We worked through the math for the cycle length being 2*numRows - 2.

LRU Cache

Medium · Phone screen · Onsite · Full-time

LRU cache came up in my PayPal onsite. Classic O(1) get and put with eviction. I used a doubly linked list and hash map, moving accessed nodes to the front and evicting from the tail. The interviewer spent extra time on the put operation when the key already exists, making sure I updated the value and repositioned the node correctly. They also asked about thread safety and how I'd handle concurrent get and put calls in a production system.

Min Replacements to Sort

Hard · Online assessment (OA) · Full-time

Tricky greedy problem from my PayPal technical round. You can replace any element with two elements that sum to it, and the goal is to sort the array with minimum operations. The key insight is working backwards from the end, since the last element is fixed and you greedily split earlier elements to be as large as possible without exceeding the next element. I used the floor of the current element divided by the number of parts needed. The interviewer seemed surprised I got the approach quickly and pushed on the proof of optimality.