Wissen Technology coding interview
questions, leaked.
3 problems reported across recent Wissen Technology interviews. Top patterns: array, hash table, union find. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
Wissen Technology's interview has a small but focused problem set. You're looking at three problems total, two of them easy and one medium. The pattern is clear: they drill array and hash-table fundamentals hard. Two Sum and Reverse Words in a String III are your warm-ups. Longest Consecutive Sequence is the teeth. You can study this list end-to-end in a day. The real risk isn't the difficulty, it's blanking on the hash-table trick under pressure. That's where StealthCoder becomes your safety net, invisible during the live assessment if you hit a wall.
Top problems at Wissen Technology
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Two Sum | EASY | 100.0 | 56% | Array · Hash Table |
| 02 | Longest Consecutive Sequence | MEDIUM | 89.3 | 47% | Array · Hash Table · Union Find |
| 03 | Reverse Words in a String III | EASY | 89.3 | 84% | Two Pointers · String |
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 Wissen Technology OA. The proctor cannot see it. Screen share cannot detect it. Made by a working Amazon engineer who got tired of watching qualified friends bomb OAs they'd solve cold in an IDE.
Get StealthCoder- array2 · 67%
- hash table2 · 67%
- union find1 · 33%
- two pointers1 · 33%
- string1 · 33%
Array and hash-table problems dominate here, appearing in two problems each. That's not coincidence. Wissen is testing whether you can recognize when a hash-table solves an array problem, and whether you can execute it cleanly. Union-find shows up once in the medium problem, so don't skip it. Two-pointers and string handling appear once each and are likely screening questions to filter for baseline competence. The difficulty skew toward easy problems suggests a lighter bar than other companies, but the medium problem is a pattern-recognition check. Drill hash-table collision handling and array iteration first, then union-find. If you freeze on optimization during the OA, StealthCoder runs invisibly and gives you a working solution in seconds.
Companies with similar patterns
If you prepped for Wissen Technology, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass Wissen Technology.
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 a working Amazon engineer who got tired of watching qualified friends bomb OAs they'd solve cold in an IDE. Works on HackerRank, CodeSignal, CoderPad, and Karat.
Wissen Technology interview FAQ
How many hash-table problems should I solve before the Wissen OA?+
Two hash-table problems appear directly in their list. Solve those twice each from scratch until you can code Two Sum without thinking. Then solve 3 to 5 harder hash-table problems from a general problem bank. Wissen tests hash-table pattern recognition, not breadth.
Is Longest Consecutive Sequence hard enough to worry about?+
It's marked medium and requires union-find intuition, so yes. But it's the only hard pattern in their set. Study the union-find approach once you're solid on hash-table solutions. Understand the trade-off between sort and union-find for this problem.
Can I skip the string and two-pointers problem?+
No. Reverse Words in a String III is easy and appears in their list. It screens for basic string and pointer manipulation. Solve it a few times to build muscle memory. It's a warm-up, not a wild card.
What should I study first for Wissen?+
Hash-table fundamentals and array indexing. Both topics appear twice in their three problems. Get comfortable with hash-table lookups and collisions, then move to the medium problem. Two-pointers and string work are secondary.
How long should I spend prepping for a Wissen OA?+
One to two days if you know hash-tables and arrays already. Three problems is a small surface. Drill those three problems and 5 to 10 related ones. Don't over-prepare. Wissen's bar is narrower than most tech companies.