Persistent Systems Limited interview experience Real time questions & tips from candidates to crack your interview
Software Engineer
Persistent Systems Limited
4 rounds | 5 Coding
problems
Selected Interview preparation journey
Preparation
Duration: 1 month
Topics: OOPS, Data Structure(Stack, Queue, Linked List, Tree mainly)
Tip 1 : focus mainly on the oops concept in very details
Tip 2 : data structures questions on the tree and linked list
Application process
Where: Linkedin
Eligibility: above 7 cgpa
Tip 1 : Having a project is a must.
Tip 2 : good to share if you have any past experience of hackathon or internship.
Interview rounds
01
Round
Easy
Online Coding Interview
Duration90 minutes
Interview date19 Nov 2020
Coding problem2
The exam was in the day at noon. The exam consisted of some MCQ questions from technical subjects and some questions from math and reasoning.
1.Technical test: questions were from basic data structure, DBMS, oops, c and computer networks.
2. Aptitude: Questions were from math and reasoning like work problems, pipe problems, age problems, etc.
3. English: It had some reading compressions and spotting the error questions of easy level.
3. Coding round: This consisted of two questions that were to be solved in 45 mins.
1. Implement indexOf()
Moderate
25m average time
70% success
0/80
Asked in companies
You are given two strings A and B. Find the index of the first occurrence of A in B. If A is not present in B, then return -1.
For Example:
A = “bc”, B = “abcddbc”.
String “A” is present at index 1, and 5(0-based index), but we will return 1 as it is the first occurrence of “A” in string “B”.
Follow Up:
Can you solve this in linear time and space complexity?
2. First non repeating character
Easy
15m average time
80% success
0/40
Asked in companies
Ninja is now bored with numbers and is now playing with characters but hates when he gets repeated characters. Ninja is provided a string, and he wants to return the first unique character in the string.The string will contain characters only from the English alphabet set, i.e., ('A' - 'Z') and ('a' - 'z'). If there is no non-repeating character, print the first character of the string. If there is no non-repeating character, return the first character of the string.
02
Round
Medium
Video Call
Duration40 minutes
Interview date28 Nov 2020
Coding problem1
The interview was scheduled in the morning.
The interviewer asked me back to back questions based on oops concepts, data structure and DBMS.
1.What is Constructor
2.Properties of constructor
3.What is constructor and syntax
4.difference between java and c++
5.Java version I am using currently.
6.Difference between JDK and JRE.
7.Abstract class and method
8.Abstraction
9.Encapsulation
10.What is Data structures and types
11.Push pop operations of stack
12.Array and LinkedList difference
13.Transaction and types of transaction in DBMS
14.Normalisation and explain its types
15.Triggers in DBMS
16.How Transaction is control
17.Joins
18.TCP and UDP difference
19.Http what is protocols and it's port no
20.Proxy server
21.Layers of tcp/ip
1. LCA In A BST
Moderate
15m average time
85% success
0/80
Asked in companies
You are given a binary search tree of integers with N nodes. You are also given references to two nodes 'P' and 'Q' from this BST.
Your task is to find the lowest common ancestor(LCA) of these two given nodes.
The lowest common ancestor for two nodes P and Q is defined as the lowest node that has both P and Q as descendants (where we allow a node to be a descendant of itself)
A binary search tree (BST) is a binary tree data structure which has the following properties.
• The left subtree of a node contains only nodes with data less than the node’s data.
• The right subtree of a node contains only nodes with data greater than the node’s data.
• Both the left and right subtrees must also be binary search trees.
For example:
'P' = 1, 'Q' = 3
tree = 2 1 4 -1 -1 3 -1 -1 -1,
The BST corresponding will be-
Here, we can clearly see that LCA of node 1 and node 3 is 2.
03
Round
Medium
Video Call
Duration30 minutes
Interview date28 Nov 2020
Coding problem1
The interview was scheduled for the evening on the same day.
He again asked me questions on topics from oops and Data Structure.
1. encapsulation
2. polymorphism
3. constructor can be inherited or not,
4. Difference between HashSet & tree set
5. What is the concurrent collection and synchronized collection
6., Difference between abstract and interface,
7.can abstract method be private or static
8. what is 2 nf ,
9.what is overloading
10. What is a linked list.
11. Then, he asked me how can I detect a loop in a liked list.
Coding-detect a loop in a linked list.
12. After the coding question was done he asked me the complexity of my solution.
13. Finally, he said if I had any questions for him.
I said no and the interview ended.
1. Cycle Detection in a Singly Linked List
Moderate
15m average time
80% success
0/80
Asked in companies
You are given a Singly Linked List of integers. Return true if it has a cycle, else return false.
A cycle occurs when a node's next points back to a previous node in the list.
Example:
In the given linked list, there is a cycle, hence we return true.
04
Round
Easy
HR Round
Duration10 minutes
Interview date30 Nov 2020
Coding problem1
The interview was at the noon
He asked me to Introduce Myself and asked few basic questions.
1. Basic HR Questions
Introduce yourself.
Do you know anyone who works for us?
Why should we hire you?
Problem approach
Tip 1 : Be confident.
Tip 2 : Speak fluently.
Here's your problem of the day 
Solving this problem will increase your chance to get selected in this company
Skill covered: Programming
What is recursion?
Choose another skill to practice
Similar interview experiences
Software Engineer
3 rounds | 5 problems
Interviewed by Persistent Systems Limited
Selected 
1570 views
1 comments
0 upvotes
Analyst
3 rounds | 13 problems
Interviewed by Persistent Systems Limited
Selected 901 views
0 comments
0 upvotes
SDE - 1
3 rounds | 10 problems
Interviewed by Persistent Systems Limited
Selected 1341 views
0 comments
0 upvotes
Test Module Lead
3 rounds | 12 problems
Interviewed by Persistent Systems Limited
Selected 814 views
0 comments
0 upvotes
Companies with similar interview experiences
Software Engineer
4 rounds | 1 problems
Interviewed by Newgen Software
Selected 3210 views
2 comments
0 upvotes
Software Engineer
3 rounds | 6 problems
Interviewed by HashedIn
Selected 2582 views
0 comments
0 upvotes
Software Engineer
2 rounds | 2 problems
Interviewed by Ernst & Young (EY)
Selected 0 views
0 comments
0 upvotes