Booking Coding Interview Questions
29 Booking coding interview problems with full optimal solutions — 17 easy, 10 medium, 2 hard. Every problem ships with multiple approaches (brute-force first, then the optimal), complexity tables for each, company-specific tips on what an Booking interviewer values, and a FAQ section.
Showing 17 problems of 29
- #17easyfoundational
17. Meeting Rooms
Determine if a person can attend all meetings — Booking applies the same interval-overlap check when validating that a property's booking windows never collide on the same room.
- #1easyfoundational
1. Two Sum
Find two indices whose values sum to a target — Booking uses this to gauge baseline hashmap fluency for travel-pricing pair lookups.
- #2easyfoundational
2. Valid Parentheses
Use a stack to validate matching brackets — Booking screens this to confirm you can model nested filter expressions in search.
- #3easyfoundational
3. Merge Two Sorted Lists
Merge two sorted linked lists — Booking uses this to test pointer manipulation that mirrors merging two supplier availability streams.
- #4easyfoundational
4. Remove Duplicates from Sorted Array
Deduplicate a sorted array in-place — Booking checks this to ensure you can collapse duplicate availability rows efficiently.
- #5easyfoundational
5. Remove Element
In-place delete a target value — Booking screens this to confirm you can purge expired availability rows without re-allocating.
- #6easyfoundational
6. Search Insert Position
Binary-search the insertion index — Booking probes this to confirm you can position a new price into a sorted dynamic-pricing curve.
- #7easyfoundational
7. Plus One
Increment a digit-array by one — Booking uses this to baseline carry-handling logic seen in pricing-rule cascades.
- #8easyfoundational
8. Merge Sorted Array
Merge two sorted arrays in-place — Booking tests this to see if you can fold a supplier price update into the master availability array without extra memory.
- #9easyfoundational
9. Binary Tree Inorder Traversal
Inorder-walk a binary tree — Booking checks this to confirm you can flatten a hierarchical destination tree into a search-ready ordering.
- #10easyfoundational
10. Same Tree
Decide if two binary trees match — Booking uses this to gauge whether you can compare cached vs live availability trees.
- #11easyfoundational
11. Symmetric Tree
Detect mirror symmetry in a binary tree — Booking uses this to test structural-recursion fluency on hierarchical region indexes.
- #12easyfoundational
12. Maximum Depth of Binary Tree
Compute depth of a binary tree — Booking screens this to confirm baseline tree recursion before scaling to region/destination hierarchies.
- #13easyfoundational
13. Balanced Binary Tree
Decide if a binary tree is height-balanced — Booking screens this to gauge whether you can keep destination index trees from skewing.
- #14easyfoundational
14. Minimum Depth of Binary Tree
Find the shortest root-to-leaf depth — Booking checks this to test BFS shortest-path intuition transferable to fastest-fallback supplier lookups.
- #15easyfoundational
15. Pascal's Triangle
Generate the first n rows of Pascal's Triangle — Booking screens this for clean iterative-DP wiring before moving to availability-grid DP.
- #16easyfoundational
16. Best Time to Buy and Sell Stock
Pick the optimal buy/sell day pair — Booking probes this as a stand-in for finding the best snap-up window in a dynamic-pricing time series.