Broadcom Coding Interview Questions
25 Broadcom coding interview problems with full optimal solutions — 8 easy, 12 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 Broadcom interviewer values, and a FAQ section.
Showing 5 problems of 25
- #4hardoccasionally asked
4. Median of Two Sorted Arrays
Find the median of two sorted arrays in O(log(m+n)) time. Broadcom asks this because binary search on implicit data structures is a core skill for their systems engineers — the same partition-finding logic appears in percentile computation for network latency telemetry and SLA threshold analysis.
- #23hardfrequently asked
23. Merge K Sorted Lists
Merge k sorted linked lists into one sorted list efficiently. Broadcom asks this because multi-queue merging is a real operation in packet schedulers and priority-queue-based traffic shaping in Broadcom's Tomahawk switching ASICs — merging k traffic classes in O(n log k) is a production requirement.
- #42hardfrequently asked
42. Trapping Rain Water
Calculate total water trapped between bars of an elevation map. Broadcom asks this because the two-pointer technique and the min-of-max-prefix pattern directly generalise to buffer-fill calculations in streaming pipelines — a common problem in Broadcom's data-plane throughput analysis.
- #72hardoccasionally asked
72. Edit Distance
Compute the minimum number of insertions, deletions, and substitutions to transform one string into another. Broadcom asks this classic DP problem because Levenshtein distance underlies error-correcting code similarity metrics and firmware diff-patching algorithms — both critical in Broadcom's over-the-air update systems for embedded device fleets.
- #127hardoccasionally asked
127. Word Ladder
Find the shortest transformation sequence from one word to another, changing one letter at a time. Broadcom asks this because it is shortest-path BFS on an implicit graph — the same technique used to find minimum-hop routing paths and convergence analysis in network topology recalculation after a link failure.