Persistent Systems Interview Questions for Freshers

Quick answer: Persistent Systems fresher hiring usually starts with an online assessment (CS fundamentals MCQs, aptitude, English and coding problems). Strong scorers may get an additional advanced coding round, followed by one or two technical interviews and an HR interview. Compared with many IT services companies, Persistent puts more weight on data structures and clean code, so prepare DSA seriously.

Check open roles and campus updates on the official Persistent careers site (checked on 3 October 2026). Round names and order vary between campus and off-campus drives.

Persistent selection process for freshers

Online assessment: MCQs on data structures, OOP, DBMS, OS and networks, plus aptitude and English, and usually two coding problems. Clear logic and passing hidden test cases matter more than speed alone.

Advanced coding: some drives invite top scorers to solve harder DSA problems, which can lead to a higher-package role. Technical interviews: expect to write code live and explain complexity. HR: motivation, location and joining questions.

Coding and DSA questions with approaches

Q: Find two numbers in an array that add up to a target. A: Scan once with a hash map from value to index. For each element x, check whether target - x is already in the map; if so, return both indices, otherwise store x. Time O(n), space O(n). The brute force double loop is O(n^2).

Q: Find the longest substring without repeating characters. A: Use a sliding window with a map of each character's last index. Move the right end forward; when a character repeats inside the window, move the left end just past its previous index. Track the maximum window length. Time O(n).

Q: When can you use binary search? A: When the search space is sorted or the condition is monotonic (false, false, true, true). It halves the space each step, so it is O(log n). Watch the mid calculation and loop boundaries to avoid infinite loops.

Q: Detect a cycle in a linked list. A: Floyd's method: move a slow pointer one step and a fast pointer two steps. If they meet, there is a cycle; if fast reaches null, there is none. O(n) time, O(1) space.

Q: How does a HashMap work in Java? A: It stores entries in an array of buckets. The key's hashCode picks a bucket; collisions are stored in a list that turns into a balanced tree when a bucket gets large. equals() finds the exact key. When the load factor (0.75 by default) is exceeded, the table resizes and entries are rehashed. Average get and put are O(1).

CS fundamentals with short model answers

Q: What are ACID properties? A: Atomicity means a transaction happens fully or not at all. Consistency means it moves the database from one valid state to another. Isolation means concurrent transactions do not see each other's partial work. Durability means committed data survives a crash.

Q: What is an index and when can it hurt? A: An index is a data structure, often a B-tree, that speeds up lookups on a column. It costs extra storage and slows inserts and updates, so index columns used in frequent filters and joins, not every column.

Q: What is a deadlock? A: Two or more processes wait for each other's resources forever. It needs four conditions together: mutual exclusion, hold and wait, no preemption and circular wait. Breaking any one, for example by acquiring locks in a fixed order, prevents it.

HR questions and preparation

Q: Why Persistent? A: Point to something specific: its focus on product engineering and digital services, the technology your role uses, or the learning path for freshers. Q: Tell me about your project. A: Problem, your role, stack choice, one hard bug and one measurable result, in two minutes.

Prep plan:

Days 1-3: two DSA problems a day on hashing, two pointers, sliding window and linked lists, explained aloud.
Day 4: binary search and recursion.
Day 5: DBMS, OS and OOP revision.
Day 6: project story and HR answers.
Day 7: a timed mock with a live coding problem.

CrackInterviewAI is a Windows 10/11 app that turns a spoken, typed or screenshot question into a short answer outline, using your resume, role and job-description context. New accounts get 15 free minutes; after that, India base prices start at Rs 99 for 30 minutes and Rs 299 for 3 hours, prepaid with no auto-renewal. Use it to rehearse these questions aloud before the interview, then say every answer in your own words. Do not use live help in a proctored assessment or any round whose rules prohibit it.

For more coding practice see the DSA preparation guide and online coding assessment tips.

Rehearse the Persistent technical round

Practise explaining approaches and complexity out loud with screenshot and voice input. 15 free minutes on Windows.

Download for Windows · See plans from Rs 99

Frequently asked questions

What are the rounds in Persistent Systems fresher hiring?

Usually an online assessment with CS MCQs, aptitude and coding, an optional advanced coding round for top scorers, one or two technical interviews and an HR interview.

Is the Persistent coding round difficult?

It is usually harder than at many services companies. Expect easy-to-medium DSA problems with hidden test cases; practise hashing, sliding window, two pointers and linked lists.

Which topics matter most for the Persistent technical interview?

Data structures, time complexity, OOP, DBMS (ACID, indexing, joins), OS basics and your own project. Expect to write code and explain its complexity.

Can I prepare for Persistent interviews with AI?

Yes, for practice. CrackInterviewAI turns typed, spoken or screenshot questions into short outlines on Windows, with 15 free minutes for new accounts. Do not use live help in proctored tests.

Keep exploring

Return to the CrackInterviewAI homepage to download the Windows app, or browse all guides on the interview prep blog.

Persistent Systems Interview Questions for Freshers: Coding, Technical and HR (2026)