cswork / libraryOpen practice workspace

Interview guides · Technical Support Group

Technical Support Group Software Engineer Interview Guide

Technical Support Group Software Engineer interview guide: reported rounds, questions and how candidates describe the process.

The 60-second brief

At Technical Support Group, the Software Engineer role is central to maintaining the technical integrity and operational efficiency of our diverse industrial and automated systems. You are not just writing code; you are building the connective tissue between complex hardware and the software architectures that keep our clients' operations running at peak performance. This role requires a unique blend of high-level programming logic and a deep understanding of physical systems. Whether you are working on Process Control Engineering, Maintenance & Reliability initiatives, or Computer Numerical Control (CNC) programming, your work directly influences the safety, speed, and output quality of critical infrastructure. You will be expected to bridge the gap between theoretical software solutions and the reality of field-based technical environments.

This guide is scoped to a Software Engineer candidate at Technical Support Group.

Focus areas

  • Process Control Engineering
  • Computer Numerical Control (CNC)
  • Maintenance & Reliability Engineering

The Technical Support Group interview process

Technical Support Group candidates report 5 rounds over 4-6 weeks. The stages below are what candidates describe, not a published process.

Initial Application

Submit your application to begin the interview process.

What to demonstrate

  • Submit your application to begin the interview process
  • Depth in Process Control Engineering

How to prepare

  • Answer aloud and timed: Describe a time you had to troubleshoot a failure in a live production environment.
  • Answer aloud and timed: How do you ensure your code remains maintainable when integrated with legacy hardware?

Technical Screening

Engage in initial technical screenings to assess your foundational knowledge.

What to demonstrate

  • Engage in initial technical screenings to assess your foundational knowledge
  • Depth in Process Control Engineering

How to prepare

  • Answer aloud and timed: Explain your approach to optimizing a control loop or an automated process.
  • Answer aloud and timed: What specific programming languages or frameworks do you leverage to interface with hardware controllers?

Deep-Dive Sessions

Participate in in-depth discussions with senior engineering leadership.

What to demonstrate

  • Participate in in-depth discussions with senior engineering leadership
  • Depth in Process Control Engineering

How to prepare

  • Answer aloud and timed: How do you handle signal noise or data inconsistencies in a real-time system?
  • Answer aloud and timed: Walk me through your process for performing a root-cause analysis on a recurring system error.

Behavioral Discussions

Discuss your experiences and how they align with team values.

What to demonstrate

  • Discuss your experiences and how they align with team values
  • Depth in Process Control Engineering

How to prepare

  • Prepare three examples from your own work, each with a decision you made and an outcome you can quantify.
  • Re-read the description of the behavioral discussions above and write down what you would ask to confirm before it.

Final Assessment

Complete the final assessment to evaluate your overall fit and technical skills.

What to demonstrate

  • Complete the final assessment to evaluate your overall fit and technical skills
  • Depth in Process Control Engineering

How to prepare

  • Work Process Control Engineering until you can explain it without notes
  • Work Computer Numerical Control (CNC) until you can explain it without notes

Where candidates lose points

Prepare for ambiguity

In industrial environments, you won't always have perfect data. Practice explaining how you make decisions when information is incomplete.

Know your resume

Be ready to talk about every project you list in detail. If you mention a specific tool or language, be prepared to discuss its pros and cons.

Focus on safety

When discussing your work, always keep safety and system integrity at the forefront. It is a core value at Technical Support Group.

Ask meaningful questions

Use your time at the end of the interview to ask about current team challenges or how the company approaches new technology adoption.

Questions & practice

Walk me through your process for performing a root-cause analysis on a recurring system error.

Medium · Problem Solving & Methodology

Approach

  1. Restate the input: its shape, its size, and what is guaranteed about it.
  2. Name the brute-force solution and its complexity before improving on it.
  3. Choose the data structure from the access pattern, not from familiarity.
  4. State the target complexity and say which constraint rules the naive version out.

Follow-up

  • How does this change if the input no longer fits in memory?
  • What is the worst case, and how likely is it on real data?

How do you prioritize tasks when you have multiple critical systems requiring maintenance simultaneously?

Medium · Problem Solving & Methodology

Approach

  1. Restate the input: its shape, its size, and what is guaranteed about it.
  2. Name the brute-force solution and its complexity before improving on it.
  3. Choose the data structure from the access pattern, not from familiarity.
  4. State the target complexity and say which constraint rules the naive version out.

