PayPal Coding Interview Questions
25 PayPal coding interview problems with full optimal solutions — 16 easy, 6 medium, 3 hard. Every problem ships with multiple approaches (brute-force first, then the optimal), complexity tables for each, company-specific tips on what an PayPal interviewer values, and a FAQ section.
Showing 4 problems of 25
- #17mediumfrequently asked
17. Add Two Numbers
Add two non-negative integers represented as reversed linked lists and return the sum as a linked list. PayPal favors this problem because carry propagation mirrors real-world multi-precision arithmetic in payment processing systems.
- #18mediumfrequently asked
18. Longest Substring Without Repeating Characters
Find the length of the longest substring with all unique characters. PayPal uses this classic sliding-window problem to evaluate candidates' ability to maintain a dynamic window — directly analogous to deduplication windows in real-time transaction stream processing.
- #20mediumfrequently asked
20. 3Sum
Find all unique triplets in an array that sum to zero. PayPal frequently asks this to test duplicate-skipping discipline and two-pointer mastery — skills that map to deduplication in reconciliation engines that match debits and credits across accounts.
- #22mediumfrequently asked
22. Number of Islands
Count the number of islands (connected components of '1's) in a binary grid. PayPal uses this BFS/DFS grid traversal problem to test graph connectivity reasoning — directly applicable to fraud ring detection where connected transaction nodes form suspect clusters.
Related interview-prep guides
Codility for Tech Interviews in 2026: The Complete Guide for Candidates
Codility is the dominant algorithmic-assessment platform across European tech hiring. Heavy in the UK, Germany, Netherlands, Nordics, and Poland where the company was founded. It scores candidates on both correctness and time complexity, runs 60-to-120-minute timed tests, and ships three products: Tests, CodeCheck, and CodeLive. This guide is what 2026 candidates need to know.