The Software Engineer role at iProgrammer is a cornerstone of the company’s ability to deliver high-quality, scalable digital solutions. As an engineer, you are not just writing code; you are solving complex business problems and contributing directly to the technical architecture of products that serve a diverse client base. Whether you are building user-facing interfaces with ReactJS or architecting robust backend systems, your work directly influences the performance and reliability of the company's offerings. This position is critical because it demands a blend of deep technical proficiency and the ability to think critically about system design. You will often work in collaborative, cross-functional teams where your input on technical strategy is valued from the early stages of a project. The environment is fast-paced, and success here requires a proactive mindset—one that is comfortable navigating ambiguity and committed to writing clean, efficient, and maintainable code.
Assessment Phase
reportedInitial assessment to filter candidates based on fundamental aptitude and coding logic.
What to demonstrate
- Initial assessment to filter candidates based on fundamental aptitude and coding logic
- Depth in Java
How to prepare
- Answer aloud and timed: Explain the core OOPS concepts (Inheritance, Polymorphism, Encapsulation) with real-world examples.
- Answer aloud and timed: What is the difference between a primary key and a unique key in SQL?
Technical Interviews
reportedMultiple rounds of technical interviews focusing on applying theory to practice and evaluating technical skills.
What to demonstrate
- Multiple rounds of technical interviews focusing on applying theory to practice and evaluating technical skills
- Depth in Java
How to prepare
- Answer aloud and timed: Can you explain the difference between let, var, and const in JavaScript?
- Answer aloud and timed: How does Exception Handling work, and why is it important in robust applications?
PracHub editorial advice for the preparation topics above.
Explain your logic
Never just write code in silence. Talk through your decisions, especially when you are making trade-offs between space and time complexity.
Prepare your project stories
Be ready to deep-dive into your final year project or previous work. Know the architecture, the challenges, and the specific technical choices you made.
Respect the basics
Don't overlook the "easy" questions. Sometimes interviewers start with simple concepts to see if you have mastered the fundamentals.
Stay calm under pressure
You may face complex puzzles or tricky questions. If you get stuck, ask clarifying questions to narrow down the problem scope.
Choose a category, try a prompt, then open its approach, worked solution or follow-up when you need it.
Write the code to generate a Pascal’s Triangle.
Write the code to generate a Pascal’s Triangle.
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?
Find the longest palindromic substring within a given string.
Find the longest palindromic substring within a given string.
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?
How would you identify all characters in a string that appear more than once?
How would you identify all characters in a string that appear more than once?
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?
Solve for the minimum number of candies required for children based on ratings (a classic optimization problem
Solve for the minimum number of candies required for children based on ratings (a classic optimization problem).
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?
Perform basic array manipulations, such as finding missing numbers or reversing a number.
Perform basic array manipulations, such as finding missing numbers or reversing a number.
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?
What is the difference between a primary key and a unique key in SQL?
What is the difference between a primary key and a unique key in SQL?
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?
Keep soft-deleted accounts from blocking re-registration
app_user holds user_id, tenant_id, email CITEXT, password_hash (NULL for SSO principals), email_verified_at, auth_version, status ('invited','active','suspended','deactivated'), created_at, updated_at, deleted_at. Two live accounts for one address inside a tenant must be impossible, but an address freed by a soft delete must be reusable, and the same tenant may delete and re-register it repeatedly. Write the uniqueness DDL for PostgreSQL 16, then the equivalent for MySQL 8 where partial indexes do not exist, and say what each permits once three deleted rows already hold that address.
Approach
- Start from what is actually unique: not (tenant_id, email), but (tenant_id, email) among live rows. PostgreSQL says that directly — CREATE UNIQUE INDEX app_user_live_email ON app_user (tenant_id, email) WHERE deleted_at IS NULL. A full constraint over the same two columns burns the address permanently the first time someone deletes an account.
- Keep case-insensitivity in the type or the index, never in the application: CITEXT as given, or UNIQUE (tenant_id, lower(email)) as an expression index where the extension is unavailable. A case-sensitive unique column is exactly how two accounts for one human appear.
- For MySQL 8 the predicate has to move inside the key: add a discriminator column that is a constant 0 while the row is live and is set to user_id on delete, with UNIQUE (tenant_id, email, deleted_marker). Live rows share the constant and still collide; deleted rows differ from each other and stop colliding.
- State the NULL variant and its dependency: leaving the marker NULL for deleted rows also works, because a unique index treats NULLs as distinct — true in MySQL, and true in PostgreSQL only under the default NULLS DISTINCT, which PostgreSQL 15 lets you reverse. Check the polarity against the three existing deleted rows: constant-on-live is what preserves the collision you want, and reversing it silently admits duplicate live accounts.
Follow-up
- A deleted account re-registers with the same address the next day. Do the old resource rows follow the new user_id, and how does the API keep the two principals apart?
- How do you honour an erasure request while resource_revision.actor_user_id still references this table?
Explain the core OOPS concepts (Inheritance, Polymorphism, Encapsulation) with real-world examples.
Explain the core OOPS concepts (Inheritance, Polymorphism, Encapsulation) with real-world examples.
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?
Can you explain the difference between let, var, and const in JavaScript?
Can you explain the difference between let, var, and const in JavaScript?
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 does Exception Handling work, and why is it important in robust applications?
How does Exception Handling work, and why is it important in robust applications?
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 differences between C and C++?
What are the differences between C and 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?
What are Higher-Order Components (HOCs) in React?
What are Higher-Order Components (HOCs) in React?
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 lifecycle of a component in React.
Explain the lifecycle of a component in React.
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 debouncing and why is it used in web performance?
What is debouncing and why is it used in web performance?
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 difference between Client-side and Server-side rendering.
Explain the difference between Client-side and Server-side rendering.
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?
Exports duplicate a row range about once a week
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
- 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.
- 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.
- 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.
- 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?
Built from the rounds and topics iProgrammer candidates report.
Prepare, practise & reflect
One practical outcome each day. Spend longer where you need it.
0 / 7 done01Map the iProgrammer loop
- Write out the reported sequence: Assessment Phase, Technical Interviews.
- 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 2 reported rounds, with the weakest marked.
02Work Java
- Spend the session on Java, which iProgrammer candidates report being tested on.
- Write one worked example in Java and time yourself on it.
Deliverable: One timed worked example in Java.
03Work Object-Oriented Programming (OOP) / OOP Concepts
- Spend the session on Object-Oriented Programming (OOP) / OOP Concepts, which iProgrammer candidates report being tested on.
- Write one worked example in Object-Oriented Programming (OOP) / OOP Concepts and time yourself on it.
Deliverable: One timed worked example in Object-Oriented Programming (OOP) / OOP Concepts.
04Work Data Structures & Algorithms (DSA)
- Spend the session on Data Structures & Algorithms (DSA), which iProgrammer candidates report being tested on.
- Write one worked example in Data Structures & Algorithms (DSA) and time yourself on it.
Deliverable: One timed worked example in Data Structures & Algorithms (DSA).
05Answer out loud: Technical Fundamentals & Programming Concepts
- Answer aloud, timed: Explain the core OOPS concepts (Inheritance, Polymorphism, Encapsulation) with real-world examples.
- Answer aloud, timed: What is the difference between a primary key and a unique key in SQL?
Deliverable: Spoken answers to 2 reported Technical Fundamentals & Programming Concepts question(s), under time.
06Answer out loud: Data Structures & Algorithms
- Answer aloud, timed: Write the code to generate a Pascal’s Triangle.
- Answer aloud, timed: Find the longest palindromic substring within a given string.
Deliverable: Spoken answers to 2 reported Data Structures & Algorithms question(s), under time.
07Answer out loud: Web Development & Frameworks
- Answer aloud, timed: What are Higher-Order Components (HOCs) in React?
- Answer aloud, timed: Explain the lifecycle of a component in React.
Deliverable: Spoken answers to 2 reported Web Development & Frameworks 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 API calls and manage state (e.g., Redux) in a large application?
How do you handle API calls and manage state (e.g., Redux) in a large application?
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 callers you do not own that their integration breaks
A field in a write endpoint's response must change shape. You own the endpoint; you do not own the four internal callers or the outbound webhook consumers who read it. Describe a deprecation you were responsible for: what you shipped first, how you established who was actually reading the field, the window you gave and what set its length, what you did about the consumer who never moved, and how you decided removal was safe. Name the signal you used, not the announcement you sent.
Approach
- Establish the reader set empirically rather than from a wiki of owners: per-field usage counters keyed by principal, or access logs attributed to a consumer. State the blind spot of whichever you pick, since a consumer that reads the field only on a monthly job will not appear in a week of logs.
- Ship additive first. Populate the new field alongside the old one so no reader is forced to move, which is also what keeps a rolling deploy safe, because old and new instances answer the same requests at the same time and a rollback must still find the old shape present.
- Set the window from the slowest legitimate consumer's release cadence, not from your calendar, and decide separately what to do for a consumer with no release process at all, such as an external webhook endpoint you can only email.
- Convert silence into evidence before you rely on it: a short, low-traffic removal window that makes a still-dependent consumer fail visibly and loudly while you are watching, rather than at three in the morning after you have moved on.
Follow-up
- How would you detect a consumer that reads the field only during a monthly export?
- One caller refuses to move and has a commercial relationship behind it. What changes in your plan and what does not?
Unblock an engineer without taking the keyboard
A teammate has spent two days on a job handler that occasionally writes duplicate rows. They are certain the queue is delivering twice by mistake. You suspect a lease expiring under a slow handler, so the job is running concurrently with itself. Describe how you have unblocked someone in this position: what you asked before offering a hypothesis, what you showed them rather than told them, and what you left them owning. Then say what you would do if their theory turned out to be the right one.
Approach
- Ask before diagnosing, and ask for things answerable from data they already have: the attempt count on the job rows that produced duplicates, the handler's observed duration against its lease expiry, and whether the duplicate rows share a natural key that a unique constraint could have caught.
- Teach the shape rather than the answer. A lease cannot distinguish a dead worker from a slow one, so a handler that outruns its lease is running twice by design, and deploys deliver the other half by killing handlers mid-run on every rollout. Both of their candidate theories produce identical duplicate rows, which is why the evidence has to come from timings rather than from argument.
- Hand over a checklist they execute: a natural key on every write the handler performs so the second copy collides rather than appends, the record of intent written before any external effect, a lease heartbeat while running, and the metric that shows it working.
- Keep ownership with them deliberately. Pair on the first write, then step back; if you finish it yourself you have closed one ticket and left the same person stuck on the next redelivery.
Follow-up
- How would you distinguish a genuine double-delivery from a lease expiry using only the data already stored?
- Their handler calls an external endpoint before recording that it did. What do you tell them to change first?
- 01
How do you handle API calls and manage state (e.g., Redux) in a large application?
- 02
A field in a write endpoint's response must change shape. You own the endpoint; you do not own the four internal callers or the outbound webhook consumers who read it. Describe a deprecation you were responsible for: what you shipped first, how you established who was actually reading the field, the window you gave and what set its length, what you did about the consumer who never moved, and how you decided removal was safe. Name the signal you used, not the announcement you sent.
- 03
A teammate has spent two days on a job handler that occasionally writes duplicate rows. They are certain the queue is delivering twice by mistake. You suspect a lease expiring under a slow handler, so the job is running concurrently with itself. Describe how you have unblocked someone in this position: what you asked before offering a hypothesis, what you showed them rather than told them, and what you left them owning. Then say what you would do if their theory turned out to be the right one.
How long does the interview process typically take?
The process is generally fast, but it can vary based on the team's needs. From the initial screening to a final decision, expect the process to move within a few weeks, provided you are responsive and available for the scheduled rounds.
iProgrammer Software Engineer candidate reports ↗Is there a specific emphasis on competitive programming?
While you do not need to be a competitive programmer, you must be comfortable with "LeetCode-style" easy to medium problems. The focus is on your logic and the ability to write code without the support of an IDE.
iProgrammer Software Engineer candidate reports ↗What is the best way to prepare for the technical assessment?
Focus on practicing basic coding problems in your language of choice on paper. Ensure you are comfortable with common algorithms (sorting, searching) and core concepts (OOPS, DBMS).
iProgrammer Software Engineer candidate reports ↗How can I stand out in the interview?
Successful candidates are those who communicate their thought process clearly. Even if you don't reach the perfect solution immediately, showing the interviewer *how* you approach the problem is often more important than the final code.
iProgrammer Software Engineer candidate reports ↗What topics does iProgrammer test in interviews?
iProgrammer interviews most often cover B2B Sales (Account Executive), Java, Object-Oriented Programming (OOP) / OOP Concepts, Data Structures & Algorithms (DSA), and Native vs Hybrid Mobile Strategy. The exact emphasis depends on the specific role you apply for.
iProgrammer 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.
- 01iProgrammer 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.
Virtusa Software Engineer Interview Guide
What Virtusa asks Software Engineer candidates, from reported rounds and questions.
Trepp Software Engineer Interview Guide
What Trepp asks Software Engineer candidates, from reported rounds and questions.
Tipalti Software Engineer Interview Guide
What Tipalti asks Software Engineer candidates, from reported rounds and questions.
Side Software Engineer Interview Guide
What Side asks Software Engineer candidates, from reported rounds and questions.