persistent systems | on-campus 2021 | online assessment questions | interview questions

Result
Offer
Posted
23 Sept 2021
317 reads

Summary

I successfully cleared all rounds of the Persistent Systems on-campus interview process in 2021 for an entry-level software role and received the highest package offered.

How it went

I participated in the Persistent Systems on-campus drive in 2021, aiming for an entry-level position. The entire process consisted of multiple rounds, starting with an initial assessment and progressing through advanced coding, technical interviews, and a super achiever round, culminating in an HR assessment. I managed to clear all rounds, eventually securing the highest package offered.

The first hurdle, Round 0, involved 50 logical reasoning and English questions, where I solved approximately 40. This was followed by two very easy coding questions, both of which I successfully completed. Surprisingly, I wasn't interviewed in this technical round.

Following a strong performance, I was invited to the Advanced Coding Round OA which was designated for high-performers, targeting a 7.5 LPA package. This round featured two coding questions to be solved within 60 minutes. The first problem required converting one binary string to another by reversing substrings, with a constraint on increasing substring size; I solved this. The second problem, on finding the edge part of the maximum number of simple paths in an undirected graph, was more challenging, and I couldn't pass all test cases.

Next was a 90-minute Technical Interview. I was asked to code two problems: printing Pascal's Triangle and sorting an integer array by frequency, preserving the original order for elements with equal frequency. Both solutions were rigorously tested with multiple test cases, and I passed. The interview also included three SQL queries: creating a table, inserting data, and finding duplicates based on two columns, which I solved using GROUP BY and HAVING. Additionally, several CS fundamental questions were posed, covering topics like heaps, selection sort, pointers vs. references, disadvantages of the waterfall model, array declaration differences in certain languages, exceptions, and the distinction between exceptions and errors. I managed to answer most of these, though I missed the array declaration difference.

After successfully clearing the previous stages, I moved to the Super Achiever Round, aiming for a 9 LPA package. This began with a Coding Round of two problems in 60 minutes. The first problem was identical to the 'Number of Islands' problem on LeetCode, which I solved. The second problem was a variation of finding connected components in an undirected graph, and while not straightforward, I also managed to solve it.

The final Interview in the Super Achiever Round was managerial and focused on advanced topics, lasting 30 minutes. I was challenged with a system design-style question on finding word frequency in a huge text file, where a naive approach (chunks + hashmap) was explicitly deemed insufficient. I also solved a simple SQL self-join problem. The CS fundamentals portion delved into Python-specific concepts like context managers and GIL (which I couldn't answer), along with recursion (types, tail recursion optimization, and efficiency compared to loops), network architecture layers, reliable transmission, and functions of transport/network layers. Database questions included RDBMS indexes and their types (I missed the types). Since I mentioned ML on my resume, I was asked to explain the bias-variance tradeoff and normalization, both of which I answered.

Finally, the HR round was a 15-minute assessment of 50 objective, situational questions, which apparently everyone passes.

I am pleased to report that I successfully navigated all these rounds and received an offer with the highest package.

Questions asked (30)

  1. 01

    Convert Binary String by Reversing Substrings

    Data Structures & Algorithms

    Given two binary strings (strings of '0's and '1's) A and B. Convert string A to string B by selecting any substring and reversing it. The size of the substring selected in the current operation must be greater than the previously selected substring size. Find the minimum number of steps required.

    Open the problem
  2. 02

    Edge in Graph with Max Simple Paths

    Data Structures & Algorithms

    Given an undirected graph, find the edge which is part of the maximum number of simple paths.

  3. 03

    Print Pascal Triangle

    Data Structures & Algorithms · Easy

    Write code to print the Pascal's Triangle.

  4. 04

    Sort Array by Frequency with Order Preservation

    Data Structures & Algorithms · Medium

    Given an integer array, sort the elements by frequency. If the frequency is the same, then the element which occurs first in the original array comes first in the sorted array.

  5. 05

    SQL: Create Table

    Other · Easy

    Write a SQL query to create a table.

  6. 06

    SQL: Insert into Table

    Other · Easy

    Write a SQL query to insert data into a table.

  7. 07

    SQL: Find Duplicates by Two Columns

    Other · Medium

    Given a table with three columns, write a SQL query to find duplicates with respect to the first two columns. (Hint: can be solved using GROUP BY and HAVING clause).

  8. 08

    What are Heaps?

    Data Structures & Algorithms · Easy

    What are heaps?

  9. 09

    Explain Selection Sort

    Data Structures & Algorithms · Easy

    Explain the Selection Sort algorithm.

  10. 10

    Pointers vs. References (C++)

    Other · Medium

    What is the difference between pointers and references (assuming C++ context)?

  11. 11

    Disadvantages of Waterfall Model

    Other · Easy

    What are the disadvantages of the Waterfall model?

  12. 12

    Array Declaration Syntax (Java/C#)

    Other · Medium

    What is the difference between int var[]; and int[] var;?

  13. 13

    What are Exceptions?

    Other · Easy

    What are exceptions?

  14. 14

    Exceptions vs. Errors

    Other · Medium

    What are the differences between exceptions and errors?

  15. 15

    Number of Islands

    Data Structures & Algorithms · Medium

    The problem was the same as the 'Number of Islands' problem on LeetCode.

    Open the problem
  16. 16

    Variation of Connected Components in Undirected Graph

    Data Structures & Algorithms · Medium

    A variation of finding connected components in an undirected graph, which was not as straightforward as the previous problem.

  17. 17

    Word Frequency in Huge Text File

    System Design · Hard

    Given a huge text file, how would you find word frequency? (Note: reading the file in chunks and using a hashmap was not the desired approach.)

  18. 18

    SQL Self Join Problem

    Other · Easy

    A simple problem requiring the use of SQL self join.

  19. 19

    What is Context Manager in Python?

    Other · Medium

    What is a context manager in Python?

  20. 20

    What is GIL in Python?

    Other · Hard

    What is the Global Interpreter Lock (GIL) in Python?

  21. 21

    What is Recursion?

    Data Structures & Algorithms · Easy

    What is recursion?

  22. 22

    Types of Recursion & Tail Recursion Optimization

    Data Structures & Algorithms · Hard

    What are the different kinds of recursion? How is tail recursion made equivalent to a while loop by the compiler?

  23. 23

    While Loop vs. Recursion Efficiency

    Other · Medium

    How is a while loop generally more efficient with respect to recursion?

  24. 24

    Layers in Network Architecture

    Other · Medium

    What are the layers in a network architecture (e.g., OSI model or TCP/IP model)?

  25. 25

    Reliable Transmission Layer

    Other · Easy

    Which layer in network architecture is responsible for reliable transmission?

  26. 26

    Functions of Transport and Network Layers

    Other · Medium

    What are the functions of the Transport Layer and Network Layer in network architecture?

  27. 27

    What are Indexes in RDBMS?

    Other · Medium

    What are indexes in a Relational Database Management System (RDBMS)?

  28. 28

    Types of Indexes in RDBMS

    Other · Hard

    What are the different kinds of indexes in RDBMS?

  29. 29

    Explain Bias-Variance Tradeoff

    Other · Medium

    Explain the bias-variance tradeoff in machine learning.

  30. 30

    Explain Normalization (ML/Statistics)

    Other · Medium

    Explain normalization (in the context of machine learning or statistics).

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at Persistent Systems recently?

Write up your rounds while you still remember the questions. It helps the next person more than you would think.

Share your experience
Discussion 0

Questions for the author, or how your own interview compared.

Join the discussion

Sign in with Google to comment or ask the author a question.

No comments yet

Be the first to share your thoughts and start the discussion!