cswork / libraryOpen practice workspace

Interview guides · Havells India

Havells India Software Engineer Interview Guide

Havells India Software Engineer interview guide: reported rounds, questions and how candidates describe the process.

The 60-second brief

As a Software Engineer at Havells India, you are at the intersection of traditional electrical engineering excellence and modern digital transformation. Havells India is rapidly evolving from a legacy consumer electrical goods giant into a tech-forward organization, with a primary focus on integrating IoT (Internet of Things) into its vast ecosystem of home and industrial products. Your role is critical in bridging the gap between hardware performance and user-centric software interfaces, ensuring that smart devices are reliable, secure, and intuitive. You will likely contribute to projects ranging from firmware development and embedded systems to cloud-based monitoring and mobile application backends. The work is impactful because it directly influences the daily lives of millions of consumers who rely on Havells India for energy management, lighting, and home automation.

This guide is scoped to a Software Engineer candidate at Havells India.

Focus areas

  • Data Structures and Algorithms (DSA)
  • Coding Interviews (Algorithmic Problem Solving)
  • Resume-Based Technical Discussion

The Havells India interview process

Havells India candidates report 3 rounds over 3-5 weeks. The stages below are what candidates describe, not a published process.

Online Assessment

Candidates begin with an online assessment on platforms like HackerRank covering Aptitude, Logical Reasoning, and Data Structures and Algorithms.

What to demonstrate

  • Candidates begin with an online assessment on platforms like HackerRank covering Aptitude, Logical Reasoning, and Data Structures and Algorithms
  • Depth in Data Structures and Algorithms (DSA)

How to prepare

  • Answer aloud and timed: Explain the difference between BFS and DFS and provide a scenario where one is preferred.
  • Answer aloud and timed: How would you solve the Trapping Rain Water problem efficiently?

Technical Rounds

At least two technical rounds conducted by senior leads or managers focusing on resume projects and core computer science subjects.

What to demonstrate

  • At least two technical rounds conducted by senior leads or managers focusing on resume projects and core computer science subjects
  • Depth in Data Structures and Algorithms (DSA)

How to prepare

  • Answer aloud and timed: Explain the logic behind finding the longest unique substring in a given string.
  • Answer aloud and timed: How does the compilation process work in C or C++?

HR Interview

A final HR interview focusing on background, motivations for joining, and clarifying any gaps in education or professional history.

What to demonstrate

  • A final HR interview focusing on background, motivations for joining, and clarifying any gaps in education or professional history
  • Depth in Data Structures and Algorithms (DSA)

How to prepare

  • Answer aloud and timed: What are function pointers, and how are they utilized in embedded software?
  • Answer aloud and timed: What are the key differences between a process and a thread?

Where candidates lose points

Review Core Subjects

Do not neglect core CS subjects like OS, DBMS, and Networking. Many candidates spend all their time on DSA and are surprised by theoretical questions in these areas.

Know Your Resume

Be prepared to explain every single line on your resume. Interviewers will pick specific keywords and ask you to elaborate on them.

Professionalism

Havells India is a established corporate entity; maintain a professional demeanor throughout, and ensure you have done your research on their products.

Think Out Loud

When solving coding or design problems, communicate your thought process. It helps the interviewer understand your logic and provides them the opportunity to guide you if you hit a roadblock.

Questions & practice

What are function pointers, and how are they utilized in embedded software?

Medium · Technical Fundamentals and DSA

Approach

  1. Say what the runtime actually does before reasoning about the code.
  2. Name what is shared across threads and what owns each piece of state.
  3. Identify the window where an invariant is briefly untrue.
  4. Distinguish a value from a reference to it, and say which one you handed out.

Follow-up

  • What happens if two callers reach this at the same time?
  • Where could this allocate more than you expect?

What are the key differences between a process and a thread?

Medium · Core Computer Science Subjects

Approach

  1. Say what the runtime actually does before reasoning about the code.
  2. Name what is shared across threads and what owns each piece of state.
  3. Identify the window where an invariant is briefly untrue.
  4. Distinguish a value from a reference to it, and say which one you handed out.

