Overview

Interview problems involving greedy algorithms, optimization strategies, and efficient resource allocation.

• Packetize Data Optimally — Split data into packets minimizing count first, then minimizing the largest packet size.
• Optimal Fun Event Selection — Select team events that maximize total attendance given availability constraints.
• Create a Match Maker — Design an online matchmaking system that pairs players with close skill ratings.
• Winners of Tournament — Simulate a knockout tournament bracket to find the winner under deterministic or probabilistic outcomes.
• Parse Paginated Results — Implement a search client that retrieves and ranks results from a paginated API.
• Elections with Partial Information — Determine an election winner (or declare it impossible) when districts only report their top candidates.