This time WeRide OA is really quite smooth, all three questions are completed on the Hackerrank platform, the question type is on the side of logic realization type, time is very abundant, the whole process basically did not get stuck. After finishing the questions, I feel that this set of questions is examining the clarity of thinking and realization details, the amount of questions is moderate, the difficulty is not high, but there are still some places that can reflect your sensitivity to DP and strings. Here is a detailed review of the three questions.
WeRide Interview Process
Before/after sharing the HackerRank OA experience, it is recommended to add a section with a complete process overview to give readers a clearer understanding of WeRide’s interview rhythm:
01) Online application and screening
- Submit your resume through the company's official website or recruitment platform.
- The recruitment team will initially screen resumes that meet the job requirements, and qualified candidates will receive an OA invitation.
02) Online Assessment — HackerRank
- OA is usually HackerRank Platform Test, the common time limit is about 90 minutes, the question type includes 2–3 algorithm/data structure questions of medium or difficult level.
- The focus of testing is usually Array/graph/tree/dynamic programming and other programming questions, the purpose is to screen basic algorithms and coding capabilities.
It is recommended to clearly write down your own question types or Hackerrank question examples, and then use them with the process description below for more practical value.
03) HR initial screening (short phone call/email communication)
- After passing the OA, HR will contact the candidate for a short phone call to confirm resume details & basic matching.
- This round usually does not delve into technical skills, but will ask questions such as resume background, available start date, etc.
04) Technical interview (Virtual or Onsite)
- Most candidates will enter the follow-up Technical interview session, often seen as 1–3 rounds:
- Code questions + system design
- Project experience questions and answers
- Digging deep into professional fields
- Each round of interviews is usually 45–60 minutes, will ask LeetCode type questions and practical engineering questions.
05) Behavioral/Team Matching
- Interviewers will evaluate your communication skills, teamwork experience, engineering judgment, and problem-solving skills.
- Behavioral questions may involve past experiences, conflict handling, project decision-making, etc.
06) Offer decision and notification
- The entire process from OA to final VO interview is possible Takes 1–3+ weeks.
- If all assessments pass, HR will provide an offer; if not, the result may be notified via email.
Q1: Date Mapping and Reformatting
Problem Statement:
Given a date string like "20th Oct 2025", convert it into the format "2025-10-20".
Idea:
This is a pretty standard string processing question.
- Create a table of English month-to-number mappings, for example
"Jan" -> "01","Feb" -> "02","Oct" -> "10". - Split the input string and extract
day,month,year. - take note of
dayThe suffixes "st", "nd", "rd", "th", etc. are removed. - The final splice is
"YYYY-MM-DD"is returned in the format of
Not a lot of code, but be careful how you handle the input formatting.
Q2: Minimum Cost to Make Adjacent Numbers Unequal
Problem Statement:
You are given two arrays h[] And c[]. You can increase h[i] by 1 at a cost of c[i].
Find the minimum total cost required so that all adjacent elements in h are not equal.
Thought Analysis:
This question looks like greed, but it's actually DP.
The key observation is that adding each element at most twice is sufficient to avoid duplication with neighbors.
- Defining the state
dp[i][j]preindexIOf the numbers, the firstII've got one.JThe minimum expenditure after the second (j ∈ {0,1,2}). - During a state transfer, from the previous position
dp[i-1][k]Transferred, as long as(h[i]+j) ! = (h[i-1]+k). - The transfer formula is:
dp[i][j] = min(dp[i-1][k] + j * c[i]) if h[i]+j ! = h[i-1]+k
- The final answer takes the minimum of the three states.
This idea has a time complexity of O(9n) and is simple and safe to implement.
DP Initialization and boundary conditions are the easiest places to lose points.
Q3: Count Binary Substrings
Problem Statement:
Given a binary string S, count the number of substrings that contain consecutive 0s followed by consecutive 1s (or vice versa), where the number of 0s and 1s are equal.
Thought Analysis:
This question is actually the same as the classic "Count Binary Substrings" question on LeetCode.
- First traverse the string and count the length of consecutive identical characters, for example
"00011110"→[3, 4, 1]. - Then for the two neighboring lengths
a[i], a[i+1]The answer to this question is added tomin(a[i], a[i+1]). - This is because each valid substring is formed by expanding out from the "01" or "10" boundary in the center.
An example:
s = "00110011"
groups = [2,2,2,2]
result = min(2,2)+min(2,2)+min(2,2) = 6
The implementation is very efficient, the key is to think of the abstraction of "continuous segment length".
WeRide OA Overall Experience
Complete OA:
- Platform: Hackerrank
- Number of questions: 3
- Duration: 90 minutes
- Difficulty: medium-easy
- Points: string processing, dynamic planning thinking, basic logic
WeRide's questions are quite uniform in style, clear in logic but prone to small potholes. When writing, be sure to pay attention to input details, such as date format, DP initialization conditions, and boundary processing.
The Key Assist in Taking the WeRide OA Offer
We provide Remote No Trace Online + Voice Assist system when coaching OA / Interviews for Autonomous Driving companies like WeRide, TuSimple, Cruise, Zoox, etc. Ensure all test cases 100% pass, no charge for not passing all test cases. We do this through remote control software ToDesk Carried out to ensure that it is seamless and undetectable.
This approach is particularly suitable for Hackerrank / Codility / CodeSignal platform questions.
We have helped many students to realize the first full AC in WeRide, Cruise, MathWorks and other OA → take the interview invitation.
If you've also been preparing for Autopilot / Quant / Big Factory OA lately, check out ourOA AssistsProgram.
Truly "no jamming, no mistakes, and a solid landing".
