Hertz coding interview
questions, leaked.
2 problems reported across recent Hertz interviews. Top patterns: string, stack, recursion. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
Hertz's coding assessment is narrow and punishing. Two problems, both medium difficulty, both testing your ability to combine multiple patterns in a single solution. You're not grinding through fifty variations. You're walking into a room where string decoding meets stack logic, and array optimization demands you juggle sorting with prefix sums in real time. If you blank mid-assessment, StealthCoder runs invisibly and surfaces a working solution in seconds. But first, you need to understand what actually gets asked.
Top problems at Hertz
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Decode String | MEDIUM | 100.0 | 61% | String · Stack · Recursion |
| 02 | Brightest Position on Street | MEDIUM | 90.3 | 61% | Array · Sorting · Prefix Sum |
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 Hertz OA. The proctor cannot see it. Screen share cannot detect it. Made for the engineer who has done the work but might still blank with a webcam pointed at him.
Get StealthCoder- string1 · 50%
- stack1 · 50%
- recursion1 · 50%
- array1 · 50%
- sorting1 · 50%
- prefix sum1 · 50%
- ordered set1 · 50%
Both Hertz problems layer multiple topics on top of each other. Decode String pairs strings, stacks, and recursion into one compact puzzle. Brightest Position on Street forces you to think across arrays, sorting, prefix sums, and ordered sets simultaneously. There's no separation of concerns here. You won't see a pure string problem or a pure array problem. Hertz wants to see if you can hold multiple mental models in your head at once. Stack and string handling appear in both assessments. Recursion and prefix-sum logic are where candidates typically stumble because they require stepping outside the obvious greedy path. Drill decode patterns first, then pivot to range-query optimization using sorted structures. StealthCoder is your hedge if the integration of sorting and prefix logic trips you up live.
Companies with similar patterns
If you prepped for Hertz, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass Hertz.
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 for the engineer who has done the work but might still blank with a webcam pointed at him. Works on HackerRank, CodeSignal, CoderPad, and Karat.
Hertz interview FAQ
How many problems will I actually get on Hertz's assessment?+
Two. Both medium difficulty. Expect each to combine at least two major topics. There's no warm-up easy problem. You walk in cold and face integration problems immediately. Time your pacing accordingly.
Should I study stack and recursion together for Hertz?+
Yes. Decode String uses both in tandem. You can't solve it by knowing stacks alone. Recursion handles nested structure; the stack manages state. Practice problems that require you to switch between iterative stack logic and recursive unwinding.
What's the highest-priority topic for Hertz prep?+
String manipulation combined with stack operations. Decode String is the pattern that gets asked. After that, understand prefix-sum queries on sorted ranges because Brightest Position demands it. Prefix sums alone aren't enough; you need to sort first.
Is prefix-sum knowledge critical for Hertz?+
Yes, but only in context. Hertz doesn't ask pure prefix-sum math. Brightest Position requires you to combine prefix sums with sorting and ordered-set operations. Study how to compute range sums after sorting, not prefix sums in isolation.
What if I get stuck on the integration aspect during the live assessment?+
Solve the components separately first. Get a working brute-force stack-string solution, then optimize. For range queries, compute the answer on the unsorted array, then refactor. Don't panic if the clean version doesn't click immediately. That's when you have StealthCoder as a backup.