Follow-up

  • What happens if two callers reach this at the same time?
  • Where could this allocate more than you expect?

Identify the heaviest tenants in a five-minute window under memory pressure

Medium · top-k · heavy hitters · streaming

The edge service handles about 3,000 requests per second across roughly 50,000 tenants, peaking near 9,000. Expose the 50 heaviest tenants by request count over the trailing five minutes so limits can be tightened before one tenant's backfill starves the fleet. You may not retain five minutes of raw records. Give the exact solution and its memory, then the bounded-memory approximation with its error stated as a formula, and say which you would ship and at what tenant cardinality that choice changes.

Approach

  1. Do the exact version first, because it is affordable at this cardinality: a ring of 300 one-second counters per tenant, advanced lazily, is 1,200 bytes of counters per tenant and roughly 60 to 90 MB for 50,000 tenants with overhead. Carry a running total and subtract the bucket you overwrite so a window read is O(1) rather than 300 adds.
  2. Extract the top 50 with a size-k min-heap over the tenant sums: O(d log k) for d tenants, against O(d log d) to sort them all. Maintaining the heap continuously instead of on query requires a tenant-to-heap-index map, because incrementing a count already inside the heap means sifting from a known position, and without that map you rebuild the heap on every request.
  3. State the approximation precisely rather than gesturing at sketches. Misra-Gries with m counters retains every item whose true count exceeds N/(m+1), and each retained count underestimates the truth by at most N/(m+1). With m = 1,000 and N = 900,000 requests in the window the error is roughly 900 requests, which is fine for spotting a tenant sending 50,000 and useless for ranking two tenants 200 apart.
  4. Say what breaks when the window slides: Misra-Gries and Space-Saving are insert-only and cannot be decremented as records age out. The workable construction is one summary per sub-window, say ten seconds, with 30 summaries merged at query time, and the merged error is the sum of the per-summary errors, so the bound degrades linearly in the number of sub-windows.

Follow-up

  • The heaviest tenant is heavy because of one export job rather than user traffic. Should the limiter treat those as the same tenant?
  • Two tenants sit tied at the boundary of the top 50. Does your answer flap, and does the flapping matter?

What is normalization in DBMS, and why is it important for database design?

Medium · Core Computer Science Subjects

Approach

  1. Name the grain you start from and join outward from it.
  2. Check whether any join is one-to-many before aggregating, or the sums inflate.
  3. Say which index the query would use, and what makes it unusable.
  4. Handle the rows that do not match: that is usually the actual question.

Follow-up

  • How does the query change if that join becomes one-to-many?
  • What happens to this when the table is ten times larger?

Keep soft-deleted accounts from blocking re-registration

Easy · soft delete · unique constraints · engine differences

app_user holds user_id, tenant_id, email CITEXT, password_hash (NULL for SSO principals), email_verified_at, auth_version, status ('invited','active','suspended','deactivated'), created_at, updated_at, deleted_at. Two live accounts for one address inside a tenant must be impossible, but an address freed by a soft delete must be reusable, and the same tenant may delete and re-register it repeatedly. Write the uniqueness DDL for PostgreSQL 16, then the equivalent for MySQL 8 where partial indexes do not exist, and say what each permits once three deleted rows already hold that address.

Approach

  1. Start from what is actually unique: not (tenant_id, email), but (tenant_id, email) among live rows. PostgreSQL says that directly — CREATE UNIQUE INDEX app_user_live_email ON app_user (tenant_id, email) WHERE deleted_at IS NULL. A full constraint over the same two columns burns the address permanently the first time someone deletes an account.
  2. Keep case-insensitivity in the type or the index, never in the application: CITEXT as given, or UNIQUE (tenant_id, lower(email)) as an expression index where the extension is unavailable. A case-sensitive unique column is exactly how two accounts for one human appear.
  3. For MySQL 8 the predicate has to move inside the key: add a discriminator column that is a constant 0 while the row is live and is set to user_id on delete, with UNIQUE (tenant_id, email, deleted_marker). Live rows share the constant and still collide; deleted rows differ from each other and stop colliding.
  4. State the NULL variant and its dependency: leaving the marker NULL for deleted rows also works, because a unique index treats NULLs as distinct — true in MySQL, and true in PostgreSQL only under the default NULLS DISTINCT, which PostgreSQL 15 lets you reverse. Check the polarity against the three existing deleted rows: constant-on-live is what preserves the collision you want, and reversing it silently admits duplicate live accounts.

