All company sheets
Persistent Systems logo

Persistent Systems DSA interview questions

27 problems to practise before your Persistent Systems online test or coding round. Most widely asked first.

27
Questions
8
Easy
19
Medium
0
Hard

Good practice. Problems at the level of this company’s online test and coding round. Treat it as a practice set, not a leak. These are Astra’s own tags, not an official question list.

27 questions

  1. 1

    Determine if a Binary Tree is Symmetric

    EasyRecursionTagged at 7 companies
  2. 2

    Find the Floor and Ceiling of a Number in a Sorted Array

    EasyBinary SearchTagged at 7 companies
  3. 3

    Find the Transpose of a 2D Matrix

    EasyArrayTagged at 7 companies
  4. 4

    Maximum Average Subarray I

    EasySliding WindowTagged at 7 companies
  5. 5

    Swap Every Two Adjacent Nodes in a Linked List

    MediumRecursionTagged at 7 companies
  6. 6

    Find Index of First 1 in an Infinite Binary Sorted Array

    MediumBinary SearchTagged at 7 companies
  7. 7

    Find Smallest Common Element in All Rows

    MediumBinary SearchTagged at 7 companies
  8. 8

    Count All Nodes in a Complete Binary Tree

    MediumBinary SearchTagged at 7 companies
  9. 9

    Rotate a 2D Matrix Image by 90 Degrees In-Place

    MediumArrayTagged at 7 companies
  10. 10

    Find Minimum Jumps to Reach End of Array (Jump Game II)

    MediumArrayTagged at 7 companies
  11. 11

    Malware Signature Detection

    MediumSliding WindowTagged at 7 companies
  12. 12

    Valid Parentheses

    EasyStringTagged at 6 companies
  13. 13

    Merge Two Sorted Linked Lists Iteratively

    EasyLinkedListTagged at 6 companies
  14. 14

    Delete a Node in a Doubly Linked List

    EasyLinkedListTagged at 6 companies
  15. 15

    Check if a Linked List is Identical to Another

    EasyLinkedListTagged at 6 companies
  16. 16

    Longest Substring Without Repeating Characters

    MediumStringTagged at 6 companies
  17. 17

    Kth Smallest Element in a BST

    MediumTreeTagged at 6 companies
  18. 18

    Design a Stack with Increment Operation Support

    MediumStack and QueueTagged at 6 companies
  19. 19

    Clone an Undirected Graph Using BFS or DFS

    MediumStack and QueueTagged at 6 companies
  20. 20

    Sort a Linked List Using Merge Sort

    MediumLinkedListTagged at 6 companies
  21. 21

    Sort a Linked List Using Insertion Sort

    MediumLinkedListTagged at 6 companies
  22. 22

    Implement a Basic Circular Linked List

    MediumLinkedListTagged at 6 companies
  23. 23

    Convert a Binary Search Tree to a Sorted Circular Doubly Linked List

    MediumTreeTagged at 6 companies
  24. 24

    Simplify a Unix-Style Absolute File System Path

    MediumStringTagged at 6 companies
  25. 25

    Implement a Basic Calculator with '+' and '-'

    MediumStringTagged at 6 companies
  26. 26

    Reorganize String to Avoid Adjacent Duplicates

    MediumStringTagged at 6 companies
  27. 27

    Find the Longest Palindromic Subsequence (LPS)

    MediumStringTagged at 6 companies

More company sheets