Lps Software Engineer Interview Guide

The 60-second brief

A Software Engineer at Lps plays a critical role in delivering high-quality, scalable, and robust software solutions that power business operations for both internal projects and major external clients. Because Lps frequently partners with prominent technology solutions providers and enterprise clients, engineers here do not work in a silo. Instead, you will build, integrate, and optimize applications that directly impact regional digital transformations, making your technical adaptability and client-facing professionalism highly valuable. The work spans the entire software development lifecycle, from initial requirement gathering and system design to hands-on deployment and infrastructure support. Depending on your team alignment, you may find yourself developing modern web applications, optimizing database queries, or managing complex system integrations.

This guide is scoped to a Software Engineer candidate at Lps.

Focus areas

• Windows Server Administration
• Software Engineering
• Hands-On Troubleshooting

The Lps interview process

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

HR Screening Call

Brief call to verify background and discuss the role's requirements.

What to demonstrate

• Brief call to verify background and discuss the role's requirements
• Depth in Windows Server Administration

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 and Managerial Interview

Practical interview focusing on direct experience, CV, and readiness for job duties.

What to demonstrate

• Practical interview focusing on direct experience, CV, and readiness for job duties
• Depth in Windows Server Administration

How to prepare

• Answer aloud and timed: Tell me about a challenging technical problem you faced in your previous job. How did you identify the root cause, and what was your solution?
• Answer aloud and timed: Describe your experience with full-stack development. What technologies are you most comfortable with, and are you willing to learn a new programming language if a project requires it?

Assessment Center (Optional)

Full-day assessment including written tests, group discussions, and direct interviews.

What to demonstrate

• Full-day assessment including written tests, group discussions, and direct interviews
• Depth in Windows Server Administration

How to prepare

• Answer aloud and timed: Walk me through the fundamentals of Active Directory administration and how you manage user permissions.
• Answer aloud and timed: What is your experience with virtualization technologies? How do you configure and manage virtual machines in a production environment?

Final Round with Client Manager (Optional)

Final interview to ensure alignment for roles involving direct client deployment.

What to demonstrate

• Final interview to ensure alignment for roles involving direct client deployment
• Depth in Windows Server Administration

How to prepare

• Answer aloud and timed: How do you approach hands-on troubleshooting for a Windows Server instance that has suddenly become unresponsive?
• Answer aloud and timed: Describe a scenario where a system integration failed. What steps did you take to isolate the issue between the network, server, and application layers?

Where candidates lose points

Highlight your adaptability

Make sure to explicitly mention your willingness to learn new programming languages and frameworks. At Lps, project requirements change, and managers highly value engineers who are not afraid to step out of their comfort zone.

Be ready for client-facing questions

Since you may represent the company at client sites, present yourself professionally, speak clearly, and emphasize your communication skills.

Arguing past a hint

When the interviewer asks what happens for a particular input or floats a different data structure, stop and take it seriously; it is almost always a correction rather than idle curiosity. Talking over it converts a recoverable wrong turn into a data point about how you handle review.

Questions & practice

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?

Canonicalise a request body into a stable idempotency fingerprint

Medium · parsing · canonicalisation · hashing

idempotency_key.request_fingerprint is a SHA-256 over the method, path and canonicalised body, and a retry whose fingerprint differs must be rejected with 422 rather than served the stored response. Write the canonicaliser. Bodies are JSON up to 256 KB nested at most 32 levels; clients vary key order, whitespace and unicode escaping, and some send 64-bit ids as JSON numbers. Produce a deterministic byte string such that semantically identical bodies match and any semantic difference does not. State your complexity and name two normalisations you refuse to perform.

Approach

