Persistent Systems interview experience Real time questions & tips from candidates to crack your interview
Salesforce Developer
Persistent Systems
3 rounds | 4 Coding
problems
Selected Interview preparation journey
Journey
I kept practicing DSA and CS fundamentals from the 3rd year of Engineering. I was confident in both DSA and development but even then, I kept on revising the concepts.
Application story
This company visited to my campus for the placement. We just had to upload resume and fill all details in the form. First, they took the online assessment. Later, they called us for the interview rounds.
Why selected/rejected for the role?
I was selected because I had developed skills like DSA, problem-solving, and Logical building ability. I also prepared for the HR round because all the questions asked in the HR round I was already familiar with them.
Preparation
Duration: 6 months
Topics: Data Structures, OOPS, System Design, Algorithms, Dynamic Programming, OS, DBMS
Tip 1 : Participate in live contests on websites like Codechef, Codeforces, etc as much as possible.
Tip 2 : Practice previous interview questions from LeetCode, GeeksForGeeks.
Tip 3 : Revise Computer Science subjects like DBMS, OOPS thoroughly.
Application process
Where: Campus
Eligibility: Above 7 CGPA
Tip 1: Only write those things in the resume which you are confident of and keep practicing.
Tip 2: Add projects and Internships if you have done any and add only those things which you really know.
Interview rounds
01
Round
Medium
Online Coding Interview
Duration90 mins
Interview date16 Jan 2021
Coding problem1
1. Check Permutation
Easy
15m average time
85% success
0/40
Asked in companies
You have been given two strings 'STR1' and 'STR2'. You have to check whether the two strings are anagram to each other or not.
Note:
Two strings are said to be anagram if they contain the same characters, irrespective of the order of the characters.
Example :
If 'STR1' = “listen” and 'STR2' = “silent” then the output will be 1.
Both the strings contain the same set of characters.
Problem approach
I simply used hashing to solve this problem by checking the frequency of characters in both strings.
02
Round
Medium
Face to Face
Duration60 mins
Interview date23 Jan 2021
Coding problem1
1. Next Greater Number
Moderate
15m average time
90% success
0/80
Asked in companies
You are given a string S which represents a number. You have to find the smallest number strictly greater than the given number which contains the same set of digits as of the original number i.e the frequency of each digit from 0 to 9 should be exactly the same as in the original number.
For example:
If the given string is 56789, then the next greater number is 56798. Note that although 56790 is also greater than the given number it contains 1 '0' which is not in the original number and also it does not contain the digit '8'.
Note:
The given string is non-empty.
If the answer does not exist, then return -1.
The given number does not contain any leading zeros.
Problem approach
I have done this question earlier so just use already built algorithm which traverses the number from the back.
03
Round
Easy
HR Round
Duration45 mins
Interview date26 Jan 2021
Coding problem2
1. HR Question
Tell me about yourself.
Problem approach
I gave him my basic introduction with skills.
2. HR Question
Why should we hire you?
Who is your role model?
Here's your problem of the day 
Solving this problem will increase your chance to get selected in this company
Skill covered: Programming
To make an AI less repetitive in a long paragraph, you should increase:
Choose another skill to practice
Similar interview experiences
Software Engineer
4 rounds | 5 problems
Interviewed by Persistent Systems
Selected 
1993 views
0 comments
0 upvotes
Software Engineer
3 rounds | 5 problems
Interviewed by Persistent Systems
Selected 1564 views
1 comments
0 upvotes
Test Module Lead
3 rounds | 12 problems
Interviewed by Persistent Systems
Selected 806 views
0 comments
0 upvotes
SDE - 1
2 rounds | 3 problems
Interviewed by Persistent Systems
Selected 939 views
0 comments
0 upvotes