Problems
Pick a problem and write your solution in the built-in editor. The judge runs it against real test cases while you watch, and the wider archive is open to read whenever you like.
Total results123 problems
| Title | Level | Topics | Solved | Time limit | Memory limit | Judge |
|---|---|---|---|---|---|---|
| Swimming JamSimulate multiple swimmers sharing two lanes with blocking and end-of-lane reordering rules to compute the total time until everyone finishes their assigned laps. | Medium7 | SimulationQueue+1 | No attempts yet | 1s | 128 MB | Judgeable |
| Hit or MissSimulate a multi-player solitaire card game and either report the last card each player discarded or declare the position unwinnable. | Medium7 | SimulationQueue+2 | No attempts yet | 1s | 128 MB | Judgeable |
| Get Them AllSimulate the vehicle dispatch and routing rules to find when all contestants reach the contest site, or how many arrive by the time limit. | Medium7 | SimulationImplementation+1 | No attempts yet | 1s | 128 MB | Judgeable |
| Walking the PlankSimulate pirates crossing a one-at-a-time plank to ferry N items, honoring side-priority, FIFO queues, and ties broken by slowest pirate. | Medium7 | SimulationQueue+1 | No attempts yet | 1s | 128 MB | Judgeable |
| ExpressionsGiven a postfix expression, produce another postfix expression that the same algorithm evaluates to the same value when a queue replaces the stack. | Medium7 | StackQueue+2 | No attempts yet | 1s | 128 MB | Judgeable |
| AirportThe tower serves one of two waiting lines at each time to minimize the worst waiting position any aircraft receives. | Medium7 | Binary searchGreedy+1 | No attempts yet | 1s | 128 MB | Judgeable |
| Shortest Subsequence With Sum at Least XFind the length of the shortest contiguous subarray whose sum is at least X, or report -1 when none exists. | Medium7 | Prefix sumQueue | No attempts yet | 3s | 256 MB | Judgeable |
| KimchiPick bury and take-out days at most D apart to maximize aging days times take-out temperature plus crock value while temperatures fall. | Medium7 | Dynamic programmingSliding window+1 | No attempts yet | 1s | 256 MB | Judgeable |
| Iceberg OrdersSimulate an order book with iceberg orders that match by best price then priority and refresh visible tips until each incoming order fills or rests. | Medium7 | SimulationHeap+1 | No attempts yet | 1s | 256 MB | Judgeable |
| Snake Game SimulationSimulate a snake that grows on checkerboard food on a wrapping board with timed turns and report its length after death or one billion steps. | Medium7 | SimulationQueue+2 | No attempts yet | 5s | 512 MB | Judgeable |
| Flow ShopGiven N jobs processed through M stages in the same order with per-job times, and a smallest-label-first queue rule at each stage, find each job's finish time. | Medium7 | SimulationQueue+1 | No attempts yet | 6s | 512 MB | Judgeable |
| IncineratorMaintain a queue of waste and M incinerator cells under burn, query, append, and recycle commands, then report the final cells. | Medium7 | ImplementationQueue+2 | No attempts yet | 2s | 512 MB | Judgeable |
| Sehun's Gift ShopSimulate two workers racing to wrap gifts from a shared front queue, respecting order arrival times and a tie-break rule, then report which gift numbers each wrapped. | Medium7 | SimulationImplementation+2 | No attempts yet | 1s | 512 MB | Judgeable |
| RumorGiven a graph and initial spreaders, each uninfected person adopts the rumor once more than half of their neighbors believe it; report the adoption minute for everyone. | Medium7 | GraphBFS+2 | No attempts yet | 10s | 1024 MB | Judgeable |
| Burger KingSimulate multiple restaurant queues with dynamic employee replacements and arrivals, tracking the optimal switching strategy to find when the team can order. | Hard8 | SimulationGreedy+1 | No attempts yet | 2s | 128 MB | Judgeable |
| WhenExecute a complete When program, an event-driven language with simultaneous Set assignments and a rotating active-clause scheduler, and print its output. | Hard8 | SimulationImplementation+2 | No attempts yet | 1s | 128 MB | Judgeable |
| The Byteotian WarBoth players take turns discarding one of their top two cards and passing the other to the opponent; find the final score when both play optimally. | Hard8 | Dynamic programmingGame theory+2 | No attempts yet | 1s | 128 MB | Judgeable |
| New Year TrainAssign each wagon in input order to one of M queue tracks so wagons exit numbered 1 to N, choosing the lexicographically smallest assignment. | Hard8 | GreedyQueue+1 | No attempts yet | 2s | 256 MB | Judgeable |
| Back to the FutureGiven a graph of compatible pairs, find the largest vertex subset where each chosen vertex has at least A neighbors and at least B non-neighbors inside the subset. | Hard8 | GraphGreedy+2 | No attempts yet | 2s | 512 MB | Judgeable |
| The ABCD MurdererFind the fewest word occurrences needed to cover a target text exactly when cut-outs may overlap on matching text, or report -1 if impossible. | Hard8 | String matchingArray+2 | No attempts yet | 2s | 512 MB | Judgeable |
| ChampionshipsFind the largest set of vertices in an undirected graph that is connected and where every vertex has at least d neighbors inside the set. | Hard8 | GraphImplementation+2 | No attempts yet | 2s | 512 MB | Judgeable |
| Right-hand obstructionCars arrive in four queues at a crossroad; a front car passes only if the queue on its right is empty, so simulate second by second and report each car's crossing time or -1. | Hard8 | SimulationQueue+2 | No attempts yet | 1s | 512 MB | Judgeable |
| Asynchronous ExceptionsSimulate a multithreaded scheduler with yields, kills, fork modes, loops, and semaphores, then report each thread's finishing time and the final state. | Hard9 | SimulationHeap+2 | No attempts yet | 5s | 512 MB | Judgeable |