1. Parse once into a tree, then re-serialise under fixed rules: object keys sorted, array order preserved, one escaping convention, no insignificant whitespace. Parsing is O(n) and sorting keys is O(k log k) per object, so O(n log n) overall with O(depth) stack, and the 32-level cap is enforced during parsing because hostile nesting is how a canonicaliser becomes a stack overflow.
2. Sort keys by their UTF-8 bytes and say why the obvious implementation is wrong in some runtimes: a default string comparison that orders by UTF-16 code units places surrogate pairs, meaning code points from U+10000 up, below U+E000 to U+FFFF, which is not UTF-8 byte order, so two services written in different languages disagree on the same document.
3. Do not re-encode numbers through a double. IEEE-754 binary64 represents integers exactly only up to 2^53, so normalising a 19-digit id through a float changes it, and 1 against 1.0 cannot be reconciled without deciding whether they are the same value. Preserve the literal token, and require ids as strings at the API boundary if you want them comparable.
4. Reject duplicate keys rather than picking one. JSON permits them and parsers disagree, most keeping the last, so any choice you make ties the fingerprint to a parser detail that the code handling the request does not necessarily share.

Follow-up

• A client sends the same logical request with an extra field your API ignores. Same key, different fingerprint, so you return 422. Is that the right answer?
• Where does the fingerprint get computed relative to request decompression and the body-size limit?

Track a rolling failure rate per destination for circuit decisions

Easy · sliding window · ring buffer · circuit breaker

The egress service delivers about 1,500 webhooks per second across roughly 40,000 destinations, each call bounded by a 10 second timeout. Maintain, per destination, the failure rate over the trailing 60 seconds so a caller can ask before dispatch whether the circuit should open. Attempts arrive as (destination_id, finished_at_ms, outcome). Requirement: amortised O(1) per attempt, with total memory bounded by the destination count rather than by traffic. Give the structure, its exact memory, and the rule that stops a destination with three attempts from opening a circuit.

Approach

1. Name the exact-deque version and then reject it as the default. Holding timestamps and advancing a tail pointer past anything older than now minus 60 seconds is a correct two-pointer window at amortised O(1) per attempt, but its memory tracks in-window traffic, so one destination in a retry storm holds hundreds of thousands of entries while thousands of quiet destinations hold none.
2. Use a ring of 60 one-second buckets per destination, each bucket a pair of counters for attempts and failures. On an attempt, advance the ring by the elapsed whole seconds, zeroing at most min(elapsed, 60) buckets, then increment the head. That is amortised O(1) with a fixed footprint per destination.
3. State the footprint: 60 buckets times two 4-byte counters is 480 bytes of payload per destination, so 40,000 destinations is roughly 20 to 25 MB with per-entry overhead, bounded by the catalogue rather than by the rate. The cost is granularity, since the oldest bucket ages out in whole seconds, which is far tighter than the decision needs.
4. Require a minimum sample before the circuit may open. A destination with three attempts and three failures reads as 100 percent and is not evidence; a floor of roughly 20 attempts in the window makes the ratio meaningful, and below that floor use a run of consecutive failures as the trigger instead.

Follow-up

• The fleet is 30 instances and each sees roughly a thirtieth of a destination's traffic. Where does the rate actually live, and what does a per-instance answer get wrong?
• A destination answers in 9.5 seconds and succeeds. It is not failing but it is consuming your per-destination concurrency. What signal should open the circuit here?

Why do you want to join Lps, and how do you feel about working closely with external client teams?

Medium · Behavioral & Professional Adaptability

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?

Denormalise tenant onto revisions and backfill it live

Hard · denormalisation · online migration · backfill

resource_revision (revision_id, resource_id, version, actor_user_id, change_kind, patch, request_id, created_at) has 400M rows and no tenant column; tenant_id lives only on resource. Two reads need it: a tenant-scoped audit feed ordered by created_at DESC, and an offboarding purge. Both join back to resource today. Justify adding tenant_id to resource_revision against those two reads, name the anomaly the copy introduces and the constraint that prevents it, then give the ordered migration for a live table taking 1.2k writes/second — the lock each step takes, how the backfill is batched, and where each step stops being reversible. PostgreSQL 16.

Approach

