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 3 problems of 25
- #3mediumvery frequently asked
3. Longest Substring Without Repeating Characters
Find the length of the longest substring with all unique characters using a sliding window. Broadcom asks this to verify sliding-window intuition — the same technique underlies congestion window management in TCP implementations embedded in Broadcom's network silicon.
- #146mediumvery frequently asked
146. LRU Cache
Design a cache that evicts the least-recently-used entry when full. Broadcom asks this because LRU is the dominant eviction policy in ARP caches, MAC address tables, and route-cache entries inside Broadcom's switching and routing ASICs — getting O(1) get and put right is a real firmware concern.
- #200mediumvery frequently asked
200. Number of Islands
Count connected components of land in a 2D grid. Broadcom asks this because graph connectivity is foundational to network-topology discovery — the same BFS/DFS that counts islands maps directly to identifying isolated segments in a physical switch topology or VLAN reachability analysis.