Follow-up

  • How does this change if the input no longer fits in memory?
  • What is the worst case, and how likely is it on real data?

Describe a situation where you had to learn a new technology or tool on the fly to solve a project blocker.

Medium · Problem Solving & Methodology

Approach

  1. Restate the input: its shape, its size, and what is guaranteed about it.
  2. Name the brute-force solution and its complexity before improving on it.
  3. Choose the data structure from the access pattern, not from familiarity.
  4. State the target complexity and say which constraint rules the naive version out.

Follow-up

  • How does this change if the input no longer fits in memory?
  • What is the worst case, and how likely is it on real data?

Find version gaps and relay lag with window functions

Medium · window functions · event tables · frame semantics

outbox_event holds event_id, aggregate_type, aggregate_id, aggregate_version, event_type, payload, status ('pending','published','dead'), attempts, created_at, published_at. A projection is missing rows and you must decide whether the relay skipped events or the consumer dropped them. Write three queries over the last seven days: one listing every aggregate_id whose published aggregate_version sequence has a hole, one giving per-day counts with a running total, and one returning the newest published event per aggregate. For each, say where the window function is evaluated relative to WHERE and LIMIT. PostgreSQL 16.

Approach

  1. Gaps: compute lead(aggregate_version) OVER (PARTITION BY aggregate_id ORDER BY aggregate_version) in a subquery, then filter next_version <> aggregate_version + 1 in the outer query. Window functions are evaluated after WHERE, GROUP BY and HAVING and before the outer ORDER BY and LIMIT, so the predicate cannot sit in the same WHERE clause and PostgreSQL 16 has no QUALIFY.
  2. Say what the seven-day filter does to the answer: it truncates every partition, so the first row per aggregate has no predecessor inside the window and a hole spanning the boundary is invisible. Widen the window, or join to resource.version as the authority for the true maximum.
  3. Running total: SELECT date_trunc('day', created_at) AS d, count() AS n, sum(count()) OVER (ORDER BY date_trunc('day', created_at) ROWS UNBOUNDED PRECEDING). An aggregate inside a window call is legal because grouping runs before windowing. The grouping key is unique per row here so ROWS and RANGE agree, but write the frame anyway — over ungrouped rows with tied timestamps the default RANGE frame pulls in every peer row and the total jumps.
  4. Newest per aggregate: DISTINCT ON (aggregate_id) ... ORDER BY aggregate_id, aggregate_version DESC is the cheap PostgreSQL-only form when an index matches that order; row_number() OVER (PARTITION BY aggregate_id ORDER BY aggregate_version DESC) = 1 is the portable form and needs a subquery for the same evaluation-order reason as the gap query.

Follow-up

  • Relay failover redelivers events. Does a duplicate break the gap query, and how would you detect one from this table alone?
  • Turn the gap check into a continuous monitor rather than a query someone runs after an incident. What does it watch?

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?

How do you ensure your code remains maintainable when integrated with legacy hardware?

Medium · Technical & Domain Knowledge

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?

Explain your approach to optimizing a control loop or an automated process.

Medium · Technical & Domain Knowledge

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 programming languages or frameworks do you leverage to interface with hardware controllers?

Medium · Technical & Domain Knowledge

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?

Read latency spikes on a sixty-second sawtooth

Medium · cache stampede · single-flight · ttl

The cached listing read path serves about 14k reads/second at an 85% hit rate. p99 sits at 35 ms for 57 seconds, jumps to 900 ms for 3, and repeats. During each spike the primary shows several hundred identical listing queries starting within the same millisecond, all carrying one large tenant's id. Cache entries use a 60-second TTL. Give the mechanism, the ordered checks, the fix, and the correctness hazard your fix must not introduce.

Approach

  1. Match the period to a configured number before theorising about load. A spike every 60 seconds against a 60-second TTL is an entry expiring, and you confirm it by correlating spike timestamps with the entry's write time rather than with the traffic curve. If the period had matched a cron or a GC interval instead, this is a different investigation.
  2. Establish the concurrency of the miss. Several hundred identical queries in one millisecond means the miss path has no coalescing: every request that arrives between expiry and repopulation recomputes. The herd size is that key's arrival rate times its recompute time, so at 1.2k reads/second for the hot key and a 250 ms recompute you expect about 300 concurrent misses, which matches what is observed.
  3. Add single-flight on the miss path so one caller per key recomputes under a short-lived lock while the rest wait for its result. Prefer stale-while-revalidate where the read tolerates it: return the expired value immediately and refresh asynchronously, which removes the latency spike rather than serialising it into a queue of waiters.
  4. De-synchronise the keys. Write TTLs with jitter, for example 60 seconds plus or minus 10%, so a deploy or a mass invalidation does not align every key on the same second and turn a per-key herd into a fleet-wide one.

