Box Coding Interview Questions
31 Box coding interview problems with full optimal solutions — 20 easy, 11 medium, 0 hard. Every problem ships with multiple approaches (brute-force first, then the optimal), complexity tables for each, company-specific tips on what an Box interviewer values, and a FAQ section.
Showing 11 problems of 31
- #20mediumfoundational
20. LRU Cache
Design a Least Recently Used cache with O(1) get and put — Box engineers face this exact tradeoff when caching frequently accessed file metadata and thumbnail previews across their enterprise CDN.
- #21mediumfoundational
21. Number of Islands
Count connected regions in a binary grid — Box uses a structurally identical algorithm to discover isolated file clusters and orphaned permission groups inside enterprise collaboration networks.
- #22mediumfoundational
22. Implement Trie (Prefix Tree)
Build a prefix tree supporting insert, search, and startsWith — the same data structure Box uses to power the instant path-autocomplete in their Drive search bar as users type folder and file names.
- #23mediumfoundational
23. Binary Tree Level Order Traversal
Return all nodes level by level in a binary tree — Box applies BFS traversal to render nested folder hierarchies in their web UI, surfacing each depth layer of a directory tree in order.
- #24mediumfoundational
24. Course Schedule
Detect a cycle in a directed prerequisite graph — Box solves the same problem when validating that enterprise workflow automation rules and folder-permission inheritance chains contain no circular dependencies.
- #25mediumfoundational
25. Merge Intervals
Collapse overlapping time ranges into a minimal set — Box applies this exact algorithm when computing consolidated file-lock windows and audit-trail time ranges across concurrent enterprise users.
- #26mediumfoundational
26. Flatten Nested List Iterator
Produce a lazy iterator over a deeply nested list — this mirrors how Box's content API streams a recursively nested folder tree to clients one file at a time without loading the full hierarchy into memory.
- #27mediumfoundational
27. Meeting Rooms II
Find the minimum number of rooms required for overlapping meetings — Box uses an identical interval-scheduling model to determine peak concurrent file-lock holders and size their distributed lock server fleet.
- #29mediumfoundational
29. Word Break
Determine if a string can be segmented using a dictionary of valid tokens — Box applies the same DP to validate that composite file paths and auto-generated document slugs can be decomposed into recognized folder and tag components.
- #30mediumfoundational
30. Clone Graph
Deep-clone an undirected graph without duplicating shared nodes — Box uses structurally identical logic when snapshotting a file-permission graph to create an isolated copy for audit trails and compliance exports.
- #31mediumfoundational
31. Find All Anagrams in a String
Return every starting index where a permutation of a pattern appears in a text — Box uses a sliding-window approach identical to this when scanning large file contents for permutations of security-sensitive keyword patterns during compliance checks.