Technogen India Pvt. Software Engineer Interview Guide

The 60-second brief

At Technogen India Pvt., a Software Engineer plays a critical role in designing, developing, and maintaining robust software solutions that drive business transformation for clients globally. As a global IT services and consulting company, Technogen India Pvt. relies on its engineering teams to deliver high-quality, scalable, and secure applications. In this role, you are not just writing code; you are translating complex business requirements into elegant technical solutions that directly impact client operations and end-user experiences. The position offers a dynamic environment where you will work on diverse projects spanning enterprise application development, cloud integrations, and system modernization.

This guide is scoped to a Software Engineer candidate at Technogen India Pvt..

Focus areas

• Java (Core)
• Programming Problem Solving
• Logical Reasoning

The Technogen India Pvt. interview process

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

Initial Screening

A written or online test focusing on quantitative aptitude, logical reasoning, and basic coding tasks.

What to demonstrate

• A written or online test focusing on quantitative aptitude, logical reasoning, and basic coding tasks
• Depth in Java (Core)

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 Rounds

Face-to-face discussions with senior engineers assessing programming skills and project experiences.

What to demonstrate

• Face-to-face discussions with senior engineers assessing programming skills and project experiences
• Depth in Java (Core)

How to prepare

• Answer aloud and timed: Explain the logic behind a classic analytical puzzle (e.g., measuring water using different-sized jugs).
• Answer aloud and timed: What are the main pillars of Object-Oriented Programming, and how do you implement them in Java?

Managerial and HR Round

Assessment of behavioral fit, team collaboration style, and salary expectations.

What to demonstrate

• Assessment of behavioral fit, team collaboration style, and salary expectations
• Depth in Java (Core)

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 managerial and hr round above and write down what you would ask to confirm before it.

Where candidates lose points

Do Not Neglect Aptitude Preparation

Because the initial written test (often AMCAT-based) is the primary filter, spend time practicing timed aptitude and logical reasoning questions before your interview day.

Master the Fundamentals

You do not need to memorize complex system designs, but you must know your core language basics inside and out. Be ready to explain simple concepts like polymorphism or interface implementation with clear, real-world examples.

Prepare for Administrative Wait Times

Some candidates have reported waiting a few hours on-site before their interviews commenced. Bring a notebook, stay patient, and use the time to keep your mind focused and relaxed.

Questions & practice

Write a program to reverse a string or find duplicate characters in an array without using built-in library fu

Medium · Core Java & Object-Oriented Programming

Write a program to reverse a string or find duplicate characters in an array without using built-in library functions.

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?

Merge partitioned event streams into one ordered feed with bounded lateness

Hard · k-way merge · watermarks · out-of-order streams

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

1. 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.
2. 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.
3. 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.
4. 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

Medium · sweep line · intervals · leases

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

1. 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.
2. 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.
3. 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.
4. 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?

Describe a situation where you had to optimize a slow-performing database query or backend service.

Medium · System Architecture & Design

Approach

1. Name the grain you start from and join outward from it.
2. Check whether any join is one-to-many before aggregating, or the sums inflate.
3. Say which index the query would use, and what makes it unusable.
4. Handle the rows that do not match: that is usually the actual question.

Follow-up

• How does the query change if that join becomes one-to-many?
• What happens to this when the table is ten times larger?

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?

Solve a series of logical pattern questions to determine the next number or shape in a sequence.

Medium · Aptitude and Logical Reasoning

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?

Answer quantitative aptitude questions covering topics like work and time, speed and distance, and probability

Medium · Aptitude and Logical Reasoning

Answer quantitative aptitude questions covering topics like work and time, speed and distance, and probability.

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?

Explain the logic behind a classic analytical puzzle (e.g., measuring water using different-sized jugs).

Medium · Aptitude and Logical Reasoning

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 are the main pillars of Object-Oriented Programming, and how do you implement them in Java?

Medium · Core Java & Object-Oriented Programming

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?

Explain the difference between an abstract class and an interface. When would you use one over the other?

Medium · Core Java & Object-Oriented Programming

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?

How does the Exception Handling mechanism work in Java? Describe the difference between checked and unchecked

Medium · Core Java & Object-Oriented Programming

How does the Exception Handling mechanism work in Java? Describe the difference between checked and unchecked exceptions.

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?

Explain the Java Collections Framework. What is the difference between a HashMap and a HashTable?

Medium · Core Java & Object-Oriented Programming

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?

Walk me through the architecture of the most complex project you have worked on. What were your specific contr

Medium · System Architecture & Design

Walk me through the architecture of the most complex project you have worked on. What were your specific contributions?

Approach

1. Fix the scope first: who calls this, how often, and what they do when it fails.
2. Name the read and write paths separately; they rarely have the same bottleneck.
3. Choose a partition key and say what query it makes expensive.
4. 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 ensure code modularity and scalability when designing a new software component?

Medium · System Architecture & Design

Approach

1. Fix the scope first: who calls this, how often, and what they do when it fails.
2. Name the read and write paths separately; they rarely have the same bottleneck.
3. Choose a partition key and say what query it makes expensive.
4. 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?