1. Justify from the access path rather than from taste. Without the column, the audit feed either scans resource_revision by created_at and discards other tenants' rows, or resolves the tenant's resource_ids first and probes with them — both proportional to the tenant's whole history rather than to one page. With (tenant_id, created_at DESC, revision_id DESC) it is a seek that stops at 50 rows, and the purge becomes a ranged delete instead of a join.
2. Name the cost exactly: a second copy of a fact can disagree with the first. Make the disagreement unwritable rather than documented — add UNIQUE (resource_id, tenant_id) on resource so it can serve as a foreign-key target, then FOREIGN KEY (resource_id, tenant_id) REFERENCES resource (resource_id, tenant_id) on the revision table. A revision can then only ever carry its parent's tenant.
3. Step one, expand: ALTER TABLE resource_revision ADD COLUMN tenant_id BIGINT NULL, with no default, so it is a catalogue change and no rewrite. It still needs ACCESS EXCLUSIVE for an instant, and that instant queues behind the longest open transaction on the table while every later query queues behind it — set lock_timeout to 2s and retry rather than wait.
4. Step two, dual-write: deploy the writer that populates tenant_id on every new revision while reads still use the join. Reversible by redeploying the previous build, because nothing reads the column yet.

Follow-up

• The backfill is half finished and a rollback is required. What state is the table in, and what does the previous build do with a half-populated column?
• How do you verify the backfill actually finished, given rows are still being inserted while it runs?

Describe a scenario where a system integration failed. What steps did you take to isolate the issue between th

Medium · Infrastructure, Systems & Troubleshootin

Describe a scenario where a system integration failed. What steps did you take to isolate the issue between the network, server, and application layers?

Approach

1. Say who the caller is and what they do when the call fails halfway.
2. Define the identity of a request so a retry cannot double-apply it.
3. Separate accepted, pending, failed and confirmed; they are different facts.
4. 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?

Publish rate-limit and deadline semantics the edge actually enforces

Easy · rate limiting · backpressure · retries

The edge API serves about 3k requests/second steady and 9k at peak against a 400 ms p99 budget, with an explicit bounded concurrency limit per instance. Limits exist per principal and per tenant. Callers are a partner integration running nightly bulk loads and a browser app. Specify the counting algorithm and window, which limit a request is charged against, the headers a well-behaved client reads, the status and body when a limit is hit, how that differs from the response when an instance is shedding load, and what each caller does with each.

Approach

1. Choose the counter and name its failure mode. Fixed windows admit nearly twice the limit across a boundary - a full burst at the end of one window and another at the start of the next. A token bucket states sustained rate and burst separately, which is exactly what a nightly bulk load needs. A sliding-window counter is more faithful and costs more state per key. State the choice and the burst it permits.
2. Charge each request against both keys and reject on the stricter. The tenant limit protects the shared primary, which absorbs roughly 1.2k writes/second in total; the per-principal limit stops one credential inside a tenant from consuming that tenant's whole allowance. The tenant is the fairness unit for the same reason it is the leading column of every index.
3. Advertise limit, remaining and reset for the binding key on every response, not only on rejections, so a client can pace before it is refused. Pick one naming scheme - the RateLimit-* draft fields or an X-prefixed set - document the units, and never change them afterwards.
4. Separate two rejections that look identical to a naive client. 429 means this caller exceeded its own share and Retry-After is a real schedule it should obey. 503 means the instance is at its concurrency bound and shedding, which is a statement about the server; a fleet-wide 503 retried on a fixed delay resynchronises every client into one stampede, so full jitter is mandatory there and the delay is the client's guess, not ours.

Follow-up

• One tenant stays under its limit and still degrades everyone else during a backfill. What changes - the limiter, the worker concurrency caps, or both?
• How are counters kept correct across 20 to 40 stateless instances, and what does your answer cost per request?

What logging tools have you used in your previous projects, and how do you leverage logs to diagnose productio

Medium · Core Software Engineering & Tooling

What logging tools have you used in your previous projects, and how do you leverage logs to diagnose production issues?

Approach

1. Establish what changed and when, before forming any theory.
2. Pick a bisection that eliminates candidates whichever way it turns out.
3. Check the instrumentation before believing the symptom.
4. 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?

Walk me through the fundamentals of Active Directory administration and how you manage user permissions.

Medium · Infrastructure, Systems & Troubleshootin

Approach

1. Establish what changed and when, before forming any theory.
2. Pick a bisection that eliminates candidates whichever way it turns out.
3. Check the instrumentation before believing the symptom.
4. 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?