Follow-up

  • A deleted account re-registers with the same address the next day. Do the old resource rows follow the new user_id, and how does the API keep the two principals apart?
  • How do you honour an erasure request while resource_revision.actor_user_id still references this table?

Explain the difference between BFS and DFS and provide a scenario where one is preferred.

Medium · Technical Fundamentals and DSA

Approach

  1. Clarify what is being asked and what a complete answer contains.
  2. State your assumptions explicitly before working the problem.
  3. Say what you would check first and why it is the highest-information step.
  4. Work from the requirement backwards to the design.

Follow-up

  • What assumption would you test first?
  • How would you know your answer was wrong?

How would you solve the Trapping Rain Water problem efficiently?

Medium · Technical Fundamentals and DSA

Approach

  1. Clarify what is being asked and what a complete answer contains.
  2. State your assumptions explicitly before working the problem.
  3. Say what you would check first and why it is the highest-information step.
  4. Work from the requirement backwards to the design.

Follow-up

  • What assumption would you test first?
  • How would you know your answer was wrong?

Explain the logic behind finding the longest unique substring in a given string.

Medium · Technical Fundamentals and DSA

Approach

  1. Clarify what is being asked and what a complete answer contains.
  2. State your assumptions explicitly before working the problem.
  3. Say what you would check first and why it is the highest-information step.
  4. Work from the requirement backwards to the design.

Follow-up

  • What assumption would you test first?
  • How would you know your answer was wrong?

How does the compilation process work in C or C++?

Medium · Technical Fundamentals and DSA

Approach

  1. Clarify what is being asked and what a complete answer contains.
  2. State your assumptions explicitly before working the problem.
  3. Say what you would check first and why it is the highest-information step.
  4. Work from the requirement backwards to the design.

Follow-up

  • What assumption would you test first?
  • How would you know your answer was wrong?

Explain the OSI Model layers and the function of each layer.

Medium · Core Computer Science Subjects

Approach

  1. Clarify what is being asked and what a complete answer contains.
  2. State your assumptions explicitly before working the problem.
  3. Say what you would check first and why it is the highest-information step.
  4. Work from the requirement backwards to the design.

Follow-up

  • What assumption would you test first?
  • How would you know your answer was wrong?

Explain the concept of polymorphism and inheritance in OOPS.

Medium · Core Computer Science Subjects

Approach

  1. Clarify what is being asked and what a complete answer contains.
  2. State your assumptions explicitly before working the problem.
  3. Say what you would check first and why it is the highest-information step.
  4. Work from the requirement backwards to the design.

Follow-up

  • What assumption would you test first?
  • How would you know your answer was wrong?

Walk me through the most challenging technical project mentioned in your resume.

Medium · Project and Experience Deep-Dive

Approach

  1. Clarify what is being asked and what a complete answer contains.
  2. State your assumptions explicitly before working the problem.
  3. Say what you would check first and why it is the highest-information step.
  4. Work from the requirement backwards to the design.

Follow-up

  • What assumption would you test first?
  • How would you know your answer was wrong?

What specific tech stack did you use, and why did you choose it over alternatives?

Medium · Project and Experience Deep-Dive

Approach

  1. Clarify what is being asked and what a complete answer contains.
  2. State your assumptions explicitly before working the problem.
  3. Say what you would check first and why it is the highest-information step.
  4. Work from the requirement backwards to the design.

Follow-up

  • What assumption would you test first?
  • How would you know your answer was wrong?

How did you handle a situation where your code failed to meet performance requirements?

Medium · Project and Experience Deep-Dive

