As a Software Engineer at L&T Technology Services (LTTS), you are at the core of delivering high-end engineering and R&D solutions for global clients. You will work on complex, cross-disciplinary projects that span industries such as transportation, industrial products, telecom, and medical devices. Your role involves bridging the gap between high-level architectural requirements and low-level system implementation, ensuring that software solutions are not only functional but robust, scalable, and efficient. This position demands more than just coding proficiency; it requires a deep understanding of core engineering principles and the ability to apply them to real-world hardware-software integration. Whether you are working on embedded systems, cloud-native applications, or digital product design, your work directly influences the performance and reliability of mission-critical systems. Joining LTTS means contributing to a culture of technical excellence where precision and domain expertise are highly valued. ##### Tip The role often involves collaboration with cross-functional teams, including hardware engineers and product managers. Be prepared to discuss how your software solutions integrate with broader system architectures.
Online Assessment
reportedCandidates complete an online assessment covering aptitude, domain-specific technical MCQs, and basic programming logic.
What to demonstrate
- Candidates complete an online assessment covering aptitude, domain-specific technical MCQs, and basic programming logic
- Depth in C programming
How to prepare
- Answer aloud and timed: Explain the working principle of a [specific component, e.g., MOSFET, Transformer, or Motor].
- Answer aloud and timed: How do you handle memory management in C or C++?
Technical Interview Rounds
reportedOne or more technical interview rounds to assess candidates' technical depth.
What to demonstrate
- One or more technical interview rounds to assess candidates' technical depth
- Depth in C programming
How to prepare
- Answer aloud and timed: Explain the difference between stack and heap memory.
- Answer aloud and timed: What are the key stages in the software development life cycle for embedded systems?
HR Discussion
reportedFinal discussion with HR to evaluate fit and discuss potential offers.
What to demonstrate
- Final discussion with HR to evaluate fit and discuss potential offers
- Depth in C programming
How to prepare
- Answer aloud and timed: Can you explain the concept of polymorphism and inheritance with a practical example?
- Answer aloud and timed: Walk me through your final year project; what was your specific contribution?
1 candidate reports. Individual accounts describe a particular role and hiring cycle.
L&T Technology Services Software Engineer interview: networking and core theory
After the recruiter screen, I had two back-to-back technical interviews. They focused on my C, Linux, networking, and WiFi background, and I had to explain both concepts and the resume work behind them. One round also covered circuits, signals, communication, basic programming logic, and my projects. The manager round was more conversational. I discussed past work from my resume and answered scen…
Read full experiencePracHub editorial advice for the preparation topics above.
Prepare your Resume
Be ready to provide a detailed explanation of every project, volunteer activity, and language mentioned on your CV.
Structure your Answers
Use the STAR method (Situation, Task, Action, Result) for behavioral questions to keep your responses focused.
Follow the Job Description
Align your preparation with the specific tools and domains mentioned in the JD, as interviewers will prioritize these areas.
Stay Professional
LTTS values a disciplined, professional approach. Ensure your communication is clear, prompt, and courteous throughout the process.
Choose a category, try a prompt, then open its approach, worked solution or follow-up when you need it.
Explain the difference between stack and heap memory.
Explain the difference between stack and heap memory.
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?
Collapse a redelivered event batch into per-aggregate high-water marks
You drain a batch of up to 5,000,000 events, each (aggregate_id BIGINT, aggregate_version INT, event_type, payload). The log guarantees order within one aggregate only; the batch merges 64 partitions, and a relay failover has redelivered a range, so an older version for an aggregate can appear after a newer one. Given a map of last_applied_version per aggregate, produce the events worth applying, at most one per (aggregate_id, version), plus the count discarded. Target O(n) time. State the memory for 2,000,000 distinct aggregates and what you do when it does not fit.
Approach
- One pass, one hash map from aggregate_id to the highest version kept, and a discard counter. An event whose version is at or below last_applied_version for its aggregate is dropped without further work, which is the whole reason the event carries its version rather than a delta. O(n) expected time, O(d) space in distinct aggregates.
- Keep the maximum, never the last occurrence. The redelivered range means the final appearance of an aggregate in the batch can be an older version than one seen earlier in the same batch, so last-wins applies stale state over newer state and the projection regresses with no error anywhere.
- Cost the memory instead of calling it large: an 8-byte key plus a 4-byte version is 12 bytes of payload, and an open-addressed table held at a 0.7 load factor costs roughly 17 bytes per entry before per-slot metadata, so 2,000,000 aggregates is tens of megabytes in a native layout and several times that in a runtime that boxes both key and value.
- If the distinct set exceeds memory, partition on hash(aggregate_id) mod P and reduce each partition independently. Every event for one aggregate hashes to the same partition, so the per-partition result is exact and the merge is concatenation rather than a second reduction.
Follow-up
- The payload is a patch rather than a snapshot, so applying only the highest version loses the intermediate changes. What changes in your reduction?
- How do you detect that version 7 arrived while version 6 was never delivered, and what should the consumer do about the gap?
Archive a resource graph without breaking live references or recursing
Resources reference other resources within a tenant; for the largest tenant the reference table holds up to 2,000,000 nodes and 8,000,000 edges. Archiving a resource must archive everything reachable from it that nothing outside the set still references, refuse when a live external referrer exists, and terminate when references form cycles, which they legitimately do. Produce the archive order and the refusal list, targeting O(V+E). Say what stops the traversal crossing a tenant boundary, and why recursion is the wrong control structure at this size.
Approach
- Load the subgraph with the tenant predicate on both endpoints of the edge, not only on the side you started from. Scoping the left table alone is the classic cross-tenant leak: one mis-entered edge then pulls another tenant's resources into the traversal and, worse, into the archive.
- Traverse iteratively with an explicit stack. A 2,000,000-node graph can hold a chain deep enough to exhaust a native stack in the low tens of thousands of frames, and that failure is a process crash rather than an error you can return.
- Treat cycles as data rather than corruption: compute strongly connected components with Tarjan in O(V+E) using its own explicit stack, then condense. The condensation is a DAG, so a topological order over it gives the archive order, and every member of a component archives in one transaction because no order within a cycle is valid.
- Decide refusals with reverse edges. A candidate is archivable only if every in-edge originates inside the candidate set, so build the transpose or count in-degrees restricted to the visited set, and emit each blocked resource with the id of the external referrer, which is the only part of the answer an operator can act on.
Follow-up
- The graph is read in one query and the archive writes a minute later. What can change in between, and how do you make the write safe?
- The candidate set is 400,000 resources. Is that one transaction, and if not, what does a half-finished archive look like to a reader?
Write the update path that detects a concurrent edit
resource carries version INT NOT NULL DEFAULT 1. resource_revision holds revision_id, resource_id, version, actor_user_id, change_kind, patch JSONB, request_id, created_at with UNIQUE (resource_id, version). outbox_event holds aggregate_type, aggregate_id, aggregate_version, event_type, payload, status. A PUT carries the version the client read. Write the exact statements for the single transaction that applies the edit, records the revision and enqueues 'resource.updated', and give the handler's branch on zero affected rows. Then say what PostgreSQL 16 does under READ COMMITTED when two of these updates hit one row at once.
Approach
- One transaction, three writes, no network call inside it: UPDATE resource SET title = $3, version = version + 1, updated_at = now() WHERE resource_id = $1 AND tenant_id = $4 AND version = $2; then INSERT the resource_revision row at version $2 + 1; then INSERT the outbox_event row at the same aggregate_version. The event goes to a table rather than a broker because no transaction spans both.
- Branch on the affected-row count before doing anything else. Zero has three causes — stale version, wrong tenant, row gone — so re-read once and map to 409 carrying the current version, or 404 for an id outside the caller's tenant, which also stops the endpoint confirming that another tenant's id exists.
- State the engine behaviour instead of assuming it. Under READ COMMITTED the second UPDATE blocks on the row lock, and when the first commits PostgreSQL re-evaluates the WHERE clause against the newly committed row, so the version predicate now fails and the statement reports zero rows. Under REPEATABLE READ the identical collision raises SQLSTATE 40001 instead, so the handler must fold both shapes into one conflict response.
- Keep UNIQUE (resource_id, version) even though the predicate already serialises writers. It is what makes a lost update unwritable if any other path ever reaches the revision table, and it converts a logic bug into 23505 rather than into a silently missing history row.
Follow-up
- A client sends the version it read ten minutes ago and the resource has moved three versions. What is in your 409 so it can resolve the conflict without a full re-fetch?
- Two editors, two disjoint fields, no overlap. Does your answer still refuse the second write, and should it?
Hold a per-tenant active cap against concurrent creates
A tenant on the standard plan may hold at most 50 resources with status='active'. The create handler runs SELECT count(*) FROM resource WHERE tenant_id = $1 AND status = 'active', compares to 50, then inserts. Two creates arrive 3 ms apart on different instances and the tenant lands at 51. Name the anomaly, say whether PostgreSQL 16 READ COMMITTED or REPEATABLE READ prevents it and why, then give an implementation that holds the cap at READ COMMITTED with the exact statements. Finally, say what changes when the cap is 'at most one running export per tenant' on job_run.
Approach
- Name it: write skew. The two transactions read an overlapping set and write disjoint rows, so there is no row-level conflict for the engine to detect and each commit is individually legal.
- Rule out the levels precisely. READ COMMITTED takes a fresh snapshot per statement and takes no lock on the counted rows, so both see 49. PostgreSQL's REPEATABLE READ is snapshot isolation: it removes non-repeatable reads and phantoms within the snapshot but still admits write skew, because the anomaly is not a re-read of a changed row, it is a read of a set that a concurrent transaction invalidates. Only SERIALIZABLE closes it, by tracking the read dependency and aborting one transaction with SQLSTATE 40001 — a guarantee that exists only if the application re-runs the whole transaction from the read.
- Convert the set predicate into a single-row conflict: keep tenant.active_resource_count and run UPDATE tenant SET active_resource_count = active_resource_count + 1 WHERE tenant_id = $1 AND active_resource_count < 50 in the same transaction as the INSERT. Zero affected rows is the cap, returned as 409. The row lock serialises the decision at any isolation level, and contention is bounded to one tenant's row — which is also the fair-scheduling unit, unlike a global counter that would convoy every tenant behind one row.
- State the cost you just took on: a counter is a second source of truth that can drift, so every path that changes status must adjust it inside the same transaction, and a periodic reconciliation has to exist, with resource_revision as the authority for what the count should have been.
Follow-up
- A resource moves from archived back to active. Which statements change, and what breaks if the counter update and the status change land in different transactions?
- The cap becomes plan-dependent and a plan can change mid-month. Where does the number 50 live, and who reads it?
Explain the working principle of a [specific component, e.g., MOSFET, Transformer, or Motor].
Explain the working principle of a [specific component, e.g., MOSFET, Transformer, or Motor].
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?
What are the key stages in the software development life cycle for embedded systems?
What are the key stages in the software development life cycle for embedded systems?
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 explain the concept of polymorphism and inheritance with a practical example?
Can you explain the concept of polymorphism and inheritance with a practical example?
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?
Walk me through your final year project; what was your specific contribution?
Walk me through your final year project; what was your specific contribution?
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?
What were the biggest technical challenges you faced during your project and how did you resolve them?
What were the biggest technical challenges you faced during your project and how did you resolve them?
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?
If you were to start this project again, what would you do differently?
If you were to start this project again, what would you do differently?
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 did you validate the performance of your software solution?
How did you validate the performance of your software solution?
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?
Explain how you integrated your software with the hardware component.
Explain how you integrated your software with the hardware component.
Approach
- Say who the caller is and what they do when the call fails halfway.
- Define the identity of a request so a retry cannot double-apply it.
- Separate accepted, pending, failed and confirmed; they are different facts.
- Design the error taxonomy before the success shape; callers branch on it.
Follow-up
- What happens if the caller retries after a timeout?
- How does a client discover it is on an old version of this contract?
Every query on one table stalls for forty seconds mid-deploy
During a release on PostgreSQL, every query touching resource times out for about 40 seconds and then recovers with no intervention. The release ran one migration, ALTER TABLE resource ADD COLUMN archived_reason TEXT, and the migration log shows it completing in 6 ms. Unrelated tables showed no change in error rate. Explain how a 6 ms statement caused a 40-second stall, give the ordered checks you would run on a live system to confirm it, and give the migration procedure that prevents a repeat.
Approach
- Separate the statement's duration from the lock's duration. ADD COLUMN with no default is a catalogue-only change and genuinely runs in milliseconds, but it requires ACCESS EXCLUSIVE, and it cannot acquire that until every transaction already touching the table has finished.
- Account for the queueing, which is the part that surprises people. A lock request that is waiting blocks later requests for conflicting modes behind it rather than letting them overtake, so one long-open transaction holds the DDL and the DDL holds all the traffic. The stall length is set by the longest open transaction, not by the size of the change.
- Confirm on a live system in this order: pg_stat_activity for that table ordered by xact_start, looking for the oldest transaction and specifically for state = idle in transaction; then pg_locks where granted = false to find the waiter; then join them on pid to name blocker and blocked. pg_blocking_pids() does that join for you and is the fastest single call.
- Prevent rather than merely time it better. Set lock_timeout to a second or two on the migration session so the DDL abandons the queue after a bounded wait and is retried, instead of holding it for as long as the oldest transaction lives. Be exact about what that buys: queries arriving during the wait still queue behind the pending ACCESS EXCLUSIVE request, so each attempt costs them up to one lock_timeout of added latency. The outage goes from 40 seconds to about one second per attempt, not to zero. Also run migrations away from deploy-time peaks, and put a statement timeout and an idle-in-transaction timeout on the analytics role that opens the long transactions.
Follow-up
- The same release also wants NOT NULL on that column. What is the sequence that gets there without a long lock?
- Your lock_timeout retry fails ten times in a row because the analytics transaction is always open. What do you change?
Built from the rounds and topics L&T Technology Services candidates report.
Prepare, practise & reflect
One practical outcome each day. Spend longer where you need it.
0 / 7 done01Map the L&T Technology Services loop
- Write out the reported sequence: Online Assessment, Technical Interview Rounds, HR Discussion.
- 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.
02Work C programming
- Spend the session on C programming, which L&T Technology Services candidates report being tested on.
- Write one worked example in C programming and time yourself on it.
Deliverable: One timed worked example in C programming.
03Work Authentication & Authorization
- Spend the session on Authentication & Authorization, which L&T Technology Services candidates report being tested on.
- Write one worked example in Authentication & Authorization and time yourself on it.
Deliverable: One timed worked example in Authentication & Authorization.
04Work AWS (Amazon Web Services)
- Spend the session on AWS (Amazon Web Services), which L&T Technology Services candidates report being tested on.
- Write one worked example in AWS (Amazon Web Services) and time yourself on it.
Deliverable: One timed worked example in AWS (Amazon Web Services).
05Answer out loud: Technical and Domain Knowledge
- Answer aloud, timed: Explain the working principle of a [specific component, e.g., MOSFET, Transformer, or Motor].
- Answer aloud, timed: How do you handle memory management in C or C++?
Deliverable: Spoken answers to 2 reported Technical and Domain Knowledge question(s), under time.
06Answer out loud: Project and Experience Deep-Dive
- Answer aloud, timed: Walk me through your final year project; what was your specific contribution?
- Answer aloud, timed: What were the biggest technical challenges you faced during your project and how did you resolve them?
Deliverable: Spoken answers to 2 reported Project and Experience Deep-Dive question(s), under time.
07Answer out loud: Behavioral and Situational
- Answer aloud, timed: Why do you want to work for L&T Technology Services?
- Answer aloud, timed: How do you handle tight deadlines or conflicting project priorities?
Deliverable: Spoken answers to 2 reported Behavioral and Situational question(s), under time.
Expand any day for tasks and deliverables. Your progress is saved on this device.
Behavioural rounds judge the decision you made and what it cost.
How do you handle memory management in C or C++?
How do you handle memory management in C or C++?
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?
Why do you want to work for L&T Technology Services?
Why do you want to work for L&T Technology Services?
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?
How do you handle tight deadlines or conflicting project priorities?
How do you handle tight deadlines or conflicting project priorities?
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?
Describe a time you had to work with a difficult team member.
Describe a time you had to work with a difficult team member.
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?
Are you willing to relocate for project requirements?
Are you willing to relocate for project requirements?
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?
What are your primary strengths and areas for improvement?
What are your primary strengths and areas for improvement?
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?
- 01
How do you handle memory management in C or C++?
- 02
Why do you want to work for L&T Technology Services?
- 03
How do you handle tight deadlines or conflicting project priorities?
- 04
Describe a time you had to work with a difficult team member.
How long should I prepare for the interview?
A minimum of 2–3 weeks of focused review on your core subjects and projects is recommended. Ensure you are comfortable explaining your resume in detail.
L&T Technology Services Software Engineer candidate reports ↗What differentiates successful candidates?
Successful candidates are those who demonstrate deep conceptual clarity, show a passion for learning, and remain composed when faced with challenging or ambiguous technical questions.
L&T Technology Services Software Engineer candidate reports ↗Is the HR round just a formality?
While the HR round focuses on culture fit and logistics, it is a critical step. Treat it with the same level of professionalism as your technical rounds.
L&T Technology Services Software Engineer candidate reports ↗What is the typical timeline for an offer?
Timelines vary significantly based on project requirements. While some candidates receive feedback within days, it is not uncommon for the process to take several weeks.
L&T Technology Services Software Engineer candidate reports ↗What topics does L&T Technology Services test in interviews?
L&T Technology Services interviews most often cover C Programming, System Design, C programming, Python, and Program Management. The exact emphasis depends on the specific role you apply for.
L&T Technology Services Software Engineer candidate reports ↗Sources & methodology 3 sources ↗
No official company page is cited. Rounds and questions come from candidate reports and PracHub editorial material; each source shows the date it was read.
- 01L&T Technology Services Software Engineer candidate reports ↗
Company-reported rounds, questions and FAQ.
Candidate reports · Accessed 2026-09-22 - 02PracHub Software Engineer practice ↗
PracHub practice material, not company-reported.
PracHub page · Accessed 2026-09-22 - 03PracHub preparation framework ↗
PracHub preparation guidance.
PracHub page · Accessed 2026-09-22
Explore related engineering environments and compare the preparation focus.
Vanguard Software Engineer Interview Guide
What Vanguard asks Software Engineer candidates, from reported rounds and questions.
Unisys Software Engineer Interview Guide
What Unisys asks Software Engineer candidates, from reported rounds and questions.
Trend Micro Software Engineer Interview Guide
What Trend Micro asks Software Engineer candidates, from reported rounds and questions.
Torch technologies Software Engineer Interview Guide
What Torch technologies asks Software Engineer candidates, from reported rounds and questions.