Iconma Software Engineer Interview Guide

The 60-second brief

At Iconma, a leading provider of professional staffing and IT consulting services, a Software Engineer plays a pivotal role in delivering high-quality, scalable technology solutions. Because Iconma partners with a diverse range of clients—from Fortune 500 companies to emerging enterprises—engineers here work on a wide array of systems, platforms, and problem spaces. You are not just writing code; you are building the digital infrastructure that powers modern business operations across industries like finance, healthcare, retail, and logistics. The impact of this position is highly visible. Whether you are assigned to an internal development team or placed on a strategic client project, your technical expertise directly affects product delivery timelines and system reliability. The role demands a unique combination of technical depth and adaptability.

This guide is scoped to a Software Engineer candidate at Iconma.

Focus areas

• Technical interviews
• Project-based knowledge
• Progressive difficulty assessment

The Iconma interview process

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

Written Test

A non-technical paper focusing on quantitative aptitude and logical reasoning.

What to demonstrate

• A non-technical paper focusing on quantitative aptitude and logical reasoning
• Depth in Technical interviews

How to prepare

• Answer aloud and timed: Solve a problem involving speed, distance, and time (e.g., two trains traveling in opposite directions).
• Answer aloud and timed: Calculate compound interest and simple interest differences over a set period.

Group Discussion

A collaborative elimination round where candidates discuss a topic to test communication and teamwork.

What to demonstrate

• A collaborative elimination round where candidates discuss a topic to test communication and teamwork
• Depth in Technical interviews

How to prepare

• Answer aloud and timed: Solve logical reasoning puzzles involving seating arrangements or blood relations.
• Answer aloud and timed: Find the next number in a complex numerical sequence.

Technical & HR Rounds

One or two technical interviews covering coding and databases, followed by an HR discussion.

What to demonstrate

• One or two technical interviews covering coding and databases, followed by an HR discussion
• Depth in Technical interviews

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

Recruiter Phone Screen

Initial call with a recruiter to assess background and role fit for onshore or specialized roles.

What to demonstrate

• Initial call with a recruiter to assess background and role fit for onshore or specialized roles
• Depth in Technical interviews

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

Two to three technical interviews focusing on coding and system design.

What to demonstrate

• Two to three technical interviews focusing on coding and system design
• Depth in Technical interviews

How to prepare

• Answer aloud and timed: Explain how garbage collection works in your primary programming language (e.g., Java or.NET).
• Answer aloud and timed: How do you ensure your code is secure against common vulnerabilities like SQL injection or XSS?

Where candidates lose points

Brush Up on Aptitude Basics

Do not skip practicing basic arithmetic and logical puzzles. Many technical candidates fail the initial written test because they are out of practice with high-school-level math.

Master Your CV

Every project, tool, and technology listed on your resume is fair game. Ensure you can explain your exact role, the challenges you faced, and the technical decisions you made for every project.

Ensure you can speak in detail about every project listed on your resume

The HR and technical interviewers will cross-reference your CV closely during the final rounds.

Showcase Confidence

In consulting, confidence is key. Speak clearly, maintain good eye contact (or camera alignment if virtual), and do not hesitate to ask clarifying questions if an interview prompt is ambiguous.

Questions & practice

Explain how garbage collection works in your primary programming language (e.g., Java or.NET).

Medium · Technical Foundations & Project Executio

Approach

1. Say what the runtime actually does before reasoning about the code.
2. Name what is shared across threads and what owns each piece of state.
3. Identify the window where an invariant is briefly untrue.
4. Distinguish a value from a reference to it, and say which one you handed out.

Follow-up

• What happens if two callers reach this at the same time?
• Where could this allocate more than you expect?

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?

Diff a projection against the primary without per-row point reads

Hard · reconciliation · range hashing · throttling

The listing projection has drifted and some rows show a stale version. The primary holds 40,000,000 resource rows across 12,000 tenants while serving 1,200 writes and 14,000 reads per second. The obvious repair, reading each resource row and comparing its version against the projection, is correct and would eventually finish. Explain precisely why it is unacceptable here, then give a diff that finds the differing rows, state its complexity, and make it safe to run against a live primary. Replication lag is usually under 100 ms and is not bounded.

Approach

