A Software Engineer at Aptech plays a foundational role in delivering high-quality educational technology solutions and software services. You will be responsible for translating complex requirements into robust, scalable code, ensuring that the systems supporting Aptech remain performant and reliable. Your work directly impacts how users interact with our digital infrastructure, making your technical proficiency and problem-solving abilities vital to our operational success. This role requires a blend of deep technical knowledge and a practical mindset. Whether you are working on database architecture, refining API integrations, or building out frontend components, you are expected to maintain clean, maintainable code standards. You will frequently collaborate with cross-functional teams, meaning your ability to communicate technical trade-offs effectively is just as important as your ability to write efficient algorithms.
Initial Screening
reportedThe process begins with an initial screening to evaluate basic qualifications.
What to demonstrate
- The process begins with an initial screening to evaluate basic qualifications
- Depth in Object-Oriented Programming (OOP)
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 Screening
reportedCandidates undergo technical screenings to assess their coding and problem-solving skills.
What to demonstrate
- Candidates undergo technical screenings to assess their coding and problem-solving skills
- Depth in Object-Oriented Programming (OOP)
How to prepare
- Answer aloud and timed: What are the core differences between languages like C, Java, and Python?
- Answer aloud and timed: How do you approach implementing RESTful API structures?
Machine Tests
reportedCandidates complete machine tests where they perform specific tasks under time constraints.
What to demonstrate
- Candidates complete machine tests where they perform specific tasks under time constraints
- Depth in Object-Oriented Programming (OOP)
How to prepare
- Answer aloud and timed: Can you explain the folder structure and MVC patterns in frameworks like Laravel or CodeIgniter?
- Answer aloud and timed: Explain your process for designing a database structure for a new application.
Management Interviews
reportedInterviews with management to evaluate fit within the team and organizational culture.
What to demonstrate
- Interviews with management to evaluate fit within the team and organizational culture
- Depth in Object-Oriented Programming (OOP)
How to prepare
- Answer aloud and timed: How do you approach complex MySQL join queries and stored procedures?
- Answer aloud and timed: What are your strategies for implementing caching mechanisms and using tools like Memcached?
Final Assessment
reportedThe final assessment consolidates all evaluations to determine candidate suitability.
What to demonstrate
- The final assessment consolidates all evaluations to determine candidate suitability
- Depth in Object-Oriented Programming (OOP)
How to prepare
- Answer aloud and timed: How would you handle SSL certificate installation and configuration?
- Answer aloud and timed: How do you handle tight deadlines and high-pressure project scenarios?
PracHub editorial advice for the preparation topics above.
Show your work
When solving problems, talk through your thought process out loud. This helps interviewers understand your logic, even if you run into a snag.
Understand the "Why
Don't just memorize definitions. Be prepared to explain why you would use one technology over another.
Focus on basics
Many of our technical rounds start with fundamental questions about C, Java, or Python. Ensure your foundational knowledge is sharp.
Professionalism matters
Always maintain a professional demeanor throughout the process, from initial contact to the final interview round.
Choose a category, try a prompt, then open its approach, worked solution or follow-up when you need it.
Identify the heaviest tenants in a five-minute window under memory pressure
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
- 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.
- 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.
- 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.
- 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?
Archive a resource graph without breaking live references or recursing
Resources reference other resources within a tenant; for the largest tenant the reference table holds up to 2,000,000 nodes and 8,000,000 edges. Archiving a resource must archive everything reachable from it that nothing outside the set still references, refuse when a live external referrer exists, and terminate when references form cycles, which they legitimately do. Produce the archive order and the refusal list, targeting O(V+E). Say what stops the traversal crossing a tenant boundary, and why recursion is the wrong control structure at this size.
Approach
- Load the subgraph with the tenant predicate on both endpoints of the edge, not only on the side you started from. Scoping the left table alone is the classic cross-tenant leak: one mis-entered edge then pulls another tenant's resources into the traversal and, worse, into the archive.
- Traverse iteratively with an explicit stack. A 2,000,000-node graph can hold a chain deep enough to exhaust a native stack in the low tens of thousands of frames, and that failure is a process crash rather than an error you can return.
- Treat cycles as data rather than corruption: compute strongly connected components with Tarjan in O(V+E) using its own explicit stack, then condense. The condensation is a DAG, so a topological order over it gives the archive order, and every member of a component archives in one transaction because no order within a cycle is valid.
- Decide refusals with reverse edges. A candidate is archivable only if every in-edge originates inside the candidate set, so build the transpose or count in-degrees restricted to the visited set, and emit each blocked resource with the id of the external referrer, which is the only part of the answer an operator can act on.
Follow-up
- The graph is read in one query and the archive writes a minute later. What can change in between, and how do you make the write safe?
- The candidate set is 400,000 resources. Is that one transaction, and if not, what does a half-finished archive look like to a reader?
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?
How do you approach complex MySQL join queries and stored procedures?
How do you approach complex MySQL join queries and stored procedures?
Approach
- Name the grain you start from and join outward from it.
- Check whether any join is one-to-many before aggregating, or the sums inflate.
- Say which index the query would use, and what makes it unusable.
- 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?
Stop tag and share joins from fanning out a page
resource_tag is (resource_id, tag_id) with PK (resource_id, tag_id); resource_share is (resource_id, shared_with_user_id, permission). The tagged-and-shared listing inner-joins resource to both, filters tenant_id, tag_id = ANY($2) and shared_with_user_id = $3, orders by updated_at DESC and takes 50. Pages come back with fewer than 50 distinct resources and the total in the header is far too high. Explain the row multiplication, rewrite both the page query and the count query so each is correct, and name the index each one needs. PostgreSQL 16.
Approach
- Do the arithmetic against the predicates that are actually there. An inner join emits one row per matching child row, and both joins are filtered: tag_id = ANY($2) admits only the requested tags, shared_with_user_id = $3 admits one user's share rows. So a resource holding three of the requested tags and shared with $3 once yields three rows, not one — the multiplier is its count of matching tags times its share rows for that single user, and that second factor is 1 unless the table admits duplicate (resource_id, shared_with_user_id) pairs. LIMIT 50 then limits rows rather than resources, and COUNT(*) counts pairs — the header is the product, not the population.
- Reject DISTINCT as the fix. It deduplicates after the product has been built, so the planner must materialise and sort the fanned-out set before the LIMIT can apply, and it leaves any SUM or AVG in the same select list wrong.
- Rewrite both filters as semi-joins, keeping resource as the only row source: AND EXISTS (SELECT 1 FROM resource_tag rt WHERE rt.resource_id = r.resource_id AND rt.tag_id = ANY($2)) and the same shape against resource_share. A semi-join stops at the first match per resource and preserves the driving index order, so ORDER BY updated_at DESC, resource_id DESC LIMIT 50 still stops after 50 rows.
- Count with the same predicates and no join at all: SELECT count(*) FROM resource r WHERE r.tenant_id = $1 AND r.status = 'active' AND EXISTS (...) AND EXISTS (...). Nothing multiplies a resource, so the number is the population.
Follow-up
- The filter changes from 'any of these tags' to 'all of these tags'. Rewrite it and state what it costs relative to the ANY form.
- A resource can be shared with the same user twice under different permissions. Does your count change, and should it?
What is the difference between HTTP and HTTPS?
What is the difference between HTTP and HTTPS?
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 your understanding of OOPS concepts.
Explain your understanding of OOPS concepts.
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 core differences between languages like C, Java, and Python?
What are the core differences between languages like C, Java, and Python?
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 do you approach implementing RESTful API structures?
How do you approach implementing RESTful API structures?
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?
Can you explain the folder structure and MVC patterns in frameworks like Laravel or CodeIgniter?
Can you explain the folder structure and MVC patterns in frameworks like Laravel or CodeIgniter?
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 your process for designing a database structure for a new application.
Explain your process for designing a database structure for a new application.
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?
What are your strategies for implementing caching mechanisms and using tools like Memcached?
What are your strategies for implementing caching mechanisms and using tools like Memcached?
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 would you handle SSL certificate installation and configuration?
How would you handle SSL certificate installation and configuration?
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?
Read latency spikes on a sixty-second sawtooth
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
- 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.
- 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.
- 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.
- 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?
Built from the rounds and topics Aptech candidates report.
Prepare, practise & reflect
One practical outcome each day. Spend longer where you need it.
0 / 7 done01Map the Aptech loop
- Write out the reported sequence: Initial Screening, Technical Screening, Machine Tests, Management Interviews, 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.
02Work Object-Oriented Programming (OOP)
- Spend the session on Object-Oriented Programming (OOP), which Aptech candidates report being tested on.
- Write one worked example in Object-Oriented Programming (OOP) and time yourself on it.
Deliverable: One timed worked example in Object-Oriented Programming (OOP).
03Work SQL (MySQL)
- Spend the session on SQL (MySQL), which Aptech candidates report being tested on.
- Write one worked example in SQL (MySQL) and time yourself on it.
Deliverable: One timed worked example in SQL (MySQL).
04Work Database Joins
- Spend the session on Database Joins, which Aptech candidates report being tested on.
- Write one worked example in Database Joins and time yourself on it.
Deliverable: One timed worked example in Database Joins.
05Answer out loud: Technical Fundamentals
- Answer aloud, timed: What is the difference between HTTP and HTTPS?
- Answer aloud, timed: Explain your understanding of OOPS concepts.
Deliverable: Spoken answers to 2 reported Technical Fundamentals question(s), under time.
06Answer out loud: Database & System Design
- Answer aloud, timed: Explain your process for designing a database structure for a new application.
- Answer aloud, timed: How do you approach complex MySQL join queries and stored procedures?
Deliverable: Spoken answers to 2 reported Database & System Design question(s), under time.
07Answer out loud: Behavioral & Situational
- Answer aloud, timed: How do you handle tight deadlines and high-pressure project scenarios?
- Answer aloud, timed: Tell me about yourself and your background.
Deliverable: Spoken answers to 2 reported Behavioral & Situational question(s), under time.
Expand any day for tasks and deliverables. Your progress is saved on this device.
Behavioural rounds judge the decision you made and what it cost.
How do you handle tight deadlines and high-pressure project scenarios?
How do you handle tight deadlines and high-pressure project scenarios?
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 yourself and your background.
Tell me about yourself and your background.
Approach
- Pick a story where you made the decision, not one where you watched it.
- State the situation in two sentences and spend the rest on the reasoning.
- Give the blast radius: what could have broken, and what you measured.
- Name the disagreement and how you resolved it with evidence.
Follow-up
- What would you do differently if you ran that again?
- How did you know your change caused the improvement?
Why are you interested in this role at Aptech?
Why are you interested in this role at Aptech?
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 tight deadlines and high-pressure project scenarios?
- 02
Tell me about yourself and your background.
- 03
Why are you interested in this role at Aptech?
How long does the interview process typically take?
The process can vary, but generally, it spans from a few days to a couple of weeks depending on scheduling. Some campus-based interviews are completed within a single day.
Aptech Software Engineer candidate reports ↗What is the best way to prepare for the machine test?
Focus on practical tasks like data manipulation and database schema design. Practice working under a strict time limit to simulate the pressure of the actual assessment.
Aptech Software Engineer candidate reports ↗Does Aptech require payment for training or job placement?
No. Aptech does not charge candidates for the opportunity to interview or work. Be cautious of any request for payment.
Aptech Software Engineer candidate reports ↗What differentiates a top candidate?
A top candidate is one who not only solves the technical problems correctly but also explains their reasoning clearly and demonstrates a deep understanding of why they chose a particular approach.
Aptech Software Engineer candidate reports ↗What topics does Aptech test in interviews?
Aptech interviews most often cover Object-Oriented Programming (OOP), International Franchisee Business Development, SQL (MySQL), Business Numbers & KPIs, and Database Joins. The exact emphasis depends on the specific role you apply for.
Aptech 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.
- 01Aptech 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.
Vodafone Software Engineer Interview Guide
What Vodafone asks Software Engineer candidates, from reported rounds and questions.
Verisk Analytics Software Engineer Interview Guide
What Verisk Analytics asks Software Engineer candidates, from reported rounds and questions.
TEKsystems Software Engineer Interview Guide
What TEKsystems asks Software Engineer candidates, from reported rounds and questions.
T. Rowe Price Software Engineer Interview Guide
What T. Rowe Price asks Software Engineer candidates, from reported rounds and questions.