Brex Coding Interview Questions
25 Brex coding interview problems with full optimal solutions — 13 easy, 9 medium, 3 hard. Every problem ships with multiple approaches (brute-force first, then the optimal), complexity tables for each, company-specific tips on what an Brex interviewer values, and a FAQ section.
Showing 3 problems of 25
- #20hardfoundational
20. Trapping Rain Water
Calculate how much water can be trapped between elevation bars — a two-pointer / stack classic that Brex uses to evaluate array reasoning under tight complexity constraints.
- #22hardfoundational
22. Median of Two Sorted Arrays
Find the median of two sorted arrays in O(log(m+n)) — a binary search on partition problem that Brex uses to assess candidates' ability to handle ordered financial data sets efficiently.
- #25hardfoundational
25. Serialize and Deserialize Binary Tree
Encode a binary tree to a string and decode it back — a design + traversal problem Brex uses to probe candidates' thinking about data persistence and approval-hierarchy snapshots.