1. Quantify the naive cost rather than calling it slow: 40,000,000 point reads at even 0.5 ms each is over five hours serialised, and the only lever is concurrency, which is exactly what you cannot spend. The primary's pool is sized for the write path, and 40,000,000 random reads evict the buffer cache that sustains the 85 percent cache hit rate, so the audit degrades the system it is auditing.
2. Replace random access with one ordered pass per side. Both sides can be read in (tenant_id, resource_id) order, which is a sequential scan on each and a merge join in O(n) time and O(1) memory. For a dense diff that is the whole answer, and it reads the primary once instead of 40,000,000 times.
3. For the expected sparse case, compare range hashes instead of rows: partition the key space, compute per range an order-independent aggregate over hash(resource_id, version), compare aggregates, and descend only into ranges that differ. With d differing rows and branching factor B, at most d ranges mismatch per level, so the drill-down examines O(d log_B(n/d)) ranges and reads full rows only in mismatching leaves.
4. Aggregate with a sum modulo 2^64 or a multiset hash, never XOR. XOR is order-independent but self-cancelling, so two rows wrong in the same way, or a row duplicated on one side, leave the range aggregate matching and the range is declared clean.

Follow-up

• The diff reports 900 stale rows. How do you decide between patching those rows and rebuilding the projection from resource_revision?
• Same job, but the projection lives in a search index that cannot be scanned in key order. What changes?

How do you ensure your code is secure against common vulnerabilities like SQL injection or XSS?

Medium · Technical Foundations & Project Executio

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?

Explain why the owner filter ignores the listing index

Medium · composite index · query plans · sort elimination

The only index on resource is (tenant_id, status, updated_at DESC, resource_id DESC). A new endpoint returns one user's resources across all statuses, newest created first: WHERE tenant_id = $1 AND owner_user_id = $2 ORDER BY created_at DESC LIMIT 20. On a tenant with 2M rows it takes 900 ms and EXPLAIN shows a sort above a large scan. Explain precisely why the existing index cannot serve it, give the index that can, and state which of these the new index still will not help: owner_user_id alone across tenants; the same query ordered by updated_at. PostgreSQL 16.

Approach

1. Separate the two jobs an index does. For filtering, a composite btree is seekable only on a left prefix, so with no predicate on status the scan can at best range over tenant_id and test owner_user_id per row; PostgreSQL 16 has no btree skip scan to jump the unconstrained column.
2. For ordering, the index is sorted by (status, updated_at) within a tenant and not by created_at, so the LIMIT cannot stop early: every matching row is read and then sorted. That is the 'Sort Method: top-N heapsort' line, and it is why the plan reads 2M rows to answer with 20.
3. Derive the replacement from the access path — equality, equality, then the ordering column: CREATE INDEX CONCURRENTLY ON resource (tenant_id, owner_user_id, created_at DESC). The scan seeks to the (tenant, owner) range and walks 20 entries in order, so the Sort node disappears along with the row-read.
4. Treat INCLUDE (title, status) as conditional, not free. An index-only scan still visits the heap for any row whose page is not marked all-visible, so on a table taking 1.2k writes/second the win depends on autovacuum keeping the visibility map current, and the wider index costs more on every insert.

Follow-up

• 90% of rows are status='active'. Would a partial index WHERE status = 'active' change your answer, and for which of the three queries?
• A dashboard runs this for 40 owners in one page load. What changes about the design?

Solve a problem involving speed, distance, and time (e.g., two trains traveling in opposite directions).

Medium · Quantitative & Logical Aptitude

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?

Calculate compound interest and simple interest differences over a set period.

Medium · Quantitative & Logical Aptitude

Approach

1. Say who the caller is and what they do when the call fails halfway.
2. Define the identity of a request so a retry cannot double-apply it.
3. Separate accepted, pending, failed and confirmed; they are different facts.
4. Design the error taxonomy before the success shape; callers branch on it.

Follow-up

• What happens if the caller retries after a timeout?
• How does a client discover it is on an old version of this contract?

Solve logical reasoning puzzles involving seating arrangements or blood relations.

Medium · Quantitative & Logical Aptitude

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?

Find the next number in a complex numerical sequence.

Medium · Quantitative & Logical Aptitude

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?

Solve basic algebraic word problems and percentage calculations.

Medium · Quantitative & Logical Aptitude

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 abstract classes and interfaces, and when you would use each.

Medium · Technical Foundations & Project Executio

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 challenging project on your resume.

Medium · Technical Foundations & Project Executio

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?

Exports duplicate a row range about once a week

Hard · leases · clock skew · idempotency

Roughly once a week an export writes a file containing a duplicated range of rows. The affected job_run rows show attempt = 1, status = succeeded, one started_at, and a lease_owner naming a different host from the one whose logs show the job starting. Leases last 30 seconds and are heartbeated every 10 from inside the handler; lease_expires_at is computed on the worker and compared against the database's now(). Find the mechanism, and give a fix that holds even if you cannot fix the clocks.

