Challenges

Concept: Distance Algorithms You are tracking 20,000 asteroids in a 2D plane. Find how many pairs of asteroids are dangerously close to each other (distance < D).

Concept: Data Duplication The central server receives massive user-profile objects from edge nodes. Write a function that scans a given profile and returns true if the user’s suspicion score is over 90.

Concept: Memory Architecture You are processing a 2D topographical map of the ocean floor represented as a massive grid. Calculate the sum of all elevation points.

Concept: Redundant Operations Your satellite has recorded 1,000,000 seconds of solar radiation data. Find the maximum radiation absorbed in any continuous block of exactly k seconds.

Concept: Efficient Search Structures Your orbital relay processes millions of data packets. You are given a database of 100,000 known telemetry routes (e.g., "MARS.BASE.ALPHA") and an incoming stream of 10,000 partial route queries (e.g., "MARS.BASE"). Return how many queries match the start of a known route.

Concept: Concurrency Scaling A deep space telescope has captured an array of signal frequencies. You must apply a heavy mathematical smoothing algorithm to every frequency. The payload sizes vary wildly: sometimes 10 signals, and sometimes 10,000,000.

Concept: Resource Management You are programming the Ares I Mars Rover's communication relay. The orbiter will be in position in exactly delay ms milliseconds. You must wait exactly that long to save battery, then encrypt and return the transmission payload.