Postman Coding Interview Questions
32 Postman coding interview problems with full optimal solutions — 10 easy, 17 medium, 5 hard. Every problem ships with multiple approaches (brute-force first, then the optimal), complexity tables for each, company-specific tips on what an Postman interviewer values, and a FAQ section.
Showing 10 problems of 32
- #1easyfoundational
1. Two Sum
Given an array of integers and a target, return indices of the two numbers that add up to the target.
- #2easyfoundational
2. Valid Parentheses
Given a string of brackets, determine if every opening bracket has a matching closing bracket in the correct order.
- #3easyfoundational
3. Merge Two Sorted Lists
Merge two sorted linked lists into a single sorted list by splicing nodes.
- #4easyfoundational
4. Best Time to Buy and Sell Stock
Find the maximum profit from one buy-sell transaction on a price timeline.
- #5easyfoundational
5. Reverse Linked List
Reverse a singly linked list in place and return the new head.
- #6easyfoundational
6. Contains Duplicate
Return true if any value appears at least twice in an integer array.
- #7easyfoundational
7. Valid Anagram
Return true if two strings are anagrams of each other.
- #8easyfoundational
8. Valid Palindrome
Determine whether a string is a palindrome after stripping non-alphanumerics and lowercasing.
- #9easyfoundational
9. Binary Tree Inorder Traversal
Return the inorder traversal of a binary tree's values.
- #28easyfoundational
28. Climbing Stairs
Count distinct ways to climb n stairs taking 1 or 2 steps at a time.