Weride Online Assessment Questions

We hold no confirmed online assessment reports for Weride so far. Below are its 3 closest coding and technical questions, which is what an OA draws from.

See everything we have on Weride →

Weride Coding & Technical Questions

#2791 Count Paths That Can Form a Palindrome in a Tree

hard binary tree lc_company

LeetCode #2791: Count Paths That Can Form a Palindrome in a Tree. Difficulty: Hard. Topics: Hash Table, Bit Manipulation, Tree, Depth-First Search. Asked at WeRide in the last 6 months.

View

#696 Count Binary Substrings

easy two pointers lc_company

LeetCode #696: Count Binary Substrings. Difficulty: Easy. Topics: Two Pointers, String. Asked at WeRide in the last 6 months.

View

#1559 Detect Cycles in 2D Grid

medium matrix lc_company

LeetCode #1559: Detect Cycles in 2D Grid. Difficulty: Medium. Topics: Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix. Asked at WeRide in the last 6 months.

View

Most Common OA Topics

two pointers (1) matrix (1) binary tree (1)

Weride OA Format and Platform

The Weride online assessment is delivered through a proctored online platform, most commonly HackerRank. Candidates receive the OA link by email after passing an initial resume review. The coding section typically contains 2 to 3 algorithmic problems with a 70 to 110 minute time limit.

Some Weride teams include an additional work simulation section that tests judgment and decision-making rather than coding ability. This section is not present for all roles. Check the LeakCode question database filtered by role type to see what past candidates for your specific role reported.

FAQ

Does Weride have an online assessment?

Yes. Weride uses an OA as the first technical screen for most engineering and technical roles. It is typically sent after a resume review and before any human interviews. The format has remained consistent across recent hiring cycles.

How hard is the Weride OA?

Based on candidate reports, Weride OA problems range from LeetCode medium to hard. Expect at least one problem that requires an efficient algorithm (not brute force) to pass all test cases within the time limit.

Where do these OA questions come from?

All questions in the LeakCode database are sourced from actual candidate reports on 1Point3Acres, Blind, Glassdoor, Reddit, and LeetCode. They are not AI-generated. Each question links to its source where the original report is public.

Related: Weride All Questions · All OA Questions · Browse Companies · Data Sources