Postman Staff Software Engineer Interview Questions and Answers

It was good 20 mcqs 3 coding questions

Q1. Dsa and core subjects like cn os
Add your answer
Q2. Dsa questions and core subjects
Add your answer

Q1. Basic family discussion and salary details
Add your answer

2 Leetcode Medium questions on hackerrank

Q1. Kadane algorithm based question
Add your answer
Q2. Leetcode medium
Add your answer
Q3. Resume based questions
Add your answer

Q1. Probability question math problem
Add your answer
Q2. Puzzle to solve
Add your answer
Q3. AI based question
Add your answer
Q4. 1 question to solve Leetcode medium
Add your answer

It was not good their approach of asking questions not good

Q1. Dsa graph topological sorting
Add your answer
Q2. DSA tree question and largest bst
Add your answer

Aptitude was including both MCQs and Input

Q1. Technical interview 1 It revolved around core subjects Like OS, Oops, CNS, dbms etc,. And few basic questions on arrays
Add your answer
Q2. Difference between python and C
Ans. 
Python is a high-level, interpreted language known for its simplicity and readability, while C is a low-level, compiled language known for its speed and efficiency.
• Python is dynamically typed, while C is statically typed.

• Python has automatic memory management, while C requires manual memory management.

• Python is platform-independent, while C is platform-dependent.

• Python is commonly used for web development and data anal...read more
Answered by AI
Add your answer
Q3. Why C is faster than python
Ans. 
C is faster than Python due to its lower-level nature and direct hardware access.
• C is a compiled language, while Python is an interpreted language.

• C code is directly translated into machine code, while Python code is executed line by line.

• C has direct access to hardware, while Python relies on external libraries for such access.
Answered by AI
Add your answer
Q4. Write a program to count vowels in your name
Ans. 
A program to count vowels in a given name
• Create a function that takes a string as input

• Loop through each character in the string and check if it is a vowel (a, e, i, o, u)

• Increment a counter for each vowel found

• Return the total count of vowels
Answered by AI
Add your answer

Q1. Technical interview 2 Focuses on DSA
Add your answer
Q2. Write quick sort
Ans. 
Quick sort is a divide-and-conquer algorithm that sorts an array by partitioning it into smaller sub-arrays.
• Choose a pivot element from the array

• Partition the array into two sub-arrays based on the pivot element

• Recursively apply quick sort to the sub-arrays

• Combine the sorted sub-arrays to get the final sorted array
Answered by AI
Add your answer
Q3. Implement Linked list
Ans. 
Implement a linked list data structure in a programming language.
• Create a Node class with data and a reference to the next node

• Implement methods to add, remove, and search for elements in the linked list

• Handle edge cases like adding to an empty list or removing the last element
Answered by AI
Add your answer
Q4. All operations on Linked list
Ans. 
Operations on Linked list include insertion, deletion, traversal, and searching.
• Insertion: Add a new node at the beginning, end, or middle of the linked list.

• Deletion: Remove a node from the linked list based on a given key or position.

• Traversal: Visit each node in the linked list to perform operations or display data.

• Searching: Find a specific node in the linked list based on a given key or value.
Answered by AI
Add your answer
Q5. Basic machine learning algorithms
Add your answer

Q1. Basic fitment questions
Add your answer
Q2. Introduction and flexibility
Add your answer

Q1. Pointless basic questions is what they asked
Add your answer

Q1. They had this round for hours together
Add your answer

Basic dsa questions and java spring boot questions

Q1. Bookmyshow design
Add your answer
Q2. Notification service design
Ans. 
Design a notification service for sending alerts to users.
• Use a scalable messaging system like Kafka or RabbitMQ to handle high volume of notifications.

• Implement a notification queue to ensure reliable delivery of notifications.

• Include support for different types of notifications such as email, SMS, and push notifications.

• Allow users to customize their notification preferences and frequency.

• Implement monitoring and log...read more
Answered by AI
Add your answer

Q1. Mimic Dataframe Merge
Ans. 
Implement a function to mimic the functionality of merging two DataFrames in Python.
• Create a function that takes two DataFrames as input.

• Merge the two DataFrames based on a common column or index.

• Handle different types of joins like inner, outer, left, and right joins.

• Return the merged DataFrame as output.
Answered by AI
Add your answer
Q2. Improve above case by case
Add your answer

1 hour - Find longest palindromic substring

60 Minutes coding test was there

Q1. Worst experience ever, never apply for company in this, highly unstable company
Add your answer
Q2. Add two numbers in a linked list, don't apply
Ans. 
Traverse the linked list and add the values of each node without using additional data structures.
• Traverse the linked list while keeping track of the sum in a variable

• Update the sum by adding the value of each node as you traverse the list

• Handle carry over if the sum of two nodes is greater than 9
Answered by AI
Add your answer
Q3. Sort the array by using all sorting algorithms, don't join
Add your answer
Q4. Subset problem find all the subsets
Ans. 
To find all subsets of a given set, use recursion to generate all possible combinations.
• Use recursion to generate all possible combinations of including or excluding each element in the set.

• Start with an empty subset and recursively add each element to create new subsets.

• Each subset can be represented as an array of strings.
Answered by AI
Add your answer
Q5. LRU Cache problem, explain it and implement it
Ans. 
LRU Cache is a data structure that stores a fixed number of items and removes the least recently used item when the cache is full.
• LRU Cache uses a combination of a doubly linked list and a hashmap to efficiently store and retrieve items.

• When an item is accessed, it is moved to the front of the linked list to indicate it is the most recently used item.

• If the cache is full, the least recently used item at the end of the ...read more
Answered by AI
Add your answer