NetEase coding interview
questions, leaked.
2 problems reported across recent NetEase interviews. Top patterns: string, dynamic programming, array. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
NetEase's interview is compact but brutal. Two problems, one medium and one hard, spanning string manipulation, dynamic programming, arrays, and greedy logic. You're looking at Strange Printer and Most Profit Assigning Work as the core patterns they care about. The hard problem alone requires you to see a 2D DP solution under pressure. StealthCoder runs invisibly during your live assessment and surfaces working code if you blank on the recurrence relation or get stuck on pointer logic.
Top problems at NetEase
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Strange Printer | HARD | 100.0 | 61% | String · Dynamic Programming |
| 02 | Most Profit Assigning Work | MEDIUM | 98.1 | 56% | Array · Two Pointers · Binary Search |
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 NetEase OA. The proctor cannot see it. Screen share cannot detect it. Built by a senior engineer who knows the OA is theater. This is the script.
Get StealthCoder- string1 · 50%
- dynamic programming1 · 50%
- array1 · 50%
- two pointers1 · 50%
- binary search1 · 50%
- greedy1 · 50%
- sorting1 · 50%
Both problems hit multiple topics at once. Most Profit Assigning Work forces you to juggle two pointers, binary search, and greedy sorting in one pass; it's the gateway to NetEase's assessment. Strange Printer is the wall. It's a 2D DP problem where the state isn't obvious and backtracking through subproblems takes real time. Neither problem is straightforward leetcode grind. The distribution tells you NetEase cares less about isolated hash tables and more about problems that blend techniques. If you freeze on DP state definition during the assessment, StealthCoder is your silent backup.
Companies with similar patterns
If you prepped for NetEase, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass NetEase.
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 a senior engineer who knows the OA is theater. This is the script. Works on HackerRank, CodeSignal, CoderPad, and Karat.
NetEase interview FAQ
Should I focus on the medium or hard problem first?+
Start with Most Profit Assigning Work. It teaches you two-pointer and greedy patterns NetEase clearly values, and it'll warm you up on sorting and binary search. Strange Printer is harder and DP-heavy, so drill it second. You need to hit the medium clean before tackling the hard.
Is two weeks enough prep for NetEase?+
With only two problems reported, it's possible but tight. Two weeks is enough to understand both patterns deeply, but you need to drill variations. Focus on two-pointer greedy problems and 2D DP string problems. The hard problem requires repetition to internalize the state space.
How important is string DP for NetEase?+
Strange Printer is one of two problems. String DP clearly matters to them. If you've never done 2D DP on strings before, spend three to four days on this pattern alone. It's not common in standard interviews, so weak candidates will panic on it.
Do I need to know binary search to pass?+
Yes. Most Profit Assigning Work uses binary search as part of the optimal solution. If you only brute-force it, you'll pass but slow. Binary search appears as a subtopic in their medium problem, so treat it as required, not optional.
What if I can't solve Strange Printer during the assessment?+
That's where preparation pays off. If you've drilled 2D DP and still blank, you're in trouble without a backup. Know the pattern cold before test day. If you hit a wall on the recurrence, time becomes your enemy fast.