Listing latency scales with page size, not with filters

Easy · n+1 · latency · query batching

The tenant listing endpoint reads resource filtered by tenant_id and status, ordered by updated_at DESC, and returns each row plus the owner's display name from app_user and the actor of that resource's latest resource_revision. p99 is 55 ms at 10 rows per page and 1.4 s at 200. Database telemetry shows 401 statements per request, each under 1 ms, and nothing in the slow-query log. Diagnose the cause and give the fix, stating the statement count per request and the p99 you expect afterwards.

Approach

1. Read the counters before forming a theory. 401 statements for 200 rows is one driver query plus two per row, and sub-millisecond execution with an empty slow-query log rules out a bad plan. The time is round trips, which is why it is invisible in every per-query metric and scales with rows returned rather than with filter selectivity.
2. Name the two per-row statements from their normalised text: a single-row app_user lookup by user_id, and a resource_revision lookup by resource_id ordered by version DESC LIMIT 1. Confirm by dropping those two response fields and watching the statement count fall to one. That locates the calls in the serialisation layer, not the repository.
3. Check that the arithmetic accounts for the whole gap. Measure one round trip to the replica in isolation; 400 trips at roughly 3 ms of network plus 0.2 ms of execution is about 1.3 s on top of a 55 ms baseline, which matches. If the multiplication had fallen short, the N+1 would only be part of the story and you would keep looking.
4. Batch both lookups. Collect owner_user_ids and resource_ids from the driver query, then issue WHERE tenant_id = $1 AND user_id = ANY($2) for the users, and PostgreSQL's SELECT DISTINCT ON (resource_id) ... WHERE resource_id = ANY($2) ORDER BY resource_id, version DESC for the latest revision, which the UNIQUE (resource_id, version) index serves directly. On an engine without DISTINCT ON, use a lateral join or a row_number window. Three statements per request at any page size.

Follow-up

• The page size is capped at 200 today. What breaks first if it is raised to 2,000, and is it still this bug?
• How do you stop the next N+1 from reaching production, given that no individual query is slow and the endpoint's tests pass?

Suggested practice checklist

Built from the rounds and topics Technogen India Pvt. candidates report.

Day 1 — Map the Technogen India Pvt. loop

• Write out the reported sequence: Initial Screening, Technical Rounds, Managerial and HR Round.
• 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.

Day 2 — Work Java (Core)

• Spend the session on Java (Core), which Technogen India Pvt. candidates report being tested on.
• Write one worked example in Java (Core) and time yourself on it.

Deliverable: One timed worked example in Java (Core).

Day 3 — Work Programming Problem Solving

• Spend the session on Programming Problem Solving, which Technogen India Pvt. candidates report being tested on.
• Write one worked example in Programming Problem Solving and time yourself on it.

Deliverable: One timed worked example in Programming Problem Solving.

Day 4 — Work Logical Reasoning

• Spend the session on Logical Reasoning, which Technogen India Pvt. candidates report being tested on.
• Write one worked example in Logical Reasoning and time yourself on it.

Deliverable: One timed worked example in Logical Reasoning.

Day 5 — Answer out loud: Aptitude and Logical Reasoning

• Answer aloud, timed: Solve a series of logical pattern questions to determine the next number or shape in a sequence.
• Answer aloud, timed: Answer quantitative aptitude questions covering topics like work and time, speed and distance, and probability.

Deliverable: Spoken answers to 2 reported Aptitude and Logical Reasoning question(s), under time.

Day 6 — Answer out loud: Core Java & Object-Oriented Programming

• Answer aloud, timed: What are the main pillars of Object-Oriented Programming, and how do you implement them in Java?
• Answer aloud, timed: Explain the difference between an abstract class and an interface. When would you use one over the other?

Deliverable: Spoken answers to 2 reported Core Java & Object-Oriented Programming question(s), under time.

Day 7 — Answer out loud: System Architecture & Design

• Answer aloud, timed: Walk me through the architecture of the most complex project you have worked on. What were your specific contributions?
• Answer aloud, timed: How do you ensure code modularity and scalability when designing a new software component?

Deliverable: Spoken answers to 2 reported System Architecture & Design question(s), under time.

Behavioural preparation

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

Describe a time when you had to work under a tight deadline. How did you prioritize your tasks?

Medium · Behavioral & Managerial

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 disagreements with a peer or a senior architect regarding a technical decision?

Medium · Behavioral & Managerial

Approach

1. Pick a story where you made the decision, not one where you watched it.
2. State the situation in two sentences and spend the rest on the reasoning.
3. Give the blast radius: what could have broken, and what you measured.
4. Name the disagreement and how you resolved it with evidence.

Follow-up

• What would you do differently if you ran that again?
• How did you know your change caused the improvement?

Tell me about a time you had to learn a new technology quickly to meet a project requirement.

Medium · Behavioral & Managerial

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 structure your daily workflow to ensure high-quality deliverables while managing multiple tasks?

Medium · Behavioral & Managerial

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?