WeRide 作為自動駕駛領域的領先企業，技術要求高，OA 難度不小。 面試題多涉及演算法、數據結構，還有工程實現細節。 對於很多候選人來說，OA 是通往後續面試的第一道關卡，準備充分和臨場發揮都很關鍵。 得益於 Programhelp 遠端語音助攻，我才能在緊張的時間里高效理清思路、快速寫碼，順利通過 OA。
面試概覽
WeRide OA 通常包括：
- 兩道程式設計題，偏向演算法和數據結構，難度中上，時長約 90 分鐘。
- 一道設計或工程題，考察系統設計能力或編碼細節實現。
- 部分選擇題，涉及基礎知識和程式設計常識。
整體時間緊張，題目偏難，要求寫出高效、正確的代碼。
WeRide Online Assessment 真题
1. Find the Closest Pair of Points
Given a list of points (x, y) on a 2D plane, find the pair of points with the smallest Euclidean distance between them. Return the distance.
Input:points = [[1,2], [3,4], [6,8], [2,3]]
Output:1.414 (distance between points [1,2] and [2,3])
2. Detect Lane Line from Sensor Data
You are given an array representing sensor data capturing the lane line positions on a straight road segment. The data contains some noise. Write afunction to smooth the lane line positions using a moving average with window size k.
Input:data = [2, 3, 5, 8, 7, 6, 4]k = 3
Output:[NaN, NaN, 3.33, 5.33, 6.67, 7.00, 5.67] (first k-1 elements are NaN or None)
3. Calculate the Collision Probability
Given two cars moving towards an intersection from perpendicular roads, each with a constant speed, calculate whether they will collide assuming bothstart at time t=0 and move straight through the intersection.
Input:
- Car A start position and speed:
posA = 0,speedA = 10m/s - Car B start position and speed:
posB = 0,speedB = 15m/s - Intersection length = 5 meters
- Both start at t=0 from distance
posAandposBto intersection.
Determine if their paths overlap in the intersection.
4. Path Planning with Obstacles
Given a grid representing a map with 0 as free space and 1 as obstacles, write a function to find the shortest path from the top-left corner to the bottom-right corner, moving only up, down, left, or right.
Input:
grid = [
[0, 0, 1, 0],
[1, 0, 1, 0],
[0, 0, 0, 0],
[0, 1, 1, 0]
]
Output:
Length of the shortest path (number of steps), or -1 if no path exists.
5. Data Stream Median
WeRide receives a continuous data stream from sensors. Design a data structure that supports adding a number and finding the median of all added numbersefficiently.
Operations:
addNum(num)— Add a number to the data structure.findMedian()— Return the median of all elements so far.
FAQ
Q： OA 時間多久？
A： 通常 90 分鐘左右。
Q： 題目難度怎樣？
A： 演算法題中上，設計題側重基礎數據結構和思路，整體偏硬。
Q： 可以用什麼語言？
A： 常用 C++， Java， Python。
Q： 現場卡殼怎麼辦？
A： 建議提前做好題目分類準備，有 Programhelp 遠端語音助攻隨時幫你梳理思路，現場不慌。
Programhelp OA 代寫優勢
WeRide OA 節奏快，時間緊，容易在細節或思路上卡點。 Programhelp 的遠端無痕連線代寫與語音助攻，能實時幫你：
- 迅速提示思路轉變，避免陷入暴力解泥潭
- 細緻檢查代碼邊界條件和複雜度分析
- 協助系統設計題拆解，梳理架構和關鍵點
- 行為和技術面試準備一應俱全，助力全流程過關
有 Programhelp 陪伴，線上 OA 再難也不怕！ 如果你也想拿 WeRide offer，找我安排專屬助攻方案吧！
