PayPal SDE II OA 真题 + 面试准备分享｜高频题型 + 解题思路还原

PayPal SDE II OA 真题 + 面试准备分享｜高频题型 + 解题思路还原

很多同学觉得 Fintech 的面试难度不输大厂，PayPal就是其中之一。最近我们 Programhelp 收到了多位准备 PayPal OA 的同学咨询，包括已经收到在线笔试邀请、准备走内推通道的、以及多次刷题仍然感觉没有”考试感”的同学。结合这些真实学员的练习反馈和我们过往积累的 PayPal 高频题库，这篇就来帮大家全面拆解 PayPal OA 的出题风格、常见难点和解题思路。如果你正在准备PayPal的面试，那么接着往下看吧~

PayPal SDE II OA 基本信息

PayPal 的 SDE II 岗位通常面向有 2～5 年开发经验的工程师，因此 OA部分的难度、题型设计和考察维度相比校招会更高一些。以下是近期整理的 OA 流程要点和形式：

1. 考试平台

Codility：PayPal 大多数 SDE II 岗位采用 Codility 平台，部分岗位（尤其是与数据平台/风控平台相关）也有使用 HackerRank 的情况。

考试环境：开启摄像头 + 屏幕监控，不允许切屏或打开其他程序，系统自动记录鼠标/键盘/切屏行为。

2. 题目结构

题量：3 道编程题

时间限制：90 分钟完成所有题目

题目难度分布：

一道 Easy-Medium 题，用于热身或测试基本功（如字符串处理、数组扫描）；

一道 Medium 题，常见为 Hash / Stack / Queue 的应用；

一道 Medium-Hard 或 Hard 级别题，涉及图、并查集、最短路径、动态规划等高频面试主题。

加分项：写出完整注释、提供多个测试样例、优化时间复杂度等行为，有时能作为筛选依据。

3. 评分标准

PayPal 的 OA 不只是刷题刷过就行，判分真的挺细的～像是有没有过所有测试用例、时间复杂度有没有写好、边界情况有没有考虑到（比如空输入、重复数字这种），这些都是基础要求 。另外代码风格也会看，变量名清不清楚、函数写得整不整洁，都可能影响整体印象。比较隐蔽的一点是——系统其实会记录你提交的次数和频率，如果你来回改太多次，也可能被认为思路不清晰 or 稳定性差。所以想拿高分，题要刷透，更要写得”像个工程师”才行！

4. 常见考点

滑动窗口、堆栈/队列处理

哈希表+双重遍历

并查集、图搜索（DFS/BFS）

最小生成树、拓扑排序

简化版系统模拟题（如 Task Scheduler、Job Queue）

核心算法优化（如 O(n^2) 到 O(nlogn) 的重构）

PayPal OA 真题还原 + 解题思路

题目 1：Vowels

Given a string array that contains n elements, each composed of lowercase English letters, and q queries, each query of the format l - r. For each query, determine how many strings starting from index l and ending at index r have vowels as the first and last character. Vowels are in {a, e, i, o, u}.

Example:
strArr = ["aba", "bcb", "ece", "aa", "e"]
queries = ["1 - 3", "2 - 5", "2 - 2"]

These strings represent two dash – delimited integers l and r, the start and end indices of the interval, inclusive. Using 1 – based indexing in the string array:

  • The interval 1 - 3 contains two strings that start and end with a vowel: aba and ece.
  • The interval 2 - 5 also has three.
  • The third interval, from 2 - 2, the only element in the interval, bcb, does not begin and end with a vowel.

The return array for the queries is [2, 3, 0].

Function Description
Complete the hasVowels function in the editor below. It must return an array of integers that represent the result of each query in the order.

#include 
using namespace std;

/*
 * Complete the 'hasVowels' function below.
 *
 * The function is expected to return an INTEGER_ARRAY.
 * The function accepts following parameters:
 * 1. STRING_ARRAY strArr
 * 2. STRING_ARRAY query
 */

vector hasVowels(vector strArr, vector query) {

}

int main() {

}

题目 2：First Unique Character

A unique character is one that appears only once in a string. Given a string consisting of lowercase English letters only, return the index of the firstoccurrence of a unique character in the string using 1 – based indexing. If the string does not contain any unique character, return -1.

Example:
s = "statistics"

The unique characters are [a, c] among which a occurs first. Using 1 – based indexing, it is at index 3.

Function Description
Complete the function getUniqueCharacter in the editor below.

#include 
using namespace std;

/*
 * Complete the 'getUniqueCharacter' function below.
 *
 * The function is expected to return an INTEGER.
 * The function accepts STRING s as parameter.
 */

int getUniqueCharacter(string s) {

}

int main() {

}

题目 3：Load on systems

There are 7 computers in a network numbered from 0 to 6. Each network request is assigned to one of those computers. Hash function used for that is h(id) = id % 7. Which computer will have maximum load if the request ids are: 17, 27, 16, 5, 11, 13, 9, 23, 25

Pick ONE option:

  • 6
  • 0 and 1
  • 2
  • 4 and 5

题目 4：Find the value

What will be the value of x after the execution of the following code:

int x = 1;
for (int i = 1; i <= 128; i += i) {
    x += x;
}

Pick ONE option:

  • 64
  • 48
  • 256
  • 128

题目 5：Time Complexity of Searching a Linked List

What is the time complexity to find an element in a linked list of length n?

Pick ONE option:

  • O(log₂n)
  • O(n)
  • O(1)
  • O(n²)

题目 6：Aggregate Marks

There is a database containing the marks of some students in various subjects. The data may contain any number of subjects for a student.

Retrieve the records of students who have a sum of marks greater than or equal to 500. The result should be in the following format: STUDENT_ID, SUM_OF_MARKS sorted descending by STUDENT_ID.

Schema
(Sample Data Table not fully shown, but SQL query framework is given)

-- Enter your query below. Please append a semicolon ';' at the end of the query
SELECT STUDENT_ID, SUM(MARKS) AS SUM_OF_MARKS
FROM marks
GROUP BY STUDENT_ID
HAVING SUM(MARKS) >= 500
ORDER BY STUDENT_ID DESC;

题目 7：SQL Join

The Venn diagram below illustrates a JOIN operation on table A and B. The shaded area is the records returned by the operation.

Which type of JOIN will produce such result?

Pick ONE option:

  • INNER JOIN
  • LEFT JOIN

刷题推荐

类型 推荐题目
Sliding Window Leetcode 239、643、1004
Hash / Set 128 Longest Consecutive Sequence、149 Max Points
Graph / Union-Find 684、990、1319
Heap / Greedy 295 Find Median from Data Stream、857 Min Cost
系统模拟题 621 Task Scheduler、218 Skyline Problem

Programhelp｜PayPal 上岸助攻服务

PayPal 的 OA 确实不简单，很多同学刷了题还是觉得没把握。我们 Programhelp 专注技术岗考试辅导，团队已帮助大量候选人顺利通关 PayPal、Stripe、Amazon、Meta 等大厂线上笔试和面试环节。

我们能帮你解决什么？

高频真题总结 + 题型思路精讲，针对 PayPal 风格专项练习

模拟考试训练，提升时间分配 + 答题节奏

OA 远程无痕联机代写，确保安全

VO过程中提供语音辅助、专业代面

我们服务过不少”时间紧+不会刷题”的候选人，依然成功上岸。
如果你也正在冲刺 PayPal OA 或想拿下大厂 offer，欢迎来聊聊，我们会根据你的实际情况给出定制化建议和助攻方案。

author avatar
azn7u2@gmail.com
See Full Bio
END
Posted to: OA
近兩天內
 0
Comment（尚無留言）