A Software Engineer at GadgEon is at the heart of the company’s mission to deliver innovative, high-impact digital solutions. As an Internet of Things (IoT) and digital transformation-focused organization, the role requires engineers who are not just coders but problem solvers capable of navigating the intersection of hardware, cloud infrastructure, and software applications. You will be instrumental in building robust systems, contributing to products like WebCardio, and driving technological advancements that directly influence client outcomes. The work environment at GadgEon is fast-paced and intellectually demanding. You will often find yourself working on cross-functional teams where your ability to translate complex business requirements into scalable code is paramount. Whether you are working on backend services, embedded systems, or full-stack web applications, the impact of your work is visible, tangible, and critical to the company’s strategic goals.
Initial Screening
reportedThe first step where candidates are evaluated based on their resumes and initial qualifications.
What to demonstrate
- The first step where candidates are evaluated based on their resumes and initial qualifications
- Depth in Java
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 Evaluations
reportedDeep-dive assessments that include written tests, live coding, and scenario-based discussions.
What to demonstrate
- Deep-dive assessments that include written tests, live coding, and scenario-based discussions
- Depth in Java
How to prepare
- Answer aloud and timed: How do you calculate the time complexity of a binary search?
- Answer aloud and timed: What is the difference between black box and white box testing?
Managerial Discussion
reportedA conversation with management to assess fit within the team and company culture.
What to demonstrate
- A conversation with management to assess fit within the team and company culture
- Depth in Java
How to prepare
- Answer aloud and timed: Explain the use of the static keyword in C.
- Answer aloud and timed: Walk me through your final-year project and its technical relevance.
HR Discussion
reportedFinal discussions with HR regarding company policies, benefits, and offer details.
What to demonstrate
- Final discussions with HR regarding company policies, benefits, and offer details
- Depth in Java
How to prepare
- Answer aloud and timed: Describe a security vulnerability you identified in one of your personal projects.
- Answer aloud and timed: How did you handle API documentation and deployment for your recent project?
PracHub editorial advice for the preparation topics above.
Own your resume
If it is on your resume, it is fair game for a technical deep-dive. Be ready to explain the "how" and "why" of every project.
Master the basics
Do not overlook core subjects like Operating Systems, Networking, and DBMS. These are frequent topics in our technical rounds.
Be professional
Even in remote settings, maintain a professional demeanor. Punctuality and clear communication are highly valued at GadgEon.
Ask questions
Use the time at the end of the interview to ask thoughtful questions about the team, the technology stack, or the company’s product roadmap.
Choose a category, try a prompt, then open its approach, worked solution or follow-up when you need it.
How do you calculate the time complexity of a binary search?
How do you calculate the time complexity of a binary search?
Approach
- Restate the input: its shape, its size, and what is guaranteed about it.
- Name the brute-force solution and its complexity before improving on it.
- Choose the data structure from the access pattern, not from familiarity.
- 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?
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?
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?
Denormalise tenant onto revisions and backfill it live
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
- 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.
- 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.
- 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.
- 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?
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 ACID properties of a database.
Explain the ACID properties of a database.
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 is the difference between a microprocessor and a microcontroller?
What is the difference between a microprocessor and a microcontroller?
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 is the difference between black box and white box testing?
What is the difference between black box and white box testing?
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 the use of the static keyword in C.
Explain the use of the static keyword in C.
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 and its technical relevance.
Walk me through your final-year project and its technical relevance.
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?
Describe a security vulnerability you identified in one of your personal projects.
Describe a security vulnerability you identified in one of your personal projects.
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 handle API documentation and deployment for your recent project?
How did you handle API documentation and deployment for your recent project?
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?
Explain the system architecture of the project listed on your resume.
Explain the system architecture of the project listed on your resume.
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?
Debugging scenario: How would you troubleshoot an I2C circuit with a sensor that is not responding?
Debugging scenario: How would you troubleshoot an I2C circuit with a sensor that is not responding?
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 GadgEon candidates report.
Prepare, practise & reflect
One practical outcome each day. Spend longer where you need it.
0 / 7 done01Map the GadgEon loop
- Write out the reported sequence: Initial Screening, Technical Evaluations, Managerial Discussion, 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 4 reported rounds, with the weakest marked.
02Work Java
- Spend the session on Java, which GadgEon candidates report being tested on.
- Write one worked example in Java and time yourself on it.
Deliverable: One timed worked example in Java.
03Work IoT (Internet of Things)
- Spend the session on IoT (Internet of Things), which GadgEon candidates report being tested on.
- Write one worked example in IoT (Internet of Things) and time yourself on it.
Deliverable: One timed worked example in IoT (Internet of Things).
04Work Data Structures & Algorithms (DSA/DS)
- Spend the session on Data Structures & Algorithms (DSA/DS), which GadgEon candidates report being tested on.
- Write one worked example in Data Structures & Algorithms (DSA/DS) and time yourself on it.
Deliverable: One timed worked example in Data Structures & Algorithms (DSA/DS).
05Answer out loud: Technical & Core Computer Science
- Answer aloud, timed: Explain the ACID properties of a database.
- Answer aloud, timed: What is the difference between a microprocessor and a microcontroller?
Deliverable: Spoken answers to 2 reported Technical & Core Computer Science question(s), under time.
06Answer out loud: Project-Based & Domain Expertise
- Answer aloud, timed: Walk me through your final-year project and its technical relevance.
- Answer aloud, timed: Describe a security vulnerability you identified in one of your personal projects.
Deliverable: Spoken answers to 2 reported Project-Based & Domain Expertise question(s), under time.
07Answer out loud: Behavioral & Leadership
- Answer aloud, timed: Tell me about yourself in brief.
- Answer aloud, timed: How do you handle ambiguity when given a complex technical requirement?
Deliverable: Spoken answers to 2 reported Behavioral & Leadership 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.
Tell me about yourself in brief.
Tell me about yourself in brief.
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 ambiguity when given a complex technical requirement?
How do you handle ambiguity when given a complex technical requirement?
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 explain a technical concept to a non-technical stakeholder.
Describe a time you had to explain a 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?
- 01
Tell me about yourself in brief.
- 02
How do you handle ambiguity when given a complex technical requirement?
- 03
Describe a time you had to explain a technical concept to a non-technical stakeholder.
How long should I spend preparing?
Preparation time varies, but we recommend at least 1–2 weeks of focused review on your core technical stack and a deep revisit of your past projects.
GadgEon Software Engineer candidate reports ↗What differentiates a successful candidate?
Successful candidates don't just solve the problem; they explain their approach, consider scalability, and show a genuine interest in the specific domain of the role.
GadgEon Software Engineer candidate reports ↗Is the interview process mostly remote or in-person?
GadgEon utilizes both formats. Expect Google Meet or similar platforms for initial rounds, with the possibility of in-person interactions for final stages.
GadgEon Software Engineer candidate reports ↗What should I do if I don't know an answer?
Be honest. It is better to explain how you would *attempt* to find the answer or what your thought process is rather than guessing or bluffing.
GadgEon Software Engineer candidate reports ↗How many rounds is the GadgEon Software Engineer interview process?
Candidates report 4 stages: Initial Screening, Technical Evaluations, Managerial Discussion, and HR Discussion. The interview process section above breaks down what each stage covers.
GadgEon Software Engineer candidate reports ↗What topics come up in the GadgEon Software Engineer interview?
GadgEon Software Engineer interviews most often cover Java, IoT (Internet of Things), Data Structures & Algorithms (DSA/DS), Spring Framework (Spring annotations), and Spring Boot, based on topics extracted from real candidate reports.
GadgEon 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.
- 01GadgEon 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.
Confluent Software Engineer Interview Guide
Concurrency exercises for Confluent candidates: check-then-act races, deadlock from inconsistent lock ordering, and why two individually atomic operations do not compose into an atomic update.
Zemoso Technologies Software Engineer Interview Guide
What Zemoso Technologies asks Software Engineer candidates, from reported rounds and questions.
Xebia Software Engineer Interview Guide
What Xebia asks Software Engineer candidates, from reported rounds and questions.
Uganda Revenue Authority Software Engineer Interview Guide
What Uganda Revenue Authority asks Software Engineer candidates, from reported rounds and questions.