Follow-up

  • The same sawtooth appears on a key that is invalidated on write rather than expired. Is that the same bug?
  • How does your answer change if the recompute takes 4 seconds instead of 250 ms?

Suggested practice checklist

Built from the rounds and topics Technical Support Group candidates report.

Day 1 — Map the Technical Support Group loop

  • Write out the reported sequence: Initial Application, Technical Screening, Deep-Dive Sessions, Behavioral Discussions, Final Assessment.
  • 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 Process Control Engineering

  • Spend the session on Process Control Engineering, which Technical Support Group candidates report being tested on.
  • Write one worked example in Process Control Engineering and time yourself on it.

Deliverable: One timed worked example in Process Control Engineering.

Day 3 — Work Computer Numerical Control (CNC)

  • Spend the session on Computer Numerical Control (CNC), which Technical Support Group candidates report being tested on.
  • Write one worked example in Computer Numerical Control (CNC) and time yourself on it.

Deliverable: One timed worked example in Computer Numerical Control (CNC).

Day 4 — Work Maintenance & Reliability Engineering

  • Spend the session on Maintenance & Reliability Engineering, which Technical Support Group candidates report being tested on.
  • Write one worked example in Maintenance & Reliability Engineering and time yourself on it.

Deliverable: One timed worked example in Maintenance & Reliability Engineering.

Day 5 — Answer out loud: Technical & Domain Knowledge

  • Answer aloud, timed: Describe a time you had to troubleshoot a failure in a live production environment.
  • Answer aloud, timed: How do you ensure your code remains maintainable when integrated with legacy hardware?

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

Day 6 — Answer out loud: Problem Solving & Methodology

  • Answer aloud, timed: Walk me through your process for performing a root-cause analysis on a recurring system error.
  • Answer aloud, timed: How do you prioritize tasks when you have multiple critical systems requiring maintenance simultaneously?

Deliverable: Spoken answers to 2 reported Problem Solving & Methodology question(s), under time.

Day 7 — Dry run for Technical Support Group

  • 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.

Describe a time you had to troubleshoot a failure in a live production environment.

Medium · Technical & Domain Knowledge

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 handle signal noise or data inconsistencies in a real-time system?

Medium · Technical & Domain Knowledge

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?

Estimate work you have never done and defend the range

Hard · estimation · backfills · expand-contract

You are asked to estimate a change you have never attempted: add a column to a 100-million-row table, populate it, move reads across, and drop the old shape. Give a range with the assumptions that generate it, including batch size, the signal your backfill throttles on, and wall-clock hours, and name the three unknowns that would move the number most. Then describe a real estimate you gave under comparable ignorance: how you expressed its uncertainty, what you committed to, and how wrong you turned out to be.

Approach

  1. Decompose into independently deployable steps before estimating anything: add the column nullable, write both shapes, backfill in batches, verify, move reads, stop writing the old shape, drop it. That is four deploys spread over days, and the calendar estimate is dominated by them rather than by the loop's runtime.
  2. Do the arithmetic aloud for the part that has arithmetic in it: batch size times number of batches times per-batch duration, at a write rate the primary can absorb alongside roughly 1.2k writes per second of production traffic. The loop is throttled by replication lag and lock waits, not by how fast it can issue statements.
  3. Price the schema step by its lock rather than its statement duration. In PostgreSQL an ALTER TABLE taking ACCESS EXCLUSIVE waits for every open transaction on that table while later queries queue behind it, so a millisecond change issued during a thirty-second analytics query stalls that table for thirty seconds. Adding a nullable column with a non-volatile default avoids a rewrite from version 11; a new index wants CREATE INDEX CONCURRENTLY, which cannot run inside a transaction block and leaves an invalid index behind if it fails.
  4. Express the answer as a range whose endpoints each trace to a stated assumption, then name the cheapest experiment that collapses it, which is almost always running one real batch against the real table and multiplying.

Follow-up

  • How do you verify the backfill genuinely finished, given rows written by production traffic while it ran?
  • Where does the backfill resume from after a worker is killed mid-batch, and what makes that resume point trustworthy?