Hiver coding interview
questions, leaked.
2 problems reported across recent Hiver interviews. Top patterns: dynamic programming, string, recursion. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
Hiver's coding assessment is tight. Two problems, one hard and one medium, and both hinge on dynamic programming. Regular Expression Matching tests your ability to build a DP table for pattern matching with recursion and backtracking. Maximum Product Subarray forces you to track state across an array. You're not drilling a broad list here. You're solving two specific patterns under pressure. If you hit a wall on regex or subarray logic mid-OA, StealthCoder surfaces a working solution in seconds, invisible to the proctor.
Top problems at Hiver
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Regular Expression Matching | HARD | 100.0 | 29% | String · Dynamic Programming · Recursion |
| 02 | Maximum Product Subarray | MEDIUM | 100.0 | 35% | Array · Dynamic Programming |
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 Hiver OA. The proctor cannot see it. Screen share cannot detect it. Built by an engineer who got tired of watching his cohort grind for six months and still get filtered at the OA stage.
Get StealthCoder- dynamic programming2 · 100%
- string1 · 50%
- recursion1 · 50%
- array1 · 50%
Dynamic programming dominates this assessment. Both problems demand it. Regular Expression Matching is the harder one and usually trips candidates who haven't built a DP table for string patterns before. Maximum Product Subarray is slightly gentler but requires you to track min and max states simultaneously, which isn't intuitive on the first attempt. String and array fundamentals matter, but they're scaffolding for the DP logic. You need to walk through both problems, hand-code the DP transitions, and memorize the base cases. If you blank on the recurrence relation during the live assessment, StealthCoder is your hedge. Study the DP frame first, then drill edge cases like empty strings and single-character inputs.
Companies with similar patterns
If you prepped for Hiver, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass Hiver.
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 engineer who got tired of watching his cohort grind for six months and still get filtered at the OA stage. Works on HackerRank, CodeSignal, CoderPad, and Karat.
Hiver interview FAQ
Should I focus on Regular Expression Matching first or Maximum Product Subarray?+
Start with Maximum Product Subarray. It's medium difficulty and teaches you DP state tracking on arrays, which is the foundation. Regular Expression Matching is harder and builds on similar DP thinking but with string manipulation. Nail the easier one, then move up.
How much time should I spend on dynamic programming prep for Hiver?+
All of it. Both problems in the assessment are DP-heavy. Spend time understanding recurrence relations, memoization, and base cases. Ignore other DP variants for now. You need depth on these two patterns, not breadth across ten problems.
Are recursion and string skills enough, or do I need to optimize with iteration?+
Recursion alone won't cut it. Regular Expression Matching requires both recursive thinking and iterative DP table construction. Understand the recursive structure first, then code the bottom-up DP solution. That's what they're testing.
What edge cases trip people on Maximum Product Subarray?+
Single negative number, all negatives, zeros in the middle, and overflow on large products. The state variables (min and max) flip when you hit a negative, so trace through by hand. Your DP transitions need to handle all four cases.
Is two problems a full assessment or a screening round?+
Two problems is typically a screening or early-stage round, usually 60 to 90 minutes total. The hardness spread (one medium, one hard) suggests they're checking both problem-solving speed and depth. Budget time accordingly: don't get stuck optimizing the first one.