WeRide OA 2026 Guide | Real Questions + Solutions + Prep Tips

WeRide is one of the leading players in autonomous driving, currently in its pre-IPO stage with offices across the US (San Jose HQ), China, and Singapore. The company offers a strong engineering environment, free meals, and opportunities for international collaboration.

In 2026, WeRide significantly increased hiring for New Grad and Intern roles. Given the competitive job market, this is a great opportunity worth targeting. This article shares a fresh and real WeRide OA experience to help you prepare effectively.

WeRide OA Overview

Platform: HackerRank
Number of Questions: 3
Duration: 90–135 minutes
Difficulty: Medium to Medium-Hard

The OA mainly tests:

Array processing and prefix sums
BFS with state compression (very important)
Data structure design and updates

Real WeRide OA Questions Breakdown (2025–2026)

Question 1: Distance Metric (Array Same-Value Distance Sum)

Problem:

Given an array arr, for each index i, compute the sum of absolute differences between i and all indices j where arr[i] == arr[j].

Example:

n = 6
arr = [1, 2, 1, 2, 1, 3]
Output: [5, 2, 4, 2, 6, 0]

Efficient Approach (O(n)):

Group indices by value using a hashmap
For each group, compute prefix sums
Calculate left and right contribution for each index

⚠️ Avoid brute force O(n²), which will likely TLE.

Question 2: Bob Navigates a Maze (BFS + State Compression)

Problem:

Given a grid:

0 = empty cell
1 = obstacle
2 = coin

Bob starts at (0,0), must collect all coins, then reach Alice at (x,y). Return the shortest path length, or -1 if impossible.

Core Idea:

Use BFS with state compression
Track coin collection using bitmask (k ≤ 10)

State Representation:

(row, col, coin_mask, steps)

Key Points:

Visited must include (row, col, state)
Target condition: reach (x,y) with all coins collected
Alice’s position may also contain a coin

Complexity:

O(m * n * 2^k), manageable since k is small.

Question 3: Discount Events (Range Update Problem)

Problem:

You have an array price[] and a sequence of queries:

Type 1: 1 x v → set price[x] = v
Type 2: 2 v → increase all prices < v to v

Example:

price = [7,5,4]
queries = [[2,6,0], [1,2,9], [2,8,0]]
Output: [8,9,8]

Solutions:

Brute force: apply type 2 by scanning the array (may TLE)
Optimized:

Maintain a global "floor" value
Combine with point updates
Or use segment tree / lazy propagation

⚠️ Queries must be processed strictly in order.

Preparation Tips for WeRide OA

Start with Q1 to secure quick points
Prioritize BFS with state compression (high-frequency pattern)
Practice range updates + point updates problems

Focus Areas:

Prefix sum + grouping techniques
BFS with bitmask states
Efficient data structure handling

WeRide values candidates with strong graph algorithms and system-thinking abilities, especially relevant to autonomous driving scenarios like path planning and simulation.