Interview guides · Lennox India Technology Centre

Lennox India Technology Centre Software Engineer Interview Guide

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

The 60-second brief

As a Software Engineer at Lennox India Technology Centre, you are at the intersection of climate control innovation and digital transformation. You will contribute to the development of sophisticated software solutions that power the next generation of HVAC systems, energy management platforms, and smart building technologies. Your work directly impacts the efficiency, reliability, and user experience of products that millions of customers depend on for their comfort and safety. This role is critical because Lennox India Technology Centre serves as a vital hub for global engineering excellence. You will be expected to tackle complex challenges, ranging from embedded systems and cloud-integrated applications to data-driven performance analytics.

This guide is scoped to a Software Engineer candidate at Lennox India Technology Centre.

Focus areas

C++
Object-Oriented Programming (OOP) / OOPS
Problem Solving

The Lennox India Technology Centre interview process

Lennox India Technology Centre candidates report 5 rounds over 4-6 weeks. The stages below are what candidates describe, not a published process.

Recruiter Screen

Initial screening by a recruiter to assess candidate fit for the role.

What to demonstrate

Initial screening by a recruiter to assess candidate fit for the role
Depth in C++

How to prepare

Be able to walk your CV end to end in two minutes, and say why this company specifically.
Have your salary expectations, notice period and location constraints ready, and ask for the rest of the loop in writing.

Technical Assessments

Multiple rounds of technical assessments focusing on practical, project-based discussions.

What to demonstrate

Multiple rounds of technical assessments focusing on practical, project-based discussions
Depth in C++

How to prepare

Answer aloud and timed: What is your experience with Cloud platforms and integrating them into software workflows?
Answer aloud and timed: How do you approach debugging a complex program when the output is unexpected?

Managerial Assessments

Evaluation of managerial skills and cultural alignment with the team.

What to demonstrate

Evaluation of managerial skills and cultural alignment with the team
Depth in C++

How to prepare

Answer aloud and timed: Can you describe a scenario where you had to choose between different data structures for efficiency?
Answer aloud and timed: Describe a time you worked on a project that failed; what did you learn and how did you pivot?

Group Discussion/Aptitude Test

Optional assessment to gauge communication skills and logical reasoning.

What to demonstrate

Optional assessment to gauge communication skills and logical reasoning
Depth in C++

How to prepare

Answer aloud and timed: How do you handle disagreements with team members regarding technical implementation?
Answer aloud and timed: Why are you interested in joining Lennox India Technology Centre specifically?

Final Leadership Interviews

Final round of interviews with leadership to assess overall fit and potential.

What to demonstrate

Final round of interviews with leadership to assess overall fit and potential
Depth in C++

How to prepare

Answer aloud and timed: Tell us about a time you had to take charge of a situation to ensure a project stayed on track.
Answer aloud and timed: How do you prioritize your tasks when faced with multiple urgent requests?

Where candidates lose points

Own your resume

Every line on your resume is fair game. Be prepared to explain every project, language, and tool you have listed in detail.

Prepare for behavioral questions

Use the STAR method (Situation, Task, Action, Result) to structure your answers to situational questions.

Stay proactive

If the process feels long, maintain your enthusiasm and professional communication; it shows your dedication to the role.

Understand the industry

Having some context on current trends in energy efficiency or HVAC technology can set you apart from other candidates.

Questions & practice

Can you walk us through the memory management or performance implications of your code?

Medium · Technical Fundamentals and Domain Knowle

Approach

Say what the runtime actually does before reasoning about the code.
Name what is shared across threads and what owns each piece of state.
Identify the window where an invariant is briefly untrue.
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?

Diff a projection against the primary without per-row point reads

Hard · reconciliation · range hashing · throttling

The listing projection has drifted and some rows show a stale version. The primary holds 40,000,000 resource rows across 12,000 tenants while serving 1,200 writes and 14,000 reads per second. The obvious repair, reading each resource row and comparing its version against the projection, is correct and would eventually finish. Explain precisely why it is unacceptable here, then give a diff that finds the differing rows, state its complexity, and make it safe to run against a live primary. Replication lag is usually under 100 ms and is not bounded.

