Persistent Systems · Software Engineer
Updated · 2026-10-02

Persistent Systems Software Engineer
Interview Guide

THE 60-SECOND BRIEF

At Persistent Systems, a Software Engineer plays a pivotal role in driving digital transformation and software product engineering for global enterprises. The company specializes in helping businesses modernize their legacy systems, transition to cloud-native architectures, and integrate cutting-edge technologies like generative AI, Salesforce, and enterprise integration platforms. As a developer here, you are not just writing code; you are building highly scalable, secure, and resilient software that powers critical operations in healthcare, banking, financial services, and telecommunications. The impact of your work is immediate and far-reaching. You will contribute to high-performance engineering teams that design microservices, manage complex data pipelines, and deploy secure APIs.

This guide is scoped to a Software Engineer candidate at Persistent Systems.

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

Data Structures & Algorithms (DSA)Live CodingObject-Oriented Programming (OOP/OOPS)

25 min read

Browse Software Engineer questions

See the practice prompts

1Candidate experiences ↗Read their reports
24Practice promptsAcross five skill areas

At Persistent Systems, a Software Engineer plays a pivotal role in driving digital transformation and software product engineering for global enterprises. The company specializes in helping businesses modernize their legacy systems, transition to cloud-native architectures, and integrate cutting-edge technologies like generative AI, Salesforce, and enterprise integration platforms. As a developer here, you are not just writing code; you are building highly scalable, secure, and resilient software that powers critical operations in healthcare, banking, financial services, and telecommunications. The impact of your work is immediate and far-reaching. You will contribute to high-performance engineering teams that design microservices, manage complex data pipelines, and deploy secure APIs. Whether you are working on a custom product development lifecycle or optimizing an enterprise application on AWS, Azure, or GCP, your engineering decisions directly affect system reliability and client success. Persistent Systems offers a unique environment where you can work across diverse tech stacks—ranging from Java/Spring Boot and Go to React, Node.js, and Salesforce. The scale of projects requires engineers to be highly adaptable, structurally disciplined, and capable of collaborating directly with global clients. This blend of product engineering rigor and consulting-style client exposure makes the role both highly challenging and exceptionally rewarding for career growth.

01

Online Assessment

reported

Candidates complete an online assessment or participate in the Persistent Martian Program for foundational training.

What to demonstrate

  • Candidates complete an online assessment or participate in the Persistent Martian Program for foundational training
  • Depth in Data Structures & Algorithms (DSA)

How to prepare

  • Answer aloud and timed: Explain the internal working of a HashMap in Java. How are collisions handled?
  • Answer aloud and timed: What are the differences between abstract classes and interfaces in Java 8? How do default and static methods change this dynamic?
Persistent Systems Software Engineer candidate reports ↗
02

Talent Acquisition Screening

reported

For experienced professionals, a screening aligns technical expertise with open projects.

What to demonstrate

  • For experienced professionals, a screening aligns technical expertise with open projects
  • Depth in Data Structures & Algorithms (DSA)

How to prepare

  • Answer aloud and timed: What is a functional interface, and how do you use Lambda expressions and the Stream API to filter a collection?
  • Answer aloud and timed: Explain the concept of a wrapper class. Why is it needed, and what are its advantages?
Persistent Systems Software Engineer candidate reports ↗
03

Technical Rounds

reported

Candidates undergo rigorous technical evaluations with junior-to-mid-level developers testing foundational knowledge.

What to demonstrate

  • Candidates undergo rigorous technical evaluations with junior-to-mid-level developers testing foundational knowledge
  • Depth in Data Structures & Algorithms (DSA)

How to prepare

  • Answer aloud and timed: How does garbage collection work in the JVM, and how can you optimize memory management in a high-concurrency application?
  • Answer aloud and timed: Write a program to find the second largest element in a given string or array.
Persistent Systems Software Engineer candidate reports ↗
04

System Design Interview

reported

Senior architects or managers assess candidates on system design and project architecture.

What to demonstrate

  • Senior architects or managers assess candidates on system design and project architecture
  • Depth in Data Structures & Algorithms (DSA)

