All company sheets
Postman logo

Postman DSA interview questions

48 problems to practise before your Postman online test or coding round. Most widely asked first.

48
Questions
7
Easy
31
Medium
10
Hard

Commonly reported. Problems candidates often report from this company’s coding rounds. These are Astra’s own tags, not an official question list.

48 questions

  1. 1

    Reverse a String Using Recursion

    EasyRecursionTagged at 7 companies
  2. 2

    Solve the Classic Tower of Hanoi Puzzle

    EasyRecursionTagged at 7 companies
  3. 3

    Find the Search Insert Position for a Target

    EasyBinary SearchTagged at 7 companies
  4. 4

    Find the Peak Index in a Mountain Array

    EasyBinary SearchTagged at 7 companies
  5. 5

    Resource Allocation Matcher

    EasyTwo PointersTagged at 7 companies
  6. 6

    Subarray Sum Equals K

    MediumArrayTagged at 7 companies
  7. 7

    Non-overlapping Intervals

    MediumGreedyTagged at 7 companies
  8. 8

    Calculate Power of a Number (x^n)

    MediumRecursionTagged at 7 companies
  9. 9

    Determine if String Can Be Segmented by Word Dictionary

    MediumRecursionTagged at 7 companies
  10. 10

    Design a Time-Based Key-Value Store (TimeMap)

    MediumBinary SearchTagged at 7 companies
  11. 11

    Find K Closest Elements to a Target X

    MediumBinary SearchTagged at 7 companies
  12. 12

    Traverse a Matrix in Spiral Order

    MediumArrayTagged at 7 companies
  13. 13

    Find All Non-overlapping Intervals (Minimum Erasures)

    MediumArrayTagged at 7 companies
  14. 14

    Social Media Viral Hashtag Grouping

    MediumSliding WindowTagged at 7 companies
  15. 15

    Network Uptime Longest Streak

    MediumSliding WindowTagged at 7 companies
  16. 16

    NLP Text Analyzer Vowels

    MediumSliding WindowTagged at 7 companies
  17. 17

    Count Number of Occurrences of a Key in Linked List

    EasyLinkedListTagged at 6 companies
  18. 18

    Find the N/k-th Node in a Linked List (Fractional Node)

    EasyLinkedListTagged at 6 companies
  19. 19

    Longest Increasing Subsequence

    MediumDynamic ProgrammingTagged at 6 companies
  20. 20

    Maximum Number of Non-Overlapping Subarrays With Sum Equals Target

    MediumDPTagged at 6 companies
  21. 21

    Calculate the Score of a Parentheses String

    MediumStack and QueueTagged at 6 companies
  22. 22

    Find the Shortest Unsorted Continuous Subarray

    MediumStack and QueueTagged at 6 companies
  23. 23

    Implement a Flatten Nested List Iterator

    MediumStack and QueueTagged at 6 companies
  24. 24

    Copy a Linked List with Random Pointer

    MediumLinkedListTagged at 6 companies
  25. 25

    Design and Implement an LRU (Least Recently Used) Cache

    MediumLinkedListTagged at 6 companies
  26. 26

    Find the Diameter of an N-ary Tree

    MediumTreeTagged at 6 companies
  27. 27

    Implement a Binary Heap (Min-Heap) - ExtractMin

    MediumTreeTagged at 6 companies
  28. 28

    Convert an N-ary Tree to a Binary Tree

    MediumTreeTagged at 6 companies
  29. 29

    Implement Deletion from a Binary Search Tree (BST)

    MediumTreeTagged at 6 companies
  30. 30

    Validate a Binary Search Tree (In-order Traversal)

    MediumTreeTagged at 6 companies
  31. 31

    Find Longest Repeating Character Replacement

    MediumStringTagged at 6 companies
  32. 32

    Simplify a Unix-Style Absolute File System Path

    MediumStringTagged at 6 companies
  33. 33

    Remove All Adjacent Duplicates in a String II (K Duplicates)

    MediumStringTagged at 6 companies
  34. 34

    Zoom Meeting Room Provisioning

    MediumIntervalsTagged at 6 companies
  35. 35

    First Missing Positive

    HardArrayTagged at 6 companies
  36. 36

    Find the Median of Two Sorted Arrays

    HardBinary SearchTagged at 6 companies
  37. 37

    Find the K-th Smallest Prime Fraction

    HardBinary SearchTagged at 6 companies
  38. 38

    Number of Connected Components in an Undirected Graph

    MediumGraphTagged at 5 companies
  39. 39

    Design an In-Memory File System

    MediumDesignTagged at 5 companies
  40. 40

    Time Based Key-Value Store

    MediumDesignTagged at 5 companies
  41. 41

    Detect Cycle in Undirected Graph

    MediumGraphTagged at 5 companies
  42. 42

    Merge k Sorted Linked Lists

    HardLinkedListTagged at 5 companies
  43. 43

    Design and Implement an LFU (Least Frequently Used) Cache

    HardLinkedListTagged at 5 companies
  44. 44

    Implement Full Text Justification for a String

    HardStringTagged at 5 companies
  45. 45

    Implement the Knuth-Morris-Pratt (KMP) Prefix Function (LPS)

    HardStringTagged at 5 companies
  46. 46

    Interleaving String

    HardDPTagged at 4 companies
  47. 47

    Best Time to Buy and Sell Stock III

    HardDPTagged at 4 companies
  48. 48

    Find Median from Data Stream

    HardHeapTagged at 3 companies

More company sheets