PayPal Interview Questions: DSA, Coding, and HR Prep

PayPal’s campus technical interviews are question-dense and depth-first: they care less about whether you have memorised every algorithm and more about whether you can trace through a problem under pressure.

The screening happens on HackerRank, the same platform used by many product-focused tech companies. Clear that, and you get two face-to-face technical rounds followed by an HR interview. This guide covers the question types you will face in those rounds, the approach patterns that work, and how to prepare for them in the time you have.

For the full round-by-round process structure, eligibility criteria, and application timeline, see the PayPal interview process guide (coming in a later article). This article focuses on the QUESTIONS lane: what gets asked, how to approach it, and how to build answers interviewers find compelling.

What PayPal’s Technical Interview Actually Tests

The HackerRank screening weeds out candidates who cannot write correct code under time pressure. It is not a trick test. The questions are implementation-first: write a working solution, handle edge cases, get the output right.

Once you are in the room, the question style shifts. PayPal technical interviewers ask you to articulate your reasoning at every step. They are not just checking if you arrive at a correct answer; they want to see how you explore the problem space, catch your own mistakes, and adjust your approach.

Two things stand out from interview accounts. First, time and space complexity analysis is non-negotiable. If you produce a working solution without discussing its Big-O profile, interviewers will ask. Know yours before they prompt. Second, system design questions appear even for freshers, but at a manageable scale: design a scoreboard, design a Sudoku game, sketch a client-server architecture. These are not full distributed systems questions; they are design sense checks.

Data Structures and Algorithms Questions

DSA is the core of both technical rounds. The questions below appear consistently across interview accounts:

Dynamic Programming

• Q: Find the longest palindromic subsequence in a string.

  • Approach: Build a 2D DP table where dp[i][j] = length of LPS in substring s[i..j]. Base case: single characters have LPS length 1. Recurrence: if s[i] == s[j], then dp[i][j] = dp[i+1][j-1] + 2; else dp[i][j] = max(dp[i+1][j], dp[i][j-1]).
  • Complexity: O(n²) time, O(n²) space.

• Q: Coin change — minimum coins to make a given amount.

  • Approach: Standard unbounded knapsack DP. dp[i] = minimum coins to make amount i. For each coin denomination, update dp[amount].
  • Complexity: O(amount × number of coins) time.

• Q: Word Break Problem — can string s be segmented into dictionary words?

  • Approach: dp[i] = true if s[0..i-1] can be segmented. For each position, check all substrings ending there against the dictionary.
  • Complexity: O(n²) time with a hash-set dictionary.

Tree and Graph Problems

• Q: Find the Lowest Common Ancestor (LCA) of two nodes in a binary tree.

  • Approach: Recursive traversal. If the current node is null, or equals either target, return the current node. Recurse left and right. If both return non-null, current node is the LCA. If only one returns non-null, that is the LCA.

• Q: Zigzag level-order traversal of a binary tree.

  • Approach: BFS with a deque. Alternate between left-to-right and right-to-left ordering per level using a direction flag.

• Q: Concatenation of a string in zigzag form across n rows.

  • Approach: Simulate the zigzag path, distributing characters to row strings. Time: O(length of string).

String and Array Problems

• Q: Recursive generation of all permutations of a string.

  • Approach: Fix one character at position i, recurse on the rest. Backtrack by swapping back. Total permutations for a string of length n = n factorial (written as n! to avoid ambiguity).

• Q: Perfect Sum Problem — count subsets with a given sum.

  • Approach: DP subset-count variant. dp[i][j] = number of subsets of first i elements with sum j.

• Q: Sudoku Solver.

  • Approach: Backtracking. For each empty cell, try digits 1 to 9. Check row, column, and 3x3 box constraints. If valid, place the digit and recurse. Undo placement if the recursion fails.

For a broader set of question types across companies, the 20 most-asked data structures interview questions covers the foundational patterns that appear across tech company screens.

System Design and OOP Questions

PayPal’s system design questions for freshers are constrained-scope. They are not asking you to design a globally distributed payment system. They are checking design sense: can you separate concerns, name the components correctly, and explain the data flow?

Common System Design Prompts

