Problem database last updated: June 20, 2025
4 problems · 2 Easy, 2 Medium, 0 Hard · Ranked #261 of 458
2 Easy
50% · avg 23%
2 Medium
50% · avg 59%
0 Hard
0% · avg 18%
Based on 4 reported problems, Honeywell interviews are easier than average - only 0% Hard compared to 18% across all companies.
Compared to the industry average, Honeywell puts unusual emphasis on array (100% of problems, 1.7x the industry average). If you're short on time, these are the categories to double down on.
The most common topics are array (100%), hash-table (25%), sliding-window (25%), sorting (25%). Problems below are sorted by frequency, the ones at the top are asked most often.
| Problem | Difficulty | Frequency | Topics | |
|---|---|---|---|---|
Minimum Distance to the Target Element Given an integer array nums (0-indexed) and two integers target and start, find an index i such that nums[i] == target and abs(i - start) is minimized. Note tha... | Easy | Very Likely | array | Solve |
Count Zero Request Servers You are given an integer n denoting the total number of servers and a 2D 0-indexed integer array logs, where logs[i] = [serverid, time] denotes that the server... | Medium | Very Likely | arrayhash-tablesliding-window | Solve |
Two Sum Given an array of integers nums and an integer target, return the indices of the two numbers that add up to target. | Easy | Likely | arrayhash-map | Solve |
Maximum Matrix Sum You are given an n x n integer matrix. You can do the following operation any number of times: | Medium | Likely | arraygreedymatrix | Solve |
Minimum Distance to the Target Element
SolveGiven an integer array nums (0-indexed) and two integers target and start, find an index i such that nums[i] == target and abs(i - start) is minimized. Note tha...
Count Zero Request Servers
SolveYou are given an integer n denoting the total number of servers and a 2D 0-indexed integer array logs, where logs[i] = [serverid, time] denotes that the server...
Two Sum
SolveGiven an array of integers nums and an integer target, return the indices of the two numbers that add up to target.
Maximum Matrix Sum
SolveYou are given an n x n integer matrix. You can do the following operation any number of times:
Frequency scores are based on crowdsourced interview reports. A higher score means the problem has been reported more often in recent Honeywell interviews.
Very Likely
75-100%
Likely
50-74%
Sometimes
25-49%
Rare
0-24%
Honeywell interviews focus heavily on array, hash-table, sliding-window problems. If you're short on time, these are the categories to prioritize. The problems on this page are sorted by frequency, so start from the top and work your way down.
Beyond solving problems, practice explaining your approach. Honeywell interviewers care about your thought process - how you break down a problem, consider edge cases, and evaluate tradeoffs between solutions. A clean O(n) solution you can explain clearly beats an O(log n) solution you can't articulate.
Looking for more companies? Browse all 458 companies in our directory, or sharpen your fundamentals with our free data structure visualizers and AI-powered DSA tutor.
Honeywell has been reported to ask 4 distinct coding problems. The most common topics are array, hash-table, sliding-window. 2 are Easy difficulty, 2 are Medium, and 0 are Hard. Problems are sorted by frequency - the ones at the top are asked most often.
Based on 4 reported problems, Honeywell interviews are easier than average - only 0% Hard compared to 18% across all companies. 50% of questions are Medium difficulty. Focus on the high-frequency Medium problems first, then work through the Hard ones.
Start with the highest-frequency problems listed on this page. Focus on the core topics: array, hash-table, sliding-window. Practice solving them under time pressure and explaining your approach out loud. Mock interviews with AI can simulate the real experience.
Simulate a real Honeywell coding interview with an AI interviewer. Get a scorecard with specific feedback on your problem-solving, code quality, and communication.
Simulate a Honeywell interview with AIarrow_forward
