As a Software Engineer at Oxigent Technologies, you sit at the intersection of complex systems architecture and high-precision automation. This role is not merely about writing code; it is about building the robust, scalable foundations that allow Oxigent Technologies to maintain its competitive edge in specialized sectors like robotics, embedded systems, and industrial automation. Your work directly dictates the efficiency and reliability of systems that our clients depend on for mission-critical operations. You will find yourself collaborating with multidisciplinary teams, bridging the gap between hardware integration and software intelligence. Whether you are working on.NET frameworks for robotics, C++ for high-performance embedded systems, or Linux-Yocto environments, your contributions are the engine of our technical roadmap. We look for engineers who are not only technically proficient but also deeply invested in the lifecycle of the product, from initial design to final deployment.
Initial Technical Screen
reportedA preliminary discussion to assess your technical skills and fit for the role.
What to demonstrate
- A preliminary discussion to assess your technical skills and fit for the role
- Depth in .NET
How to prepare
- Answer aloud and timed: How do you handle memory management in C++ for high-performance applications?
- Answer aloud and timed: Describe your experience with.NET frameworks in the context of robotics development.
Technical Lead Discussion
reportedIn-depth conversations with technical leads to explore your expertise and problem-solving abilities.
What to demonstrate
- In-depth conversations with technical leads to explore your expertise and problem-solving abilities
- Depth in .NET
How to prepare
- Answer aloud and timed: Explain your approach to debugging complex Linux-Yocto embedded systems.
- Answer aloud and timed: How do you ensure code maintainability in a large-scale project?
Hiring Manager Interview
reportedA meeting with the hiring manager to evaluate your alignment with project requirements and team culture.
What to demonstrate
- A meeting with the hiring manager to evaluate your alignment with project requirements and team culture
- Depth in .NET
How to prepare
- Prepare two projects you led end to end, each with the decision you owned and what it cost.
- Have three questions about the team's roadmap and how success is measured in the first six months.
PracHub editorial advice for the preparation topics above.
Own your gaps
If you lack experience in a specific area, demonstrate your ability to learn quickly by citing a past project where you had to pick up a new technology under a deadline.
Be specific
When discussing past projects, use the STAR method (Situation, Task, Action, Result) to keep your answers structured and impactful.
Understand the stack
Research the specific requirements of the job title. A Sr.NET Developer will have a very different interview focus than an Ansible Automation Platform Engineer.
Choose a category, try a prompt, then open its approach, worked solution or follow-up when you need it.
Merge partitioned event streams into one ordered feed with bounded lateness
The read-model service consumes 64 log partitions carrying about 4,000 events per second in total. Each partition is ordered within itself, but partitions drift by up to 30 seconds, and the activity feed must present a tenant's events in occurred_at order. Produce the merge. State its complexity, the buffer it requires in events and in bytes, what happens when one partition is idle, and what you do with an event that arrives after you have already emitted its position. Payloads average 1 KB.
Approach
- Merge with a min-heap over the 64 partition heads keyed on (occurred_at, event_id): O(log P) per event and O(n log P) overall. The tie-break on event_id is what makes the output deterministic when two partitions carry the same millisecond, which matters because the feed is paginated and a non-deterministic order reorders pages under the reader.
- Emitting the heap head is only correct once every partition has produced everything up to that timestamp, so the emit condition is a watermark: the minimum across partitions of the highest occurred_at seen, less the allowed lateness. Events are held until the watermark passes them, which is what turns individually ordered streams into a jointly ordered one.
- Size the buffer from the lateness rather than guessing: 4,000 events per second times 30 seconds is 120,000 buffered events, and at 1 KB each about 120 MB of heap. That number is the real price of the ordering guarantee and belongs in front of whoever asked for it.
- Handle the idle partition explicitly, because it fails the feed rather than corrupting it: a partition with no traffic never advances its own maximum, so the watermark freezes and output stops entirely. Either every partition emits a periodic idle marker carrying the broker's current time, or the watermark falls back to wall clock for a partition silent beyond a threshold.
Follow-up
- The lateness budget is raised to five minutes. What is the new buffer, and what besides memory changes?
- The consumer restarts. Where does it resume from, and what does the feed look like for the first 30 seconds?
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?
Find overlapping job attempts and peak concurrency from lease records
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?
Find version gaps and relay lag with window functions
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
- 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.
- 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.
- 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.
- 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?
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?
How do you ensure code maintainability in a large-scale project?
How do you ensure code maintainability in a large-scale project?
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 trade-offs between different communication protocols in automated systems?
What are the trade-offs between different communication protocols in automated 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?
Walk me through how you would architect a software integration for a new automated system.
Walk me through how you would architect a software integration for a new automated system.
Approach
- Fix the scope first: who calls this, how often, and what they do when it fails.
- Name the read and write paths separately; they rarely have the same bottleneck.
- Choose a partition key and say what query it makes expensive.
- State the consistency you need, and where you are willing to be stale.
Follow-up
- What breaks first when traffic grows ten times?
- How does this behave when that dependency is down for an hour?
How do you prioritize technical debt against new feature requests?
How do you prioritize technical debt against new feature requests?
Approach
- Fix the scope first: who calls this, how often, and what they do when it fails.
- Name the read and write paths separately; they rarely have the same bottleneck.
- Choose a partition key and say what query it makes expensive.
- State the consistency you need, and where you are willing to be stale.
Follow-up
- What breaks first when traffic grows ten times?
- How does this behave when that dependency is down for an hour?
How do you approach designing for scalability from day one?
How do you approach designing for scalability from day one?
Approach
- Fix the scope first: who calls this, how often, and what they do when it fails.
- Name the read and write paths separately; they rarely have the same bottleneck.
- Choose a partition key and say what query it makes expensive.
- State the consistency you need, and where you are willing to be stale.
Follow-up
- What breaks first when traffic grows ten times?
- How does this behave when that dependency is down for an hour?
Explain your approach to debugging complex Linux-Yocto embedded systems.
Explain your approach to debugging complex Linux-Yocto embedded systems.
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?
Describe a time you had to troubleshoot a critical production issue under pressure.
Describe a time you had to troubleshoot a critical production issue under pressure.
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?
Built from the rounds and topics Oxigent Technologies candidates report.
Prepare, practise & reflect
One practical outcome each day. Spend longer where you need it.
0 / 7 done01Map the Oxigent Technologies loop
- Write out the reported sequence: Initial Technical Screen, Technical Lead Discussion, Hiring Manager Interview.
- For each round, write one sentence on what it is judging, from the description above, and mark the one you are least ready for.
Deliverable: A one-page map of the 3 reported rounds, with the weakest marked.
02Work .NET
- Spend the session on .NET, which Oxigent Technologies candidates report being tested on.
- Write one worked example in .NET and time yourself on it.
Deliverable: One timed worked example in .NET.
03Work Ansible
- Spend the session on Ansible, which Oxigent Technologies candidates report being tested on.
- Write one worked example in Ansible and time yourself on it.
Deliverable: One timed worked example in Ansible.
04Work C#
- Spend the session on C#, which Oxigent Technologies candidates report being tested on.
- Write one worked example in C# and time yourself on it.
Deliverable: One timed worked example in C#.
05Answer out loud: Technical Proficiency and Domain Knowledge
- Answer aloud, timed: How do you handle memory management in C++ for high-performance applications?
- Answer aloud, timed: Describe your experience with.NET frameworks in the context of robotics development.
Deliverable: Spoken answers to 2 reported Technical Proficiency and Domain Knowledge question(s), under time.
06Answer out loud: Problem-Solving and System Design
- Answer aloud, timed: Walk me through how you would architect a software integration for a new automated system.
- Answer aloud, timed: How do you prioritize technical debt against new feature requests?
Deliverable: Spoken answers to 2 reported Problem-Solving and System Design question(s), under time.
07Answer out loud: Behavioral and Collaborative Dynamics
- Answer aloud, timed: Tell me about a time you had to explain a complex technical concept to a non-technical stakeholder.
- Answer aloud, timed: Describe a situation where you had a technical disagreement with a peer; how was it resolved?
Deliverable: Spoken answers to 2 reported Behavioral and Collaborative Dynamics 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++ for high-performance applications?
How do you handle memory management in C++ for high-performance applications?
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 your experience with.NET frameworks in the context of robotics development.
Describe your experience with.NET frameworks in the context of robotics development.
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?
Tell me about a time you had to explain a complex technical concept to a non-technical stakeholder.
Tell me about a time you had to explain a complex technical concept to a non-technical stakeholder.
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 situation where you had a technical disagreement with a peer; how was it resolved?
Describe a situation where you had a technical disagreement with a peer; how was it resolved?
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 motivates you to stay updated with the latest advancements in software engineering?
What motivates you to stay updated with the latest advancements in software engineering?
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++ for high-performance applications?
- 02
Describe your experience with.NET frameworks in the context of robotics development.
- 03
Tell me about a time you had to explain a complex technical concept to a non-technical stakeholder.
- 04
Describe a situation where you had a technical disagreement with a peer; how was it resolved?
How difficult are the interviews at Oxigent Technologies?
The difficulty is generally considered average, focusing more on practical application and domain expertise than on "gotcha" brain-teasers. If you have solid experience in the required stack, you will find the questions fair and relevant.
Oxigent Technologies Software Engineer candidate reports ↗What is the typical timeline from the first screen to an offer?
Timelines can fluctuate, but we aim for efficiency. You should expect the process to take a few weeks, though delays can happen due to team availability.
Oxigent Technologies Software Engineer candidate reports ↗Is there a specific culture I should be aware of?
We value transparency and directness. We appreciate candidates who are clear about their strengths and areas for growth. Ensure your resume clearly highlights your experience with the specific stack mentioned in the job title (e.g.,.NET vs C++), as our teams are highly specialized.
Oxigent Technologies Software Engineer candidate reports ↗What is the interview process for an Oxigent Technologies Software Engineer role?
The process includes an Initial Technical Screen, a Technical Lead Discussion, and a Hiring Manager Interview. The initial screen is meant to assess your technical skills and fit. The technical lead stage focuses on deeper expertise and problem-solving, and the hiring manager stage evaluates alignment with project requirements and team culture.
Oxigent Technologies Software Engineer candidate reports ↗What topics does Oxigent Technologies test for Software Engineer interviews?
A top tested topic called out for Oxigent Technologies is.NET. The interview categories also emphasize technical proficiency and domain knowledge, especially your ability to explain relevant stack choices and architectural patterns. You should be ready for problem-solving and system design discussions, plus behavioral questions.
Oxigent Technologies Software Engineer candidate reports ↗What kinds of questions do candidates get asked at Oxigent Technologies for Software Engineer interviews?
Public sample questions include explaining a technical concept clearly and handling a critical production incident. The broader categories also include how you would structure your thinking for system design problems and how you communicate with non-technical stakeholders. Expect prompts that ask for your approach and reasoning, not only final answers.
Oxigent Technologies Software Engineer candidate reports ↗What should I prioritize when preparing for an Oxigent Technologies Software Engineer interview?
Prioritize demonstrating your thought process with clear, structured explanations, since that is explicitly emphasized. Be ready to discuss the nuances and trade-offs behind your design choices, especially related to.NET and system integration work. Also practice decomposing large or ambiguous problems and communicating limitations honestly while explaining how you would find the answer.
Oxigent Technologies 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.
- 01Oxigent Technologies 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.
Cognition Software Engineer Interview Guide
What Cognition asks Software Engineer candidates, from reported rounds and questions.
Discord Software Engineer Interview Guide
Database practice for Discord candidates: how an index changes a query plan, and which anomalies survive a given isolation level, since read committed still permits non-repeatable reads.
CoreWeave Software Engineer Interview Guide
Failure-handling practice for CoreWeave software engineer candidates: requests whose outcome a timeout leaves unknown, where a retry is safe, and deduplicating at the receiver instead of assuming exactly-once delivery.
Aerospike Software Engineer Interview Questions & Guide 2026
Aerospike database-engine preparation through an original single-owner Python key-value store with bounded logical index accounting, disk-offset reads, conditional writes, tombstones, process-restart recovery and 3,240 checks. Existing 14 p