How do you approach hands-on troubleshooting for a Windows Server instance that has suddenly become unresponsi

Medium · Infrastructure, Systems & Troubleshootin

How do you approach hands-on troubleshooting for a Windows Server instance that has suddenly become unresponsive?

Approach

1. Establish what changed and when, before forming any theory.
2. Pick a bisection that eliminates candidates whichever way it turns out.
3. Check the instrumentation before believing the symptom.
4. 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 Lps candidates report.

Day 1 — Map the Lps loop

• Write out the reported sequence: HR Screening Call, Technical and Managerial Interview, Assessment Center (Optional), Final Round with Client Manager (Optional).
• 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 4 reported rounds, with the weakest marked.

Day 2 — Work Windows Server Administration

• Spend the session on Windows Server Administration, which Lps candidates report being tested on.
• Write one worked example in Windows Server Administration and time yourself on it.

Deliverable: One timed worked example in Windows Server Administration.

Day 3 — Work Software Engineering

• Spend the session on Software Engineering, which Lps candidates report being tested on.
• Write one worked example in Software Engineering and time yourself on it.

Deliverable: One timed worked example in Software Engineering.

Day 4 — Work Hands-On Troubleshooting

• Spend the session on Hands-On Troubleshooting, which Lps candidates report being tested on.
• Write one worked example in Hands-On Troubleshooting and time yourself on it.

Deliverable: One timed worked example in Hands-On Troubleshooting.

Day 5 — Answer out loud: Core Software Engineering & Tooling

• Answer aloud, timed: Explain your typical workflow for version control. How do you handle merge conflicts in a shared repository?
• Answer aloud, timed: What logging tools have you used in your previous projects, and how do you leverage logs to diagnose production issues?

Deliverable: Spoken answers to 2 reported Core Software Engineering & Tooling question(s), under time.

Day 6 — Answer out loud: Infrastructure, Systems & Troubleshooting

• Answer aloud, timed: Walk me through the fundamentals of Active Directory administration and how you manage user permissions.
• Answer aloud, timed: What is your experience with virtualization technologies? How do you configure and manage virtual machines in a production environment?

Deliverable: Spoken answers to 2 reported Infrastructure, Systems & Troubleshooting question(s), under time.

Day 7 — Answer out loud: Behavioral & Professional Adaptability

• Answer aloud, timed: Why do you want to join Lps, and how do you feel about working closely with external client teams?
• Answer aloud, timed: Describe a time when you had to explain a complex technical concept to a non-technical stakeholder or client.

Deliverable: Spoken answers to 2 reported Behavioral & Professional Adaptability question(s), under time.

Behavioural preparation

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

Explain your typical workflow for version control. How do you handle merge conflicts in a shared repository?

Medium · Core Software Engineering & Tooling

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 challenging technical problem you faced in your previous job. How did you identify the root ca

Medium · Core Software Engineering & Tooling

Tell me about a challenging technical problem you faced in your previous job. How did you identify the root cause, and what was your solution?

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?

Describe your experience with full-stack development. What technologies are you most comfortable with, and are

Medium · Core Software Engineering & Tooling

Describe your experience with full-stack development. What technologies are you most comfortable with, and are you willing to learn a new programming language if a project requires it?

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 is your experience with virtualization technologies? How do you configure and manage virtual machines in

Medium · Infrastructure, Systems & Troubleshootin

What is your experience with virtualization technologies? How do you configure and manage virtual machines in a production environment?

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?

Describe a time when you had to explain a complex technical concept to a non-technical stakeholder or client.

Medium · Behavioral & Professional Adaptability

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 do you manage your workload and prioritize tasks when working on a project with tight deadlines and shifti

Medium · Behavioral & Professional Adaptability

How do you manage your workload and prioritize tasks when working on a project with tight deadlines and shifting requirements?

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?

Walk me through your Final Year Project (FYP) or a recent major project. What was your individual contribution

Medium · Behavioral & Professional Adaptability

Walk me through your Final Year Project (FYP) or a recent major project. What was your individual contribution, and what would you do differently today?

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?