Huawei coding interview
questions, leaked.
15 problems reported across recent Huawei interviews. Top patterns: array, string, stack. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
Huawei's technical screen is array-heavy. Nine of the fifteen reported problems center on arrays, and you'll see string manipulation, stack operations, and dynamic programming woven through most of them. The difficulty splits 3 easy, 9 medium, 3 hard, so expect medium as the baseline. Two Sum and Valid Parentheses are warm-ups; the real test lives in Minimum Number of Visited Cells in a Grid, Maximal Rectangle, and 24 Game. If you hit a wall on a grid or matrix problem mid-interview, StealthCoder runs invisibly during screen share and surfaces a working approach in seconds. Your actual edge comes from drilling arrays first, then stacks.
Top problems at Huawei
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Minimum Number of Visited Cells in a Grid | HARD | 100.0 | 23% | Array · Dynamic Programming · Stack |
| 02 | Maximum Binary String After Change | MEDIUM | 100.0 | 47% | String · Greedy |
| 03 | Two Sum | EASY | 91.4 | 56% | Array · Hash Table |
| 04 | Decode String | MEDIUM | 83.3 | 61% | String · Stack · Recursion |
| 05 | Valid Parentheses | EASY | 83.3 | 42% | String · Stack |
| 06 | Number of Islands | MEDIUM | 77.9 | 62% | Array · Depth-First Search · Breadth-First Search |
| 07 | Generate Parentheses | MEDIUM | 77.9 | 77% | String · Dynamic Programming · Backtracking |
| 08 | Combination Sum | MEDIUM | 71.0 | 75% | Array · Backtracking |
| 09 | Merge Two Sorted Lists | EASY | 71.0 | 67% | Linked List · Recursion |
| 10 | Longest Palindromic Substring | MEDIUM | 71.0 | 36% | Two Pointers · String · Dynamic Programming |
| 11 | 24 Game | HARD | 61.3 | 50% | Array · Math · Backtracking |
| 12 | Daily Temperatures | MEDIUM | 61.3 | 67% | Array · Stack · Monotonic Stack |
| 13 | Largest Number | MEDIUM | 61.3 | 41% | Array · String · Greedy |
| 14 | Maximum Subarray | MEDIUM | 61.3 | 52% | Array · Divide and Conquer · Dynamic Programming |
| 15 | Maximal Rectangle | HARD | 61.3 | 54% | Array · Dynamic Programming · Stack |
Frequencies derived from public community-tagged interview reports. Click a row to view on LeetCode.
You have a week, maybe less. You can't out-grind the list above. StealthCoder runs invisibly during the actual Huawei OA. The proctor cannot see it. Screen share cannot detect it. Built by an Amazon engineer who realized the OA tests how well you memorized 200 problems, not how well you code.
Get StealthCoder- array9 · 60%
- string6 · 40%
- stack5 · 33%
- dynamic programming5 · 33%
- matrix3 · 20%
- backtracking3 · 20%
- monotonic stack3 · 20%
- recursion2 · 13%
- breadth first search2 · 13%
- union find2 · 13%
Arrays dominate because they're the foundation for almost everything Huawei tests. Look at the distribution: array appears in nine problems, often paired with DP, strings, or matrix traversal. Stack comes next at five, and monotonic-stack another three, suggesting you'll need to recognize when a linear scan with a stack solves what looks like a brute-force loop. Dynamic programming shows up five times, mostly in grid and string problems. The nine medium problems mean you can't just pattern-match easy solutions and coast. Backtracking (three) and greedy (two) are secondary but real. String problems lean on stack and DP, not regex tricks. When you're live, if you blank on whether to use a monotonic stack or BFS for a grid problem, StealthCoder hedges that moment. Before the assessment, drill Two Sum and Daily Temperatures first to own stack mechanics, then move to grid problems.
Companies with similar patterns
If you prepped for Huawei, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass Huawei.
Memorizing every problem above in a week is a fantasy. StealthCoder is the hedge: an AI overlay that's invisible during screen share. It reads the problem on screen and surfaces a working solution in under 2 seconds. Built by an Amazon engineer who realized the OA tests how well you memorized 200 problems, not how well you code. Works on HackerRank, CodeSignal, CoderPad, and Karat.
Huawei interview FAQ
Should I spend more time on arrays or dynamic programming?+
Arrays. Nine of fifteen problems use arrays; DP appears in five. Master arrays, stacks, and their intersections first. DP patterns will emerge once array traversal is solid. For Huawei, strong array instinct saves more time than DP fluency.
Are monotonic stacks important for this company?+
Yes. Three reported problems involve monotonic stacks, and Daily Temperatures is a direct example. If you haven't built one before, that's a gap. It's the efficient answer to 'next larger/smaller element' problems Huawei loves.
How many medium problems should I solve before the OA?+
Nine of fifteen are medium, so they're your baseline. Solve at least five to ten variants of medium string, array, and DP problems. Easy problems are confidence-builders, not your real prep. Hard problems train endurance but aren't pass-fail.
Is Generate Parentheses or Decode String the harder pattern?+
Both are medium, but Decode String is trickier because it stacks nested structures. Both use stacks. If you solve Decode String well, you'll recognize the pattern in other medium problems. Parentheses generation is pure backtracking once you see the symmetry.
What topic should I ignore if time is short?+
Union-find appears once, BFS twice, greedy twice. Not worth deep prep. Focus on array, string, stack, and DP. If you see union-find or BFS during the OA and freeze, that's where StealthCoder saves you.