hirecept

Persistent Systems: Software Engineer

Persistent Systems' fresher process is described as an online test with aptitude, technical MCQs and coding, followed by a coding and essay round, two technical interviews and an HR interview. Platforms and counts vary (AMCAT, HackerRank, Codility) and some sources say there is no negative marking. None of the sources is an official Persistent page, so confirm in your invitation and never pay for a job.

31 questions · 4 rounds · updated Nov 2026

How the interview works

  1. Online test: Aptitude, technical MCQs and coding; platform varies.
  2. Coding and essay round: Reported by FACE Prep before the interviews.
  3. Technical interviews: Often two rounds with project depth, OOP, DBMS and coding.
  4. HR interview: Fit, relocation and communication.

Sample questions

  • 01

    Write about 150 words: "How has software changed the way you study?"

    MediumEssay

    Model answer

    What the interviewer checks

    Personal, specific examples and a clear structure. Essays tied to your own experience read as more genuine.

    How to answer

    Sample: "Software has changed my studies in three ways. First, access: lectures I missed or didn't understand are a search away, and I learned Data Structures better from a recorded NPTEL course than from my first class. Second, practice: platforms like LeetCode give instant feedback on code, so I could fix mistakes the same day instead of waiting for a lab evaluation. Third, collaboration: my project team used Git and a shared board, so we always knew who was working on what. There are downsides. It's easy to copy answers without understanding them, and notifications split my attention. I now study in blocks with my phone away and write solutions on paper first. Overall, software hasn't replaced studying, but it has made good habits easier to build."

  • 02

    If A's salary is 25% more than B's, by what percent is B's salary less than A's?

    MediumPercentages

  • 03

    Find the maximum sum of a contiguous subarray (Kadane's algorithm). Example: [-2,1,-3,4,-1,2,1,-5,4] → 6 (the subarray [4,-1,2,1])

    MediumArrays

    Approach and solution

    Approach

    Walk the array keeping the best sum of a subarray ending here: either extend the previous one or start fresh at this element. Track the best seen. Starting with the first element (not 0) handles all-negative arrays.

    def max_subarray(a):
        best = cur = a[0]
        for x in a[1:]:
            cur = max(x, cur + x)
            best = max(best, cur)
        return best
    
    assert max_subarray([-2, 1, -3, 4, -1, 2, 1, -5, 4]) == 6
    assert max_subarray([-3, -1, -2]) == -1

    Complexity: O(n) time, O(1) space.

28 more questions, members only

  • Online test12
  • Coding and essay round5
  • Technical interviews9
  • HR interview5

Members also get how to answer each question and a preparation plan for this company.

See plans from ₹399

Every question and answer is written by Hirecept and the code is run before it is published. How a company runs its process comes from candidate reports and public pages, and companies change it, so treat that part as a guide, not a promise.