Approach

Quantify the naive cost rather than calling it slow: 40,000,000 point reads at even 0.5 ms each is over five hours serialised, and the only lever is concurrency, which is exactly what you cannot spend. The primary's pool is sized for the write path, and 40,000,000 random reads evict the buffer cache that sustains the 85 percent cache hit rate, so the audit degrades the system it is auditing.
Replace random access with one ordered pass per side. Both sides can be read in (tenant_id, resource_id) order, which is a sequential scan on each and a merge join in O(n) time and O(1) memory. For a dense diff that is the whole answer, and it reads the primary once instead of 40,000,000 times.
For the expected sparse case, compare range hashes instead of rows: partition the key space, compute per range an order-independent aggregate over hash(resource_id, version), compare aggregates, and descend only into ranges that differ. With d differing rows and branching factor B, at most d ranges mismatch per level, so the drill-down examines O(d log_B(n/d)) ranges and reads full rows only in mismatching leaves.
Aggregate with a sum modulo 2^64 or a multiset hash, never XOR. XOR is order-independent but self-cancelling, so two rows wrong in the same way, or a row duplicated on one side, leave the range aggregate matching and the range is declared clean.

Follow-up

The diff reports 900 stale rows. How do you decide between patching those rows and rebuilding the projection from resource_revision?
Same job, but the projection lives in a search index that cannot be scanned in key order. What changes?

Find overlapping job attempts and peak concurrency from lease records

Medium · sweep line · intervals · leases

A day of job_run history yields about 50,000,000 attempt records: (job_run_id, job_type, attempt, started_at, finished_at which is NULL when the worker died, lease_expires_at). Leases expire on a clock, so a job that outran its lease ran twice. Produce (a) every job_run_id whose attempts overlapped in wall-clock time and (b) the peak number of simultaneously running attempts per job_type with the minute it occurred. Target O(n log n). State how you treat a NULL finished_at and what clock skew does to your answer.

Approach

Define the interval before sorting anything: an attempt occupies [started_at, COALESCE(finished_at, lease_expires_at)). finished_at is observed and lease_expires_at is only a promise, so every attempt without a finish contributes an estimate and the whole result is a lower bound on overlap rather than an exact count.
For peak concurrency, sweep: emit 2n endpoints, sort by (timestamp, kind) with ends ordered before starts at equal timestamps, then walk the sequence maintaining a counter per job_type and record each type's maximum with its timestamp. O(n log n) dominated by the sort, O(n) space, or O(1) extra if the sort is external and the walk streams.
For overlap detection, do not compare attempts pairwise. A single global sort by (job_run_id, started_at) gives both the grouping and the order; within a group, keep the maximum end seen so far and report an overlap exactly when the next start is less than that running maximum, which is one linear pass after the sort.
Half-open intervals matter and are easy to get wrong: with closed intervals an attempt ending at the same millisecond another begins reads as concurrency two, and across 50,000,000 records that artefact swamps the real signal.

Follow-up

A handler is not idempotent and you have found 400 overlapping jobs. Which of them actually caused damage, and what would you query to find out?
Peak concurrency for one job_type is 4 against a configured cap of 4. Is the cap working, or is the data hiding attempts that never started?

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

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.
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.
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.
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 why the owner filter ignores the listing index

Medium · composite index · query plans · sort elimination

The only index on resource is (tenant_id, status, updated_at DESC, resource_id DESC). A new endpoint returns one user's resources across all statuses, newest created first: WHERE tenant_id = $1 AND owner_user_id = $2 ORDER BY created_at DESC LIMIT 20. On a tenant with 2M rows it takes 900 ms and EXPLAIN shows a sort above a large scan. Explain precisely why the existing index cannot serve it, give the index that can, and state which of these the new index still will not help: owner_user_id alone across tenants; the same query ordered by updated_at. PostgreSQL 16.

Approach