Approach

1. Start from the fact that eliminates the obvious answer. attempt = 1 means no retry was recorded, so this is not a re-run after failure; two workers ran the same row concurrently and the takeover path never touched the counter. lease_owner naming a host other than the one that started the job is the same statement from the other side.
2. Enumerate the mechanisms that cause a premature takeover, then find the signal that separates them. Either the lease genuinely expired because the heartbeat did not fire, which is what happens when the heartbeat runs on the handler's own thread and the handler makes a long blocking call, or it only appeared expired because two clocks disagree, since lease_expires_at is written from the worker's clock and evaluated against the database's. The discriminator is the distribution: incidents clustered on the longest exports indict the heartbeat, incidents clustered on one host indict skew. Measure both, and measure each host's offset against the database directly.
3. Read the reclaim query precisely. In PostgreSQL now() is transaction start time, not statement time, so a reclaimer holding a long transaction compares against an older timestamp than expected; clock_timestamp() is the statement-time function. This is worth ruling in or out before you redesign anything, because it changes which rows look expired.
4. Remove the second clock rather than trying to synchronise it. Issue and extend the lease in the database, with lease_expires_at = now() + interval '30 seconds' in both the claim and the heartbeat, so exactly one clock is ever compared and worker skew stops mattering to this predicate.

Follow-up

• The displaced worker has already streamed half the file to object storage. What makes that side effect safe to repeat?
• You now count takeovers. What alert fires on that counter, and at what threshold?

Suggested practice checklist

Built from the rounds and topics Iconma candidates report.

Day 1 — Map the Iconma loop

• Write out the reported sequence: Written Test, Group Discussion, Technical & HR Rounds, Recruiter Phone Screen, Technical Rounds.
• For each round, write one sentence on what it is judging, from the description above, and mark the one you are least ready for.

Deliverable: A one-page map of the 5 reported rounds, with the weakest marked.

Day 2 — Work Technical interviews

• Spend the session on Technical interviews, which Iconma candidates report being tested on.
• Write one worked example in Technical interviews and time yourself on it.

Deliverable: One timed worked example in Technical interviews.

Day 3 — Work Project-based knowledge

• Spend the session on Project-based knowledge, which Iconma candidates report being tested on.
• Write one worked example in Project-based knowledge and time yourself on it.

Deliverable: One timed worked example in Project-based knowledge.

Day 4 — Work Progressive difficulty assessment

• Spend the session on Progressive difficulty assessment, which Iconma candidates report being tested on.
• Write one worked example in Progressive difficulty assessment and time yourself on it.

Deliverable: One timed worked example in Progressive difficulty assessment.

Day 5 — Answer out loud: Quantitative & Logical Aptitude

• Answer aloud, timed: Solve a problem involving speed, distance, and time (e.g., two trains traveling in opposite directions).
• Answer aloud, timed: Calculate compound interest and simple interest differences over a set period.

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

Day 6 — Answer out loud: Technical Foundations & Project Execution

• Answer aloud, timed: Explain the difference between abstract classes and interfaces, and when you would use each.
• Answer aloud, timed: How do you handle database indexing, and what are the trade-offs of over-indexing?

Deliverable: Spoken answers to 2 reported Technical Foundations & Project Execution question(s), under time.

Day 7 — Answer out loud: Behavioral & Professional Communication

• Answer aloud, timed: Discuss your perspective on a current technology trend (e.g., "The impact of AI on software development" during a Group Discussion).
• Answer aloud, timed: Describe a time when you had a disagreement with a team member and how you resolved it.

Deliverable: Spoken answers to 2 reported Behavioral & Professional Communication question(s), under time.

Behavioural preparation

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

How do you handle database indexing, and what are the trade-offs of over-indexing?

Medium · Technical Foundations & Project Executio

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?

Discuss your perspective on a current technology trend (e.g., "The impact of AI on software development" durin

Medium · Behavioral & Professional Communication

Discuss your perspective on a current technology trend (e.g., "The impact of AI on software development" during a Group Discussion).

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?

Describe a time when you had a disagreement with a team member and how you resolved it.

Medium · Behavioral & Professional Communication

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?

Why do you want to work with Iconma, and how do you handle shifting project requirements?

Medium · Behavioral & Professional Communication

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?

Walk me through your resume and explain your specific contributions to your academic or professional projects.

Medium · Behavioral & Professional Communication

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 manage your time when assigned to multiple urgent tasks simultaneously?

Medium · Behavioral & Professional Communication

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?