Available question text
Count the number of right/down paths from the top-left to bottom-right of an m×n grid whose XOR of visited cell values equals k (values and k are <16), returning the count modulo 1e9+7. The core challenge is to efficiently aggregate XOR states across exponentially many paths (often via DP or a meet‑in‑the‑middle on anti-diagonals) given m,n up to 300.
Related questions
Continue with questions that share topics or the same question type.
- Add Consecutive-Value Bonuses to Grid Paths
Coding
- Check if Number Has Equal Digit Count and Digit Value
Coding
- Count Islands With Total Value Divisible by K
Coding
- Count Non Decreasing Arrays With Given Digit Sums
Coding · Array · Dynamic Programming · Prefix Sum
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 3393. Count Paths With the Given XOR Value
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source