Approach

  1. Clarify what is being asked and what a complete answer contains.
  2. State your assumptions explicitly before working the problem.
  3. Say what you would check first and why it is the highest-information step.
  4. Work from the requirement backwards to the design.

Follow-up

  • What assumption would you test first?
  • How would you know your answer was wrong?

What was your personal contribution to your team's project during your internship?

Medium · Project and Experience Deep-Dive

Approach

  1. Clarify what is being asked and what a complete answer contains.
  2. State your assumptions explicitly before working the problem.
  3. Say what you would check first and why it is the highest-information step.
  4. Work from the requirement backwards to the design.

Follow-up

  • What assumption would you test first?
  • How would you know your answer was wrong?

How do you ensure your code is maintainable and scalable?

Medium · Project and Experience Deep-Dive

Approach

  1. Fix the scope first: who calls this, how often, and what they do when it fails.
  2. Name the read and write paths separately; they rarely have the same bottleneck.
  3. Choose a partition key and say what query it makes expensive.
  4. State the consistency you need, and where you are willing to be stale.

Follow-up

  • What breaks first when traffic grows ten times?
  • How does this behave when that dependency is down for an hour?

Exports duplicate a row range about once a week

Hard · leases · clock skew · idempotency

Roughly once a week an export writes a file containing a duplicated range of rows. The affected job_run rows show attempt = 1, status = succeeded, one started_at, and a lease_owner naming a different host from the one whose logs show the job starting. Leases last 30 seconds and are heartbeated every 10 from inside the handler; lease_expires_at is computed on the worker and compared against the database's now(). Find the mechanism, and give a fix that holds even if you cannot fix the clocks.

Approach

  1. Start from the fact that eliminates the obvious answer. attempt = 1 means no retry was recorded, so this is not a re-run after failure; two workers ran the same row concurrently and the takeover path never touched the counter. lease_owner naming a host other than the one that started the job is the same statement from the other side.
  2. Enumerate the mechanisms that cause a premature takeover, then find the signal that separates them. Either the lease genuinely expired because the heartbeat did not fire, which is what happens when the heartbeat runs on the handler's own thread and the handler makes a long blocking call, or it only appeared expired because two clocks disagree, since lease_expires_at is written from the worker's clock and evaluated against the database's. The discriminator is the distribution: incidents clustered on the longest exports indict the heartbeat, incidents clustered on one host indict skew. Measure both, and measure each host's offset against the database directly.
  3. Read the reclaim query precisely. In PostgreSQL now() is transaction start time, not statement time, so a reclaimer holding a long transaction compares against an older timestamp than expected; clock_timestamp() is the statement-time function. This is worth ruling in or out before you redesign anything, because it changes which rows look expired.
  4. Remove the second clock rather than trying to synchronise it. Issue and extend the lease in the database, with lease_expires_at = now() + interval '30 seconds' in both the claim and the heartbeat, so exactly one clock is ever compared and worker skew stops mattering to this predicate.

Follow-up

  • The displaced worker has already streamed half the file to object storage. What makes that side effect safe to repeat?
  • You now count takeovers. What alert fires on that counter, and at what threshold?

Suggested practice checklist

Built from the rounds and topics Havells India candidates report.

Day 1 — Map the Havells India loop

  • Write out the reported sequence: Online Assessment, Technical Rounds, HR Interview.
  • For each round, write one sentence on what it is judging, from the description above, and mark the one you are least ready for.

Deliverable: A one-page map of the 3 reported rounds, with the weakest marked.

Day 2 — Work Data Structures and Algorithms (DSA)

  • Spend the session on Data Structures and Algorithms (DSA), which Havells India candidates report being tested on.
  • Write one worked example in Data Structures and Algorithms (DSA) and time yourself on it.

Deliverable: One timed worked example in Data Structures and Algorithms (DSA).

Day 3 — Work Coding Interviews (Algorithmic Problem Solving)

  • Spend the session on Coding Interviews (Algorithmic Problem Solving), which Havells India candidates report being tested on.
  • Write one worked example in Coding Interviews (Algorithmic Problem Solving) and time yourself on it.