Separate the two jobs an index does. For filtering, a composite btree is seekable only on a left prefix, so with no predicate on status the scan can at best range over tenant_id and test owner_user_id per row; PostgreSQL 16 has no btree skip scan to jump the unconstrained column.
For ordering, the index is sorted by (status, updated_at) within a tenant and not by created_at, so the LIMIT cannot stop early: every matching row is read and then sorted. That is the 'Sort Method: top-N heapsort' line, and it is why the plan reads 2M rows to answer with 20.
Derive the replacement from the access path — equality, equality, then the ordering column: CREATE INDEX CONCURRENTLY ON resource (tenant_id, owner_user_id, created_at DESC). The scan seeks to the (tenant, owner) range and walks 20 entries in order, so the Sort node disappears along with the row-read.
Treat INCLUDE (title, status) as conditional, not free. An index-only scan still visits the heap for any row whose page is not marked all-visible, so on a table taking 1.2k writes/second the win depends on autovacuum keeping the visibility map current, and the wider index costs more on every insert.

Follow-up

90% of rows are status='active'. Would a partial index WHERE status = 'active' change your answer, and for which of the three queries?
A dashboard runs this for 40 owners in one page load. What changes about the design?

How would you explain the core principles of OOPS and their application in your recent projects?

Medium · Technical Fundamentals and Domain Knowle

Approach

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

Follow-up

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

Can you describe a scenario where you had to choose between different data structures for efficiency?

Medium · Technical Fundamentals and Domain Knowle

Approach

Clarify what is being asked and what a complete answer contains.
State your assumptions explicitly before working the problem.
Say what you would check first and why it is the highest-information step.
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 approach debugging a complex program when the output is unexpected?

Medium · Technical Fundamentals and Domain Knowle

Approach

Establish what changed and when, before forming any theory.
Pick a bisection that eliminates candidates whichever way it turns out.
Check the instrumentation before believing the symptom.
Separate the trigger from the cause; the deploy is rarely the bug.

Follow-up

What would you look at first, and what would it rule out?
How would you tell a cause from a coincidence here?

Suggested practice checklist

Built from the rounds and topics Lennox India Technology Centre candidates report.

Day 1 — Map the Lennox India Technology Centre loop

Write out the reported sequence: Recruiter Screen, Technical Assessments, Managerial Assessments, Group Discussion/Aptitude Test, Final Leadership Interviews.
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 5 reported rounds, with the weakest marked.

Day 2 — Work C++

Spend the session on C++, which Lennox India Technology Centre candidates report being tested on.
Write one worked example in C++ and time yourself on it.

Deliverable: One timed worked example in C++.

Day 3 — Work Object-Oriented Programming (OOP) / OOPS

Spend the session on Object-Oriented Programming (OOP) / OOPS, which Lennox India Technology Centre candidates report being tested on.
Write one worked example in Object-Oriented Programming (OOP) / OOPS and time yourself on it.

Deliverable: One timed worked example in Object-Oriented Programming (OOP) / OOPS.

Day 4 — Work Problem Solving

Spend the session on Problem Solving, which Lennox India Technology Centre candidates report being tested on.
Write one worked example in Problem Solving and time yourself on it.

Deliverable: One timed worked example in Problem Solving.

Day 5 — Answer out loud: Technical Fundamentals and Domain Knowledge

Answer aloud, timed: How would you explain the core principles of OOPS and their application in your recent projects?
Answer aloud, timed: Can you walk us through the memory management or performance implications of your code?

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

Day 6 — Answer out loud: Behavioral and Situational Leadership

Answer aloud, timed: Describe a time you worked on a project that failed; what did you learn and how did you pivot?
Answer aloud, timed: How do you handle disagreements with team members regarding technical implementation?

Deliverable: Spoken answers to 2 reported Behavioral and Situational Leadership question(s), under time.

Day 7 — Dry run for Lennox India Technology Centre

Run one full mock under time, then write down the two questions you most want to ask your interviewers.

Deliverable: A completed timed mock and two questions to ask.

Behavioural preparation

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

What is your experience with Cloud platforms and integrating them into software workflows?

Medium · Technical Fundamentals and Domain Knowle

Approach

Pick a story where you made the decision, not one where you watched it.
State the situation in two sentences and spend the rest on the reasoning.
Give the blast radius: what could have broken, and what you measured.
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?