• Design a system to track top scores in a game.

  • Components to identify: a score submission API, a storage layer (database or in-memory sorted structure), and a retrieval layer (leaderboard query). A max-heap or sorted set keeps the top-K efficient.

• Design a Sudoku game application.

  • Components: a board state representation (9x9 array), a validation engine (row/column/box checks), a UI layer, and an optional solver module using backtracking.

• Sketch a client-server architecture for a scoreboard.

  • Cover: client sends score events via REST or WebSocket, server validates and stores, a read replica or cache layer serves leaderboard reads.

OOP and Core CS Questions

• Explain virtual functions and how vtable works in C++.

  • Virtual functions enable runtime polymorphism. The compiler creates a vtable per class containing function pointers. Each object holds a vpointer to its class’s vtable. Method calls go through the vtable, so the derived class’s version runs even via a base-class pointer.

• What is the difference between a linked list and an array?

  • Arrays: fixed size (in most languages), O(1) random access, O(n) insertion/deletion in the middle. Linked lists: dynamic size, O(1) insertion/deletion at head, O(n) random access.

• Implement a max-heap or explain its properties.

  • A max-heap is a complete binary tree where each node is greater than or equal to its children. Insert: add at end, sift up. Extract-max: swap root with last, remove last, sift down. Both operations are O(log n).

HR and Behavioral Round Questions

The HR round at PayPal is a structured conversation, not a formality. Interviewers assess two things: whether you can communicate clearly under slight pressure, and whether your stated motivation for PayPal is specific enough to be credible.

Common questions and what they are actually testing:

• “Why do you want to work at PayPal?” Research PayPal’s technology profile before walking in. PayPal’s careers page gives a sense of the engineering domains they hire into. Specificity matters: reference their payments infrastructure, developer APIs, or risk-and-fraud technology rather than giving a generic fintech answer.

• “Tell me about a challenging situation you faced and how you handled it.” Use a structured STAR response (Situation, Task, Action, Result). The situation should be real; invented scenarios fall apart under follow-up questions.

• “Describe a time when you had to work in a team.” Prepare two examples: one where the team succeeded despite a conflict, and one where you took initiative. Have specifics ready: what the disagreement was, how it resolved, what you learned.

• “Where do you see yourself in 5 years?” Align with your genuine direction. PayPal operates at the intersection of software engineering and financial systems. If that intersection interests you, say so. If your goal is product engineering, backend scale, or machine learning on transaction data, connect that to PayPal’s business.

• “What makes you different from other candidates?” This is an invitation to present your strongest technical or project differentiator. Keep it concrete: a deployed project, a competition result, a particular domain depth.

How to Prepare: A 4-Week Question-Focused Plan

Four weeks is enough to get confident with the question types above, provided the weeks are structured.

• Week 1: DSA foundations. Cover arrays, strings, linked lists, and trees. Do 2 LeetCode medium problems per day. Focus on getting to a working solution first, then optimise. Write out the Big-O of every solution you submit.

• Week 2: Dynamic programming. This is the heaviest category in PayPal interviews. Cover the standard DP patterns: longest common subsequence, 0-1 knapsack, coin change, string segmentation. Do 10 problems, not 30. Depth over breadth.

• Week 3: System design and OOP. Read the classic primer on system design components (databases, caches, queues, load balancers). Practice explaining two or three small designs out loud: a scoreboard, a URL shortener, a rate limiter. Do one OOP implementation exercise per day.

• Week 4: Full mock interviews. Do timed 45-minute sessions on HackerRank or with a peer. Simulate the interview environment: speak your thinking aloud. Review every solution you struggled with, not just the ones you got wrong. Companies like Directi that run comparable technical screens use similar question patterns and interview formats, so cross-referencing is useful.

The consistent bottleneck in PayPal prep is not knowing the algorithms. It is translating that knowledge into clear spoken explanations under time pressure. Practice talking through your solutions from day one, not just writing them.

If your preparation has focused on aptitude and DSA and you want to add a real deployed AI project before your placement window, TinkerLLM gives you a sandbox to build and ship one LLM-powered application in a weekend, at ₹299. Two deployed projects on GitHub carry more weight in a PayPal technical interview than another LeetCode streak.