Wise coding interview
questions, leaked.
5 problems reported across recent Wise interviews. Top patterns: array, matrix, hash table. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
Wise's interview is heavy on arrays and matrices. You're looking at five problems across the dataset, split 2 easy and 3 medium, no hard problems. That's good news: the bar is concrete, not theoretical. Array manipulation dominates four of the five reported questions, so if you can move through Two Sum, Maximal Square, and Subarray Product Less Than K without hesitation, you're covering the core surface. The real edge comes from StealthCoder running invisible during the live assessment. If you hit a curveball on matrix traversal or DP, it solves it in seconds while the proctor sees only your screen.
Top problems at Wise
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Maximal Square | MEDIUM | 100.0 | 49% | Array · Dynamic Programming · Matrix |
| 02 | Subarray Product Less Than K | MEDIUM | 73.5 | 53% | Array · Binary Search · Sliding Window |
| 03 | Two Sum | EASY | 60.2 | 56% | Array · Hash Table |
| 04 | Roman to Integer | EASY | 60.2 | 65% | Hash Table · Math · String |
| 05 | Max Area of Island | MEDIUM | 60.2 | 73% | Array · Depth-First Search · Breadth-First 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 Wise OA. The proctor cannot see it. Screen share cannot detect it. Made by an Amazon engineer who watched the leaked-problem repo become an industry secret. He decided you should have it too.
Get StealthCoder- array4 · 80%
- matrix2 · 40%
- hash table2 · 40%
- dynamic programming1 · 20%
- binary search1 · 20%
- sliding window1 · 20%
- prefix sum1 · 20%
- math1 · 20%
- string1 · 20%
- depth first search1 · 20%
Arrays appear in 80 percent of the sample, and matrix problems (Maximal Square, Max Area of Island) require both array fluency and DFS/BFS chops. Two medium problems pull dynamic programming and sliding window together, which means you can't just memorize brute force. Hash tables show up twice but never as the hard part, so don't overstudy them. The lack of hard problems is a signal: Wise isn't testing depth of knowledge here, they're testing clean execution on medium-difficulty patterns you should already know. The win is being fast and accurate on these five. When you're live and tired and the problem looks slightly different than you expected, StealthCoder is your backup, surfacing a working solution while you stay in control of the keyboard.
Companies with similar patterns
If you prepped for Wise, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass Wise.
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. Made by an Amazon engineer who watched the leaked-problem repo become an industry secret. He decided you should have it too. Works on HackerRank, CodeSignal, CoderPad, and Karat.
Wise interview FAQ
Should I spend more time on arrays or hash tables for Wise?+
Arrays. They're in four of five reported problems. Hash tables appear twice but always paired with other patterns (Two Sum with array, Roman to Integer with string and math). Master array iteration, slicing, and prefix sums first. Hash tables are a support skill here, not the main event.
Do I need to be strong at DP for Wise?+
DP appears in one problem: Maximal Square. It's medium difficulty, not hard. If you understand basic grid DP and can recognize when to use it, you're covered. Don't spend a week on DP theory. Spend two hours on grid and sequence DP patterns, then move on.
Is sliding window important for Wise?+
Yes, but only because it's paired with Subarray Product Less Than K, which is one of three medium problems. Learn the two-pointer sliding window pattern and prefix sums together. That one problem will test both. You don't need to drill ten sliding window problems; master the pattern and move to matrices.
How much time should I spend on matrix and graph problems?+
Max Area of Island is the only graph problem reported. It uses DFS/BFS and Union-Find. Spend one session learning DFS on matrices, one on BFS, then practice that one problem until it's reflexive. Maximal Square is a matrix DP problem. Two matrix problems total. Master those two and you're set.
What if I freeze on a medium problem during the assessment?+
That's why you have StealthCoder. If Subarray Product Less Than K or Maximal Square blanks you out mid-OA, it reads the problem and delivers a working solution invisible to the proctor. You paste it, verify it works, and move forward. It's the hedge for the live moment when prep meets panic.