PayPal Coding Interview Questions

Showing 11 problems of 25

• #4easysometimes asked

  4. Remove Duplicates from Sorted Array

  Remove duplicates from a sorted array in-place and return the new length. PayPal asks this to test the two-pointer reflex — the same technique they apply when deduplicating idempotency keys in a sorted append-only ledger.

  Solve →
• #5easysometimes asked

  5. Remove Element

  Remove all occurrences of a value from an array in-place and return the new length. PayPal uses this to test the same two-pointer reflex they need when filtering reversed transactions out of a daily settlement batch.

  Solve →
• #6easysometimes asked

  6. Search Insert Position

  Given a sorted array and a target, return the index where target is found, or where it would be inserted to keep the array sorted. PayPal asks this to test whether you can write a bug-free binary search — the foundation for fast lookups in their sorted fraud-rule index.

  Solve →
• #7easysometimes asked

  7. Plus One

  Given a non-empty array of digits representing a large integer, increment it by one. PayPal asks this to test arbitrary-precision arithmetic awareness — currency amounts at scale exceed 64-bit, and you cannot lose a cent to overflow.

  Solve →
• #8easysometimes asked

  8. Merge Sorted Array

  Merge two sorted arrays in-place into the first one (which has buffer space at the end). PayPal asks this to test reverse-pointer thinking — the same approach they use when interleaving an authorized-transactions buffer with a capture-events buffer for end-of-day reconciliation.

  Solve →
• #9easysometimes asked

  9. Binary Tree Inorder Traversal

  Return the inorder (left, root, right) traversal of a binary tree's nodes. PayPal asks this to test stack-based iterative thinking — the same scaffolding used to walk a transaction-tree where parent transactions point at children (settlement → captures → auths).

  Solve →
• #10easysometimes asked

  10. Same Tree

  Given two binary trees, decide if they are structurally identical and the nodes have the same values. PayPal asks this as a recursion warm-up — the same shape used when diffing two snapshots of a transaction-state tree to detect tampering or replay.

  Solve →
• #11easysometimes asked

  11. Symmetric Tree

  Decide whether a binary tree is a mirror of itself. PayPal uses this as a recursion check — testing whether you can write a helper that compares two trees with mirrored axes, the same pattern they use for symmetric-link reconciliation between buyer-side and seller-side transaction graphs.

  Solve →
• #13easysometimes asked

  13. Path Sum

  Determine whether a binary tree has a root-to-leaf path whose node values sum to a given target. PayPal uses this to test recursive tree traversal and base-case handling under financial-rule evaluation scenarios.

  Solve →
• #14easysometimes asked

  14. Pascal's Triangle

  Generate the first numRows rows of Pascal's triangle where each element is the sum of the two elements above it. PayPal asks this to evaluate 2D array construction skills and pattern recognition relevant to combinatorial financial modeling.

  Solve →
• #16easysometimes asked

  16. Single Number

  Find the one element in an array that appears exactly once while all others appear exactly twice. PayPal uses this to probe XOR bit-manipulation knowledge and constant-space thinking — skills tied to low-level transaction-ID deduplication logic.

  Solve →