Interview experience
Honeywell interview experiences covering Online Assessment, Technical Interview(s), Hackathon (select drives), HR Interview. Round-wise notes, common questions, and what candidates report clears each stage.
Honeywell Interview Questions and Answers (2026)
Honeywell is a global industrial technology company spanning aerospace, automation, building technologies, and performance materials. Its India engineering hubs hire software and embedded systems engineers to build avionics, IoT, and industrial control products for customers worldwide.
Explore: Interview experience · HR interview questions · Overview · Placement papers · Preparation guide
Overview
Honeywell’s India campus hiring is best known for its SDE loop - an online assessment, live-coding technical interview(s), an occasional hackathon, and HR - run out of its large Bangalore engineering-software organization behind its aerospace, building-technologies, and industrial-automation businesses.
HR interview questions
Honeywell HR interview questions with sample answer frameworks - motivation, relocation, STAR stories, and culture-fit prompts.
Honeywell interview process at a glance
| Round | Duration | What it tests |
|---|---|---|
| Online Assessment | ~60 min | MCQs on OOPs, DS, DBMS, aptitude + 2-3 coding problems |
| Technical Interview(s) | 45-60 min each | Live coding (arrays/strings/graphs), CS fundamentals, project discussion |
| Hackathon (select drives) | Few hours to 48 hours | Team-based real-world prototype build; top performers advance |
| HR Interview | 20-25 min | Communication, industry awareness, fit |
Honeywell online assessment: quick answers
These answers are compiled from Honeywell’s Campus Connect site, public candidate reports and prep guides, and drives differ. The instruction screen of your own test is the final word.
| Question | Answer |
|---|---|
| How many questions and how long? | No official figure. An older pattern cited by prep sites is 30 aptitude questions in 30 minutes plus 35 technical questions in 30 minutes. Recent software reports describe MCQs (OOP, data structures, DBMS, aptitude) plus 2-3 coding problems. |
| Does it have negative marking? | Not published. None of the candidate reports we read mention negative marking, so check the instruction screen. |
| Is there a sectional cutoff? | Not published. |
| What is the eligibility cutoff? | It depends on the drive. Honeywell’s Campus Connect 2026 asked for 6.0 CGPA and above with no active backlogs, for B.E./B.Tech in CS, IT, IS, AI/DS, ML and allied branches at partner colleges. Older drives cited 65% in 10th, 12th and graduation, and other campus notices 7.0 CGPA or 70%. |
| Which platform is it on? | HackerRank for most recent software tests; HackerEarth on 2017-18 drives. Campus Connect 2026 registration ran on HirePro’s MyCareernet portal. |
| Is there coding? | Yes for software roles. A Connected Enterprise intern test had 3 problems (easy, a medium DP and a medium tree); a 2021 SWE test included searching a circular array and a task to fetch JSON from an API and print one field. |
| Is there a hackathon? | On Campus Connect, yes. The 2026 cycle ran an online assessment, then an individual case and hackathon round where you pick 1 of 5 problems (for example AI smart-building optimisation or a fire-evacuation router), then interviews, leading to a paid 6-month internship with a possible full-time offer after it. |
Honeywell interview questions by role
The technical round follows the role. These are questions candidates have reported on GeeksforGeeks and Glassdoor; they show the level and style, not a fixed list.
| Role | Reported questions and topics |
|---|---|
| Software Engineer | C++ data types and their ranges. Storage classes, global vs static, recursion. RTOS round-robin scheduling. Find the midpoint of a linked list in one pass. |
| SDE intern (Connected Enterprise) | Knapsack and other DP problems with time complexity. How you implemented your CV project and the maths behind it. Your favourite algorithm and why. |
| 6-month intern (older drives) | OOP, data structures, aptitude and DBMS MCQs, then a short technical round with system design built on your resume projects. What happens when you type a URL, DNS, longest palindromic substring. |
| Hardware engineer | Fewer public reports. A 2023 Bengaluru campus candidate describes an online aptitude test and one in-person interview. |
Asked across every role: what you know about Honeywell, why Honeywell, a project deep-dive, relocation and whether you plan higher studies.
Online Assessment
Usually run on HackerRank or HackerEarth: MCQs across OOPs, data structures, and DBMS plus general aptitude, alongside 2-3 coding problems pulled from common DSA patterns (arrays, stacks, graphs). Candidate reports cite splits such as ~30 aptitude questions in 30 minutes plus ~35 technical MCQs in 30 minutes on older campus papers, or a 90-minute three-problem coding paper on recent intern drives - treat timing as invite-specific. OOP MCQs are often trickier than the coding section on SDE on-campus accounts; revise inheritance, polymorphism, and output-tracing before the test.
Common questions
- Coding problems on arrays, strings, stacks, and graphs
- OOPs, DBMS, and data-structures MCQs
- Aptitude questions - percentages, time-speed-distance, probability
Technical Interview(s)
Live coding, often on a shared editor like CodePair, paired with a resume-driven project discussion and CS-fundamentals questions. Some drives run two separate technical rounds instead of one.
Common questions
- Live coding problems on strings/arrays with follow-up on time/space complexity
- Walk through a resume project - architecture, trade-offs, your specific contribution
- OOPs concepts (inheritance, polymorphism) and basic DBMS/SQL questions
- Explain a bug you had to debug and how you found the root cause
Round-by-round breakdowns are on the Honeywell interview experience page.
Hackathon (select drives)
On drives that include it, this replaces or precedes a technical round: small teams (often around five people) build a working prototype for a real-world brief within a fixed window. Past briefs reported by candidates include an IoT home-automation system, a booking-app-style clone, and a simple game. Only a subset of each team - often one or two people - is shortlisted to continue. The 2026 Campus Connect cycle made this an individual round: after the online assessment, each candidate picked 1 of 5 problems (for example AI smart-building optimisation, a fire-evacuation router or behavioural anomaly detection for cybersecurity) before interviews.
Common questions
- Build a working prototype for a given brief (e.g. IoT home automation) within the time limit
- Explain your architecture and design trade-offs to the judges afterward
- Teamwork and task-division questions during judging
- Follow-up technical questions on the code you personally wrote
HR Interview
A closing 20-25 minute round on communication, industry awareness, and general fit, often including a direct question about which Honeywell business interests you. Panels frequently ask “What do you know about Honeywell?” literally, plus relocation to Bengaluru (Hyderabad and Madurai on some reqs) and department flexibility on intern cycles. Honeywell’s public interview guidance recommends STAR-format answers and thoughtful questions about the role - map stories to outcomes (debugging, hackathon delivery, pressure deadlines), not behaviour buzzwords alone.
Common questions
- Tell me about yourself
- Why Honeywell, and which of its businesses (aerospace, building tech, industrial automation) interests you?
- Tell me about the hackathon or a team project where you solved a real-world problem under time pressure
- Walk me through a technical project on your resume and the trade-offs you made
Sample answer frameworks for each of these are on the Honeywell HR interview questions page.
Software vs core engineering hiring at Honeywell
Honeywell’s India footprint includes a large software engineering organization (historically branded Honeywell Technology Solutions) that builds the software behind its aerospace, building-management, and industrial-automation products, alongside more traditional hardware/engineering roles tied to those same business lines. Most publicly reported campus interview experiences describe the SDE-style loop above; if your req is for a core hardware or systems-engineering GET role, expect the technical round to lean more on branch fundamentals (electronics, controls, mechanical) and less on live coding. Check your specific job title and team before assuming the SDE process applies.
Common technical interview questions and answers
Q: How would you count the number of islands in a grid of 0s and 1s?
Scan every cell of the grid; when you hit an unvisited 1, increment the island counter and run a DFS or BFS from that cell that flips every connected 1 to 0 (or marks it visited), moving in the four cardinal directions. Each cell is visited at most once, so the time complexity is O(rows x cols) and the space complexity is O(rows x cols) in the worst case for the recursion stack or the BFS queue. If the interviewer forbids mutating the input, carry a separate boolean visited matrix. The follow-up is usually diagonal connectivity, which just means expanding the neighbour list from four directions to eight.
Q: How do you design a stack that returns the minimum element in O(1)?
Keep a second stack, minStack, alongside the main stack. On push, push the value onto the main stack and push the smaller of the new value and the current minStack top onto minStack. On pop, pop both stacks. getMin then just reads minStack’s top. Every operation - push, pop, top, getMin - is O(1), at a cost of O(n) extra space. The space-optimised variant pushes onto minStack only when the new value is less than or equal to the current minimum, which saves memory but requires careful equality handling on pop.
Q: What is the difference between BFS and DFS, and when would you pick each?
BFS explores level by level using a queue and DFS goes as deep as possible along one branch using a stack or recursion; both are O(V + E) on an adjacency-list graph. BFS is the right choice when you need the shortest path in an unweighted graph, because the first time it reaches a node it has done so in the fewest edges. DFS is the better fit for cycle detection, topological sorting, and connected-component or flood-fill problems, and it uses O(h) stack space where h is the depth rather than O(width) queue space. On a very deep graph, recursive DFS risks a stack overflow, so an explicit stack is safer.
Q: Find the longest substring without repeating characters.
Use a sliding window with two pointers and a hash map from character to its last seen index. Move the right pointer forward one character at a time; if the character is already inside the window, jump the left pointer to one past its previous index. The answer is the maximum of right - left + 1 over the whole scan. This is O(n) time with a single pass and O(k) space where k is the size of the character set. The brute-force alternative - checking every substring for duplicates - is O(n cubed), which is exactly the contrast interviewers want you to draw.
Q: Explain runtime polymorphism in OOPs with a concrete example.
Runtime polymorphism means the method that actually executes is decided by the object’s real type at run time, not by the reference type at compile time. If Shape declares area() and Circle and Rectangle override it, then a Shape reference pointing at a Circle calls Circle’s area(). In C++ this requires the base method to be declared virtual, which routes the call through a vtable; in Java every non-final, non-static method is virtual by default. The practical payoff is that you can add a new Shape subclass without touching the code that loops over shapes calling area() - that is the open-closed principle in action.
Q: What is a database index, and when does adding one hurt?
An index is a separate data structure, usually a B-tree, that maps column values to row locations so the engine can find matching rows without scanning the whole table - turning an O(n) scan into roughly O(log n) lookups. It hurts on write-heavy tables, because every INSERT, UPDATE, and DELETE must also update every affected index, and it consumes extra disk. Indexes also go unused if the query applies a function to the indexed column, for example filtering on YEAR(created_at) = 2024 rather than on a date range, or if the column has very low cardinality such as a boolean flag. Composite indexes only help when the query filters on a leading prefix of the indexed columns.
Q: How would you detect a cycle in a directed graph?
Run a DFS while tracking two states per node: visited (seen at some point) and inRecursionStack (currently on the active DFS path). If DFS reaches a node that is already in the recursion stack, you have found a back edge and therefore a cycle. This is O(V + E) time and O(V) space. An alternative is Kahn’s algorithm for topological sort: repeatedly remove nodes with in-degree 0, and if fewer than V nodes come out, the leftover nodes form a cycle. Note that the undirected-graph version is different - there you compare against the parent node or use a disjoint-set union structure instead.
Q: What is a memory leak, and how would you track one down?
A memory leak is memory that a program has allocated but can no longer reach or free - a malloc without a matching free in C or C++, or in a garbage-collected language an object that is unreachable in intent but still referenced, such as a listener never deregistered or an ever-growing static cache. Symptoms are steadily climbing resident memory and eventually an out-of-memory failure under sustained load rather than immediately. Practically, you find them with tooling: Valgrind or AddressSanitizer for native code, and a heap dump compared across two points in time for JVM code, looking for the object class whose retained size grows. The fix is usually a clear ownership rule - RAII and smart pointers in C++, or bounding the cache with an eviction policy.
Frequently asked questions about Honeywell interviews
Does the Honeywell online test have negative marking?
Not published. None of the Honeywell candidate reports we read mention negative marking; recent software tests run on HackerRank with MCQs on OOP, data structures, DBMS and aptitude plus 2-3 coding problems, so check the instruction screen.
What is the CGPA cutoff for Honeywell?
It depends on the drive. Honeywell’s Campus Connect 2026 asked for 6.0 CGPA and above with no active backlogs for CS, IT and allied branches at partner colleges; older drives cited 65% in 10th, 12th and graduation, and other campus notices 7.0 CGPA or 70%.
What is the Honeywell interview process for freshers?
Honeywell’s software/SDE process typically runs 3-4 stages: 1. Online Assessment (~60 minutes, often on HackerRank) - MCQs on OOPs, data structures, DBMS, and aptitude, plus 2-3 coding problems (arrays, strings, stacks, graphs). 2. Technical Interview(s) (45-60 minutes each) - live coding (often on CodePair), resume/project deep-dive, and CS-fundamentals questions; some drives run two technical rounds. 3. A 48-hour or half-day hackathon on select drives - build or prototype a real-world use case (e.g. IoT home automation, a booking-app clone, a game), often in a team, with top performers shortlisted for the next round. 4. HR Interview (20-25 minutes) - communication, industry awareness, and fit.
Does Honeywell hire for software roles only, or also core engineering?
Both. Honeywell India has a large software/engineering-software presence (Honeywell Technology Solutions, Bangalore) hiring SDEs for its aerospace, building-technologies, and industrial-automation product lines, alongside more traditional hardware/engineering Graduate Engineer Trainee-style roles tied to those same businesses. The SDE loop (OA, technical interview(s), optional hackathon, HR) is the more commonly reported campus process; core engineering roles lean more on branch fundamentals and less on live coding.
What questions are asked in Honeywell interviews?
Online assessments and technical interviews lean on array/string/stack/graph coding problems, OOPs, DBMS, and data-structures MCQs, plus a resume-driven project discussion. Where a hackathon is part of the drive, you’ll build a working prototype for a real-world problem (past examples include IoT home-automation systems, a booking-app-style clone, and a simple game) within a fixed time window, sometimes as a team of about five.
How many rounds are there in the Honeywell interview?
Most SDE candidates go through 3-4 stages: an online assessment, one or two technical interviews, sometimes a hackathon (individual or team-based, running from a few hours to 48 hours depending on the drive), and a final HR round. Where a hackathon is used, only a subset of participants (often one or two per team) move forward to the next interview stage.
How should I prepare for Honeywell interviews?
Practice coding on arrays, strings, stacks, and graphs since these show up repeatedly in both the OA and technical rounds. Revise OOPs, DBMS, and data-structures fundamentals for the MCQ sections. Research Honeywell’s core businesses (aerospace, building technologies, industrial automation) so your ‘why Honeywell’ answer is specific. If your drive includes a hackathon, practice rapid prototyping and being effective in a small team under a hard time limit.
What happens in a Honeywell hackathon round?
Select drives replace or precede a technical interview with a hackathon - historically 4 hours to 48 hours depending on the cycle - where small teams (around five people) build a working prototype for a given real-world brief, such as an IoT home-automation system or a consumer-app clone. Evaluation is on coding skill, teamwork, and how well you understood and scoped the problem; typically only one or two members per team advance to the next round. Honeywell’s Campus Connect 2026 used an individual case and hackathon round instead, where each candidate picked 1 of 5 problems.
What interviewers score
| Stage | Strong signal | Weak signal |
|---|---|---|
| OA | Aptitude + technical MCQ splits finished | Graphs-only LeetCode; digital/MCU blank |
| Technical | C/C++ or embedded/OS depth matching the role | “Software” interest with zero memory/timing talk |
| HR | Domain fit (aerospace/automation/buildings) + hub relocation | Pure WFH product aspirations on an industrial role |
Software Engineer I and Embedded Engineer I diverge early. Match prep to the requisition, not a generic FAANG sheet.
Red flags that kill Honeywell offers
- Claiming embedded interest without memory layout or race-condition language
- Freezing on digital/microcontroller MCQs for embedded tracks
- Refusing Bengaluru/Hyderabad/Madurai when listed
- Safety/timing indifference on industrial software stories
- No questions about domain or product line
How to prepare for Honeywell interviews
- Loop map: Online Assessment; Technical Interview(s); Hackathon (select drives); HR Interview. Confirm timings from the drive mail.
- Technical depth: Drill the Q&A section until answers are spoken, not read. Know every resume project cold.
- Experiences: Study round-wise notes on the interview experience page - real prompts beat generic lists.
- HR: Three STAR stories + a specific “Why Honeywell?” on the HR page.
Who usually fits and who struggles
Good fit: You like constrained software (timing, memory, safety), you can finish 30 aptitude questions without a calculator meltdown, and you will relocate to Bengaluru or another listed hub. ECE students with real C lab work clear embedded I every year.
Harder path: You only practiced LeetCode hard graphs; you freeze on digital/microcontroller MCQs; you want pure WFH product work. Honeywell HR is polite and blunt on site and domain. A high CGPA with zero C is a common embedded-track fail.
A practical Honeywell prep plan
Use this as a default four-week loop before a Honeywell drive. Adjust to your invite timeline.
- Week 1: Timed aptitude + one easy coding problem a day, plus a one-page cs fundamentals sheet. Open the Honeywell previous-year sets on this site and mark which sections ate your time. Write the timing on a sticky note. That number is more useful than a 200-problem LeetCode streak you never timed.
- Week 2: Most Honeywell drives fail people on the first timed paper or OA. Do three timed sits this week. After each one, log every miss in a two-column note: topic and why (slow, wrong formula, bad edge case, panic). The next sit should only add problems from that log.
- Week 3: Technical interviews at Honeywell usually want a clean project story, one or two CS fundamentals, and (if the process has it) a behavioral or values round. Write STAR stories on paper, not in your head. Practise “Why Honeywell?” with one concrete product, lab, or business line - not a slogan.
- Week 4: Two full mocks, then only error-log topics - no new patterns. If you still have energy, redo only the questions you failed in week 2.
10-day crash version: Days 1-4 timed DSA, days 5-7 resume projects + CS fundamentals, days 8-9 mock interviews out loud, day 10 HR STAR stories on the HR page.
Compensation notes
Candidate-reported fresher/early-career packages for Honeywell often cite ₹8-15 LPA candidate-reported. Treat forum numbers as ranges, not guarantees - confirm the written offer letter for your team and location.
Sources
Interview process details and sample questions on this site are editorially organized from public candidate reports and hiring write-ups, with round structure, prep notes, and company-specific framing added by our team. For round-by-round stories, see the Honeywell interview experience page. For OA papers and coding drills, use Honeywell on placementpapers.app. OA quick answers and role-wise questions draw on Honeywell’s Campus Connect 2026 site, GeeksforGeeks interview experiences for Honeywell’s 2021 software engineer and Connected Enterprise intern drives, placementpapers.app’s Honeywell assessment page and Glassdoor candidate reviews.