Honeywell coding interview
questions, leaked.
4 problems reported across recent Honeywell interviews. Top patterns: array, hash table, sliding window. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
Honeywell's assessment is small but dense. Four problems, split evenly between easy and medium, with array work dominating every single question. You're looking at two straightforward array problems you need to nail without hesitation, then two medium-tier questions that blend arrays with hash tables, sliding windows, or greedy logic. This isn't a filter for breadth. It's a depth check on whether you actually understand the patterns under the surface. If you blank on any of these during the live OA, StealthCoder runs invisibly and surfaces a working solution while you stay focused on the next problem.
Top problems at Honeywell
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Minimum Distance to the Target Element | EASY | 100.0 | 54% | Array |
| 02 | Count Zero Request Servers | MEDIUM | 75.5 | 34% | Array · Hash Table · Sliding Window |
| 03 | Maximum Matrix Sum | MEDIUM | 67.3 | 66% | Array · Greedy · Matrix |
| 04 | Two Sum | EASY | 67.3 | 56% | Array · Hash Table |
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 Honeywell OA. The proctor cannot see it. Screen share cannot detect it. Built by an Amazon engineer who used it to pass JPMorgan's OA and system design loop.
Get StealthCoder- array4 · 100%
- hash table2 · 50%
- sliding window1 · 25%
- sorting1 · 25%
- greedy1 · 25%
- matrix1 · 25%
Array problems appear in all four questions, which means your first priority is speed and accuracy with indexing, iteration, and range logic. Two Sum and Minimum Distance to the Target Element are your confidence builders. The medium tier jumps complexity by layering in hash tables (to deduplicate or count efficiently), sliding windows (for cache-like state), and greedy decision-making on matrices. Count Zero Request Servers and Maximum Matrix Sum both require you to think beyond a simple loop. Hash tables appear twice across the dataset, sliding windows once. Sort and greedy patterns each show up once but both live in medium problems, so don't neglect them. If you've drilled Two Sum and array basics hard, you're safe on the easy tier. The medium questions are where the assessment earns its keep. If you hit a wall during the OA on either medium problem, StealthCoder is your safety net, invisible to the proctor.
Companies with similar patterns
If you prepped for Honeywell, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass Honeywell.
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 Amazon engineer who used it to pass JPMorgan's OA and system design loop. Works on HackerRank, CodeSignal, CoderPad, and Karat.
Honeywell interview FAQ
Should I study hash tables before sliding windows for Honeywell?+
Hash tables appear twice in the dataset (Two Sum and Count Zero Request Servers). Sliding windows appears once. Start with hash tables for speed on the easy tier, then layer in sliding window logic for the harder medium problem. Both will be live in the OA.
How much time should I spend on matrix problems?+
Matrix appears once, in Maximum Matrix Sum, a medium difficulty. It's paired with greedy and array logic, so don't isolate matrix drills. Get comfortable with 2D array iteration and greedy property thinking in the context of row/column sums.
Is Two Sum going to be on the Honeywell assessment?+
Two Sum is the classic two-pointer/hash-table problem and it's in their reported problem set. It's easy difficulty. You need a clean, sub-linear solution ready to ship in under two minutes. No hesitation.
What's the hardest topic I'll see in Honeywell's OA?+
No hard problems are reported. The ceiling is medium, split between two questions. Both mix array work with hash tables or greedy logic. If you're solid on array fundamentals and hash tables, the medium tier is reachable. Greedy and sliding window are lower-frequency but still live.
How many array problems should I solve before the OA?+
All four reported problems touch arrays. Drill at least 20 to 30 array problems covering indexing, two pointers, and prefix logic. The four on Honeywell's list are your baseline. Everything else is depth and edge-case handling.