Postman Senior Software Engineer 2 Interview Questions and Answers

Consist 3 coding questions medium level

Q1. Asked about java concept
Add your answer
Q2. Sql query basics
Add your answer

Q1. Asked medium to advance level oops java concept
Add your answer
Q2. Deep discussion over project
Add your answer

Q1. Hard level linked list questions
Add your answer
Q2. Advanced level sql query
Add your answer

Q1. Question around priority queue
Add your answer
Q2. Decode strings leetcode
Add your answer

Q1. System design questions scenario based
Add your answer

Q1. Questions on multidimensional tree
Add your answer

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

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

Some Objective questions and 1 Coding Questions

Q1. Situation based questions on Coroutines
Add your answer
Q2. About Project Tech Stack Used and Questions on that
Add your answer

2 DSA questions Both are from DP

Q1. 2 Questions , 1 is DSA
Add your answer
Q2. Second question is Puzzle
Add your answer

There were 3 questions in the online assessment.

1 - Binary Search
2 - DP
3 - Graphs

Q1. Implement a persistence stack with constant time operations
Ans. 
Implement a persistence stack with constant time operations
• Use a combination of a stack and a hashmap to achieve constant time operations for push, pop, and get operations

• Maintain a stack to store the elements and a hashmap to store the index of each element in the stack

• When pushing an element, add it to the stack and update its index in the hashmap

• When popping an element, remove it from the stack and also remove its i...read more
Answered by AI
Add your answer

Q1. Median of two sorted arrays and OOPs basics
Ans. 
Finding the median of two sorted arrays and discussing OOPs basics
• To find the median of two sorted arrays, merge the arrays and then calculate the median

• OOPs basics include concepts like encapsulation, inheritance, polymorphism, and abstraction

• Example: Median of [1, 3] and [2] is 2.0
Answered by AI
Add your answer