Deliverable: One timed worked example in Coding Interviews (Algorithmic Problem Solving).

Day 4 — Work Resume-Based Technical Discussion

  • Spend the session on Resume-Based Technical Discussion, which Havells India candidates report being tested on.
  • Write one worked example in Resume-Based Technical Discussion and time yourself on it.

Deliverable: One timed worked example in Resume-Based Technical Discussion.

Day 5 — Answer out loud: Technical Fundamentals and DSA

  • Answer aloud, timed: Explain the difference between BFS and DFS and provide a scenario where one is preferred.
  • Answer aloud, timed: How would you solve the Trapping Rain Water problem efficiently?

Deliverable: Spoken answers to 2 reported Technical Fundamentals and DSA question(s), under time.

Day 6 — Answer out loud: Core Computer Science Subjects

  • Answer aloud, timed: What are the key differences between a process and a thread?
  • Answer aloud, timed: Explain the OSI Model layers and the function of each layer.

Deliverable: Spoken answers to 2 reported Core Computer Science Subjects question(s), under time.

Day 7 — Answer out loud: Project and Experience Deep-Dive

  • Answer aloud, timed: Walk me through the most challenging technical project mentioned in your resume.
  • Answer aloud, timed: What specific tech stack did you use, and why did you choose it over alternatives?

Deliverable: Spoken answers to 2 reported Project and Experience Deep-Dive question(s), under time.

Behavioural preparation

Behavioural rounds judge the decision you made and what it cost.

How do you handle deadlocks in an operating system?

Medium · Core Computer Science Subjects

Approach

  1. Pick a story where you made the decision, not one where you watched it.
  2. State the situation in two sentences and spend the rest on the reasoning.
  3. Give the blast radius: what could have broken, and what you measured.
  4. Name the disagreement and how you resolved it with evidence.

Follow-up

  • What would you do differently if you ran that again?
  • How did you know your change caused the improvement?

What do you know about Havells India and our current product line?

Medium · Behavioral and Situational

Approach

  1. Pick a story where you made the decision, not one where you watched it.
  2. State the situation in two sentences and spend the rest on the reasoning.
  3. Give the blast radius: what could have broken, and what you measured.
  4. Name the disagreement and how you resolved it with evidence.

Follow-up

  • What would you do differently if you ran that again?
  • How did you know your change caused the improvement?

Why are you interested in transitioning into the consumer electronics/electrical industry?

Medium · Behavioral and Situational

Approach

  1. Pick a story where you made the decision, not one where you watched it.
  2. State the situation in two sentences and spend the rest on the reasoning.
  3. Give the blast radius: what could have broken, and what you measured.
  4. Name the disagreement and how you resolved it with evidence.

Follow-up

  • What would you do differently if you ran that again?
  • How did you know your change caused the improvement?

How would you handle a disagreement with a team member regarding a technical approach?

Medium · Behavioral and Situational

Approach

  1. Pick a story where you made the decision, not one where you watched it.
  2. State the situation in two sentences and spend the rest on the reasoning.
  3. Give the blast radius: what could have broken, and what you measured.
  4. Name the disagreement and how you resolved it with evidence.

Follow-up

  • What would you do differently if you ran that again?
  • How did you know your change caused the improvement?

Where do you see your professional growth in the next five years?

Medium · Behavioral and Situational

Approach

  1. Pick a story where you made the decision, not one where you watched it.
  2. State the situation in two sentences and spend the rest on the reasoning.
  3. Give the blast radius: what could have broken, and what you measured.
  4. Name the disagreement and how you resolved it with evidence.

Follow-up

  • What would you do differently if you ran that again?
  • How did you know your change caused the improvement?

Tell me about a time you had to learn a new technology under a tight deadline.

Medium · Behavioral and Situational

Approach

  1. Pick a story where you made the decision, not one where you watched it.
  2. State the situation in two sentences and spend the rest on the reasoning.
  3. Give the blast radius: what could have broken, and what you measured.
  4. Name the disagreement and how you resolved it with evidence.

Follow-up

  • What would you do differently if you ran that again?
  • How did you know your change caused the improvement?