How to prepare

  • Answer aloud and timed: Given an integer array, write an algorithm to output all possible unique combinations of the elements.
  • Answer aloud and timed: How do you reverse a string or check if a string is a palindrome without using built-in reverse functions?
Persistent Systems Software Engineer candidate reports ↗
05

Situational Problem-Solving

reported

Candidates engage in discussions to solve situational problems presented by interviewers.

What to demonstrate

  • Candidates engage in discussions to solve situational problems presented by interviewers
  • Depth in Data Structures & Algorithms (DSA)

How to prepare

  • Answer aloud and timed: Implement a basic coding solution to detect a cycle in a linked list.
  • Answer aloud and timed: Explain how you would implement a custom Stack or Queue, and write a program to print a specific star or number pattern using nested loops.
Persistent Systems Software Engineer candidate reports ↗
06

Client-Specific and Behavioral Rounds

reported

Final rounds focus on client-specific needs and behavioral assessments.

What to demonstrate

  • Final rounds focus on client-specific needs and behavioral assessments
  • Depth in Data Structures & Algorithms (DSA)

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 client-specific and behavioral rounds above and write down what you would ask to confirm before it.
Persistent Systems Software Engineer candidate reports ↗

1 candidate reports. Individual accounts describe a particular role and hiring cycle.

Software Engineer

Persistent Systems Software Engineer transparent interview experience

Technical Screen

The process felt smooth from beginning to end. Recruiter communication was timely, and each step was transparent about what would happen next. The interviewers were professional and made the conversations comfortable. I discussed my background and the expertise they wanted, as well as past work and career goals. The tone stayed relaxed even when questions became more specific. I did not get an of…

Read full experience

PracHub editorial advice for the preparation topics above.

01

Master Java 8+ Features

If you are interviewing for a Java role, expect extensive questions on Streams, Lambda expressions, Optional class, and default methods. Interviewers will specifically ask you to solve coding problems using Stream APIs.

02

Be Prepared for Live Coding

Do not rely on IDE auto-complete. Practice writing code on basic text editors, Google Docs, or paper, paying attention to correct syntax, variable naming, and logical structure.

03

Ensure every detail on your resume is completely accurate and verifiable

Persistent Systems has a very strict Background Verification (BGV) process. Any discrepancies in employment history, academic records, or experience can lead to immediate disqualification, even after clearing all interviews.

04

Structure Your Project Explanations

Use the STAR method (Situation, Task, Action, Result) to explain your past projects. Focus on the architectural decisions you made, the technical challenges you overcame, and the business impact of your deliverables.

Choose a category, try a prompt, then open its approach, worked solution or follow-up when you need it.

21 technical prompts0 include a worked solution

How does garbage collection work in the JVM, and how can you optimize memory management in a high-concurrency

medium
Core Programming & Object-Oriented Conce

How does garbage collection work in the JVM, and how can you optimize memory management in a high-concurrency application?

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?

Write a program to find the second largest element in a given string or array.

medium
Data Structures & Algorithmic Problem-So

Write a program to find the second largest element in a given string or array.

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?

Given an integer array, write an algorithm to output all possible unique combinations of the elements.

medium
Data Structures & Algorithmic Problem-So

Given an integer array, write an algorithm to output all possible unique combinations of the elements.

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?

How do you reverse a string or check if a string is a palindrome without using built-in reverse functions?

medium
Data Structures & Algorithmic Problem-So

How do you reverse a string or check if a string is a palindrome without using built-in reverse 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?

Implement a basic coding solution to detect a cycle in a linked list.

medium
Data Structures & Algorithmic Problem-So

Implement a basic coding solution to detect a cycle in a linked list.

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?

Explain how you would implement a custom Stack or Queue, and write a program to print a specific star or numbe

medium
Data Structures & Algorithmic Problem-So

Explain how you would implement a custom Stack or Queue, and write a program to print a specific star or number pattern using nested loops.

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?

Explain the concept of database indexing. How does it speed up search queries, and what are its drawbacks?

medium
Databases & SQL

Explain the concept of database indexing. How does it speed up search queries, and what are its drawbacks?

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?

Built from the rounds and topics Persistent Systems candidates report.

Small steps. Visible outcomes.0 / 7 completed
ONE WEEK · YOUR PACE

Prepare, practise & reflect

One practical outcome each day. Spend longer where you need it.

0 / 7 done
01Map the Persistent Systems loop
  • Write out the reported sequence: Online Assessment, Talent Acquisition Screening, Technical Rounds, System Design Interview, Situational Problem-Solving, Client-Specific and Behavioral 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 6 reported rounds, with the weakest marked.

02Work Data Structures & Algorithms (DSA)
  • Spend the session on Data Structures & Algorithms (DSA), which Persistent Systems 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).

03Work Live Coding
  • Spend the session on Live Coding, which Persistent Systems candidates report being tested on.
  • Write one worked example in Live Coding and time yourself on it.

Deliverable: One timed worked example in Live Coding.

04Work Object-Oriented Programming (OOP/OOPS)
  • Spend the session on Object-Oriented Programming (OOP/OOPS), which Persistent Systems candidates report being tested on.
  • Write one worked example in Object-Oriented Programming (OOP/OOPS) and time yourself on it.

Deliverable: One timed worked example in Object-Oriented Programming (OOP/OOPS).

05Answer out loud: Core Programming & Object-Oriented Concepts
  • Answer aloud, timed: Explain the internal working of a `HashMap` in Java. How are collisions handled?
  • Answer aloud, timed: What are the differences between abstract classes and interfaces in Java 8? How do default and static methods change this dynamic?

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

06Answer out loud: Data Structures & Algorithmic Problem-Solving
  • Answer aloud, timed: Write a program to find the second largest element in a given string or array.
  • Answer aloud, timed: Given an integer array, write an algorithm to output all possible unique combinations of the elements.

Deliverable: Spoken answers to 2 reported Data Structures & Algorithmic Problem-Solving question(s), under time.

07Answer out loud: Databases & SQL
  • Answer aloud, timed: Write an SQL query to find the second highest salary of an employee using a subquery or a window function.
  • Answer aloud, timed: Explain the differences between various SQL joins (Inner, Left, Right, Full) and write a query demonstrating a self-join.

Deliverable: Spoken answers to 2 reported Databases & SQL 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.

Turn a code review disagreement into a decision

easy
code reviewoptimistic concurrencycommunication

A colleague's change updates a row with UPDATE resource SET version = version + 1 WHERE resource_id = $1 AND version = $2 and treats an affected-row count of zero as a successful no-op. You read that as a silently lost update; they think returning 200 is friendlier to clients than returning a conflict. Describe how you have handled a review disagreement of this shape: what goes in the comment, when you leave the thread, and who decides. Then write the comment you would leave here, in under 80 words.

Approach
  1. Sort the disagreement before writing anything. A silently discarded write is a correctness claim about data; the choice between 409 and 412 is taste. Only the first justifies blocking a merge, and saying which one you are doing is most of the value of the comment.
  2. Make the claim reproducible in the comment itself with an interleaving rather than a principle: A reads version 7, B reads version 7, B commits version 8, A's predicate matches zero rows, A is told it succeeded and A's edit is gone.
  3. Offer the alternative with its cost attached: return 409 carrying the current version and the revision that won, so the client can re-read and re-apply. Note that automatic retry is not the fix, because a retry re-reads the winner's state and reapplies an intent formed against data that no longer exists.
  4. Apply an escalation rule you can state: two round trips on the thread, then a call, and the service's owner decides rather than the reviewer. A reviewer who cannot be overruled is a bottleneck with extra steps.
Follow-up
  • Where would you put the test that fails if someone reintroduces the swallowed zero rowcount?
  • The author says clients cannot handle a 409. How do you check whether that is true?

Unblock an engineer without taking the keyboard

easy
mentoringleasesat-least-once

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

Narrate an outage you owned from page to postmortem

hard
incident responseblast radiuspostmortems

Pick an incident you personally drove, ideally one where writes were affected rather than reads. In six to eight minutes: state the symptom as it first appeared on a dashboard, the blast radius you established before you knew the cause, the mitigation you applied and when, the mechanism you eventually proved, and the follow-up that would prevent a repeat. Bring numbers: error rate, tenants affected, minutes to mitigate, minutes to resolve. If you cannot name what you measured, choose a different incident.

Approach
  1. Open on the signal rather than the cause: which metric at which percentile moved, on which service, at what time, so the listener follows the same evidence you had rather than a conclusion you already reached.
  2. Separate mitigation from diagnosis out loud. State what you did to stop the bleeding (flag off, shed traffic, drain a lease, roll back a deploy) and say plainly that you did it before the mechanism was known, because those are two jobs with different deadlines.
  3. Establish blast radius in countable terms: how many tenants, how many writes, and crucially whether the effect was loss or only delay. An append-only revision table or a pending outbox row means the change survived and the projection was merely behind, which is a repair rather than a data-loss incident.
  4. Prove the mechanism instead of asserting it. Name the trace span that grew, the plan that flipped to a sequential scan, the lease that expired, plus one alternative you ruled out and the signal that stayed flat while you ruled it out.
Follow-up
  • What would you do differently in the first five minutes, given the same dashboard and no more information?
  • Which follow-up action did you deliberately not take, and why was dropping it the right call?
  • 01

    A colleague's change updates a row with UPDATE resource SET version = version + 1 WHERE resource_id = $1 AND version = $2 and treats an affected-row count of zero as a successful no-op. You read that as a silently lost update; they think returning 200 is friendlier to clients than returning a conflict. Describe how you have handled a review disagreement of this shape: what goes in the comment, when you leave the thread, and who decides. Then write the comment you would leave here, in under 80 words.

  • 02

    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.

  • 03

    Pick an incident you personally drove, ideally one where writes were affected rather than reads. In six to eight minutes: state the symptom as it first appeared on a dashboard, the blast radius you established before you knew the cause, the mitigation you applied and when, the mechanism you eventually proved, and the follow-up that would prevent a repeat. Bring numbers: error rate, tenants affected, minutes to mitigate, minutes to resolve. If you cannot name what you measured, choose a different incident.

PracHub preparation framework ↗
How difficult is the Software Engineer interview at Persistent Systems?

The interview difficulty is generally rated as average to difficult. Foundation-level rounds (L1) focus on straightforward programming, OOPs, and databases, while advanced rounds (L2 and Managerial) dive deep into framework internals, live coding, and scenario-based architecture questions. Thorough preparation of core CS subjects and hands-on coding is essential.

Persistent Systems Software Engineer candidate reports ↗
What is the typical timeline from the first interview to an offer?

The technical rounds and HR discussions are often conducted rapidly, sometimes within 2 to 3 days or even on the same day during walk-in or campus drives. However, the post-interview background verification (BGV) and official offer release process can take anywhere from 2 weeks to a month. Consistent follow-up with your recruiter is recommended during this phase.

Persistent Systems Software Engineer candidate reports ↗
Does Persistent Systems require a client interview?

Yes, for many lateral hires and specialized roles (such as Salesforce, MuleSoft, or Cloud developers), clearing the internal technical rounds is followed by a Client Interview. The client round focuses heavily on your project experience, communication, and how your skills align with their specific environment.

Persistent Systems Software Engineer candidate reports ↗
What is the hybrid or remote work policy for Software Engineers?

Persistent Systems generally operates on a hybrid work model, requiring employees to work from one of their major offices (such as Pune, Bengaluru, Hyderabad, Nagpur, or Mumbai) for a set number of days per week. Specific arrangements depend on the project requirements and client compliance guidelines.

Persistent Systems Software Engineer candidate reports ↗
What topics does Persistent Systems test in interviews?

Persistent Systems interviews most often cover Problem Solving, Python, SQL, Stakeholder Management, and Incident Response. The exact emphasis depends on the specific role you apply for.

Persistent Systems 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.