Postman interview experience Real time questions & tips from candidates to crack your interview

SDE - 1

Postman
upvote
share-icon
2 rounds | 3 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 4 months
Topics: DSA , OOPS, Algorithms, DBMS , Dynamic Programming , Graphs
Tip
Tip

Tip 1 : Take care of time complexity of Problems
Tip 2 : Solve as much DSA Problems
Tip 3 : Show some projects you worked on

Application process
Where: Referral
Eligibility: No Criteria
Resume Tip
Resume tip

Tip 1 : links to coding portfolios
Tip 2 : add projects

Interview rounds

01
Round
Easy
Video Call
Duration60 mins
Interview date27 Jul 2022
Coding problem1

Started with Introduction and few situational questions around problem solving. It was a panel of 2 people, 1 was SDE II
Gave me 3 problems to work with, no coding IDE were involved, they just asked me the approach.

1. Min Stack

Easy
0/40
Asked in companies
AmazonGoogleSwiggy

Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.

1. Push(num): Push the given number in the stack.
2. Pop: Remove and return the top element from the stack if present, else return -1.
3. Top: return the top element of the stack if present, else return -1.
4. getMin: Returns minimum element of the stack if present, else return -1.

For Example:

For the following input: 
1
5
1 1
1 2
4
2
3

For the first two operations, we will just insert 1 and then 2 into the stack which was empty earlier. So now the stack is => [2,1]
In the third operation, we need to return the minimum element of the stack, i.e., 1. So now the stack is => [2,1]
For the fourth operation, we need to pop the topmost element of the stack, i.e., 2. Now the stack is => [1]
In the fifth operation, we return the top element of the stack, i.e. 1 as it has one element. Now the stack is => [1]

So, the final output will be: 
1 2 1
Problem approach

What if you maintained 2 queues. One which stored the actual stack of element, and the other which stored the minimum of elements.
So when pushing new element,
min = min(top of minimum stack, current value) which is pushed to minimum stack.

However, this uses 2N memory.

Try solving now
02
Round
Medium
Online Coding Test
Duration90 minutes
Interview date3 Aug 2022
Coding problem2

3 coding questions - Backtracking, Graphs, and System Design

1. DBMS Question

Sharding a DB

 

2. Scramble String

Hard
15m average time
85% success
0/120
Asked in companies
PostmanCiscoRubrik, Inc.

You are given an integer ‘N’ and two strings ‘S’ and 'R' each having size = ‘N’. You can scramble the string ‘S’ to obtain string 'R' using the following operations:

1. If the length of the string is greater than 1:

  • Select any random index and split the string into two non-empty substrings. For e.g: if the string is ‘S’, then divide it into two non-empty substrings ‘A’ and ‘B’ such that ‘S’ = ‘A’ + ‘B’.
  • You can choose to swap the two substrings or keep them in the same order, i.e., after this operation string ‘S’ may become either ‘S’ = ‘A’ + ‘B’ or ‘S’ = ‘B’ + ‘A’.
  • Apply the first step recursively on each of the two strings ‘A’ and ‘B’.
  • 2. If the length of the string is equal to 1 then stop.

    Your task is to return true if 'R' is a scrambled string of ‘S’ else return false.

    Note:

    1. Both the strings are non-empty and are of the same length.
    
    2. You can apply the above operations any number of times on ‘S’.
    
    3. The operations can only be applied on the string ‘S’.
    
    4. ‘S’ and 'R' consist of lowercase letters only.
    
    Problem approach

    On every step, you need to figure out if there exists one of the positions at root, using which the 2 parts of strings are scrambled strings of each other.

    Try solving now

    Here's your problem of the day

    Solving this problem will increase your chance to get selected in this company

    Skill covered: Programming

    Which SQL keyword removes duplicate records from a result set?

    Choose another skill to practice
    Similar interview experiences
    SDE - 1
    3 rounds | 4 problems
    Interviewed by Postman
    1814 views
    0 comments
    0 upvotes
    company logo
    SDE - 1
    4 rounds | 8 problems
    Interviewed by Amazon
    3509 views
    0 comments
    0 upvotes
    company logo
    SDE - Intern
    1 rounds | 3 problems
    Interviewed by Amazon
    1408 views
    0 comments
    0 upvotes
    company logo
    SDE - 2
    4 rounds | 6 problems
    Interviewed by Expedia Group
    959 views
    0 comments
    0 upvotes
    Companies with similar interview experiences
    company logo
    SDE - 1
    5 rounds | 12 problems
    Interviewed by Amazon
    107832 views
    24 comments
    0 upvotes
    company logo
    SDE - 1
    4 rounds | 5 problems
    Interviewed by Microsoft
    52129 views
    5 comments
    0 upvotes
    company logo
    SDE - 1
    3 rounds | 7 problems
    Interviewed by Amazon
    32261 views
    